The Experts below are selected from a list of 10381851 Experts worldwide ranked by ideXlab platform
Zachary V Heidepriem - One of the best experts on this subject based on the ideXlab platform.
-
a new structural coverage criterion for dynamic detection of program invariants
Automated Software Engineering, 2003Co-Authors: Neelam Gupta, Zachary V HeidepriemAbstract:Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run with the invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
-
ASE - A new structural coverage criterion for dynamic detection of program invariants
18th IEEE International Conference on Automated Software Engineering 2003. Proceedings., 1Co-Authors: Neelam Gupta, Zachary V HeidepriemAbstract:Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run with the invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
Neelam Gupta - One of the best experts on this subject based on the ideXlab platform.
-
a new structural coverage criterion for dynamic detection of program invariants
Automated Software Engineering, 2003Co-Authors: Neelam Gupta, Zachary V HeidepriemAbstract:Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run with the invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
-
ASE - A new structural coverage criterion for dynamic detection of program invariants
18th IEEE International Conference on Automated Software Engineering 2003. Proceedings., 1Co-Authors: Neelam Gupta, Zachary V HeidepriemAbstract:Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run with the invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
Peter J. Olver - One of the best experts on this subject based on the ideXlab platform.
-
affine differential invariants for invariant feature point detection
European Journal of Applied Mathematics, 2020Co-Authors: Stanley L Tuznik, Peter J. Olver, Allen TannenbaumAbstract:Image feature points are detected as pixels which locally maximise a detector function, two commonly used examples of which are the (Euclidean) image gradient and the Harris–Stephens corner detector. A major limitation of these feature detectors is that they are only Euclidean-invariant. In this work, we demonstrate the application of a 2D equi-affine-invariant image feature point detector based on differential invariants as derived through the equivariant method of moving frames. The fundamental equi-affine differential invariants for 3D image volumes are also computed.
-
Moving frames and differential invariants in centro-affine geometry
Lobachevskii Journal of Mathematics, 2010Co-Authors: Peter J. OlverAbstract:Explicit formulas for the generating differential invariants and invariant differential operators for curves in two- and three-dimensional centro-equi-affine and centro-affine geometry and surfaces in three-dimensional centro-equi-affine geometry are constructed using the equivariant method of moving frames. In particular, the algebra of centro-equi-affine surface differential invariants is shown to be generated by a single second order invariant.
-
Differential invariants of surfaces
Differential Geometry and its Applications, 2009Co-Authors: Peter J. OlverAbstract:Abstract The algebra of differential invariants of a suitably generic surface S ⊂ R 3 , under either the usual Euclidean or equi-affine group actions, is shown to be generated, through invariant differentiation, by a single differential invariant. For Euclidean surfaces, the generating invariant is the mean curvature, and, as a consequence, the Gauss curvature can be expressed as an explicit rational function of the invariant derivatives, with respect to the Frenet frame, of the mean curvature. For equi-affine surfaces, the generating invariant is the third order Pick invariant. The proofs are based on the new, equivariant approach to the method of moving frames.
-
Moving Coframes: II. Regularization and Theoretical Foundations
Acta Applicandae Mathematica, 1999Co-Authors: Mark Fels, Peter J. OlverAbstract:The primary goal of this paper is to provide a rigorous theoretical justification of Cartan’s method of moving frames for arbitrary finite-dimensional Lie group actions on manifolds. The general theorems are based a new regularized version of the moving frame algorithm, which is of both theoretical and practical use. Applications include a new approach to the construction and classification of differential invariants and invariant differential operators on jet bundles, as well as equivalence, symmetry, and rigidity theorems for submanifolds under general transformation groups. The method also leads to complete classifications of generating systems of differential invariants, explicit commutation formulae for the associated invariant differential operators, and a general classification theorem for syzygies of the higher order differentiated differential invariants. A variety of illustrative examples demonstrate how the method can be directly applied to practical problems arising in geometry, invariant theory, and differential equations.
-
Differential and Numerically Invariant Signature Curves Applied to Object Recognition
International Journal of Computer Vision, 1998Co-Authors: Eugenio Calabi, Peter J. Olver, Chehrzad Shakiban, Allen Tannenbaum, Steven HakerAbstract:We introduce a new paradigm, the differential invariant signature curve or manifold, for the invariant recognition of visual objects. A general theorem of É. Cartan implies that two curves are related by a group transformation if and only if their signature curves are identical. The important examples of the Euclidean and equi-affine groups are discussed in detail. Secondly, we show how a new approach to the numerical approximation of differential invariants, based on suitable combination of joint invariants of the underlying group action, allows one to numerically compute differential invariant signatures in a fully group-invariant manner. Applications to a variety of fundamental issues in vision, including detection of symmetries, visual tracking, and reconstruction of occlusions, are discussed.
Mark Behrens - One of the best experts on this subject based on the ideXlab platform.
-
root invariants in the adams spectral sequence
Transactions of the American Mathematical Society, 2005Co-Authors: Mark BehrensAbstract:Let E be a ring spectrum for which the E-Adams spectral sequence converges. We define a variant of Mahowald's root invariant called the 'filtered root invariant' which takes values in the E 1 term of the E-Adams spectral sequence. The main theorems of this paper are concerned with when these filtered root invariants detect the actual root invariant, and explain a relationship between filtered root invariants and differentials and compositions in the E-Adams spectral sequence. These theorems are compared to some known computations of root invariants at the prime 2. We use the filtered root invariants to compute some low-dimensional root invariants of v 1 -periodic elements at the prime 3. We also compute the root invariants of some infinite v 1 -periodic families of elements at the prime 3.
-
root invariants in the adams spectral sequence
arXiv: Algebraic Topology, 2005Co-Authors: Mark BehrensAbstract:Let E be a ring spectrum for which the E-Adams spectral sequence converges. We define a variant of Mahowald's root invariant called the `filtered root invariant' which takes values in the E_1 term of the E-Adams spectral sequence. The main theorems of this paper concern when these filtered root invariants detect the actual root invariant, and explain a relationship between filtered root invariants and differentials and compositions in the E-Adams spectral sequence. These theorems are compared to some known computations of root invariants at the prime 2. We use the filtered root invariants to compute some low dimensional root invariants of v_1-periodic elements at the prime 3. We also compute the root invariants of some infinite v_1-periodic families of elements at the prime 3.
Karem A. Sakallah - One of the best experts on this subject based on the ideXlab platform.
-
i4 incremental inference of inductive invariants for verification of distributed protocols
Symposium on Operating Systems Principles, 2019Co-Authors: Aman Goel, Jean-baptiste Jeannin, Manos Kapritsos, Baris Kasikci, Karem A. SakallahAbstract:Designing and implementing distributed systems correctly is a very challenging task. Recently, formal verification has been successfully used to prove the correctness of distributed systems. At the heart of formal verification lies a computer-checked proof with an inductive invariant. Finding this inductive invariant, however, is the most difficult part of the proof. Alas, current proof techniques require inductive invariants to be found manually---and painstakingly---by the developer. In this paper, we present a new approach, Incremental Inference of Inductive Invariants (I4), to automatically generate inductive invariants for distributed protocols. The essence of our idea is simple: the inductive invariant of a finite instance of the protocol can be used to infer a general inductive invariant for the infinite distributed protocol. In I4, we create a finite instance of the protocol; use a model checking tool to automatically derive the inductive invariant for this finite instance; and generalize this invariant to an inductive invariant for the infinite protocol. Our experiments show that I4 can prove the correctness of several distributed protocols like Chord, 2PC and Transaction Chains with little to no human effort.
-
towards automatic inference of inductive invariants
Proceedings of the Workshop on Hot Topics in Operating Systems, 2019Co-Authors: Aman Goel, Jean-baptiste Jeannin, Manos Kapritsos, Baris Kasikci, Karem A. SakallahAbstract:Distributed systems are notoriously difficult to design and implement correctly. Formal verification provides correctness proofs, and has recently been successfully applied to various distributed systems. At the heart of a typical formal verification is a computer-checked proof with an inductive invariant. Finding this inductive invariant is the hardest part of the proof: a part that is currently undertaken manually by the developer and is responsible for most of the effort associated with formal verification. In this paper, we present a new approach: Incremental Inference of Inductive Invariants (I4), to automatically generate inductive invariants for distributed protocols. We start from a simple idea: the inductive invariant of a finite instance of the protocol must be an instance of a general inductive invariant for the infinite distributed protocol. In I4, we instantiate a finite instance of the protocol, work out the finite inductive invariant of this instance, then figure out the general inductive invariant as a generalization of the finite invariant. Our experiments show that I4 can finish the general proof of correctness of several systems with minimal human effort.
