AbstractThis paper shows how to integrate two complementary techniques for manipulating program invariants: dynamic detection and static verification. Dynamic detection proposes likely invariants based on program executions, but the resulting properties are not guaranteed to be true over all possible executions. Static verification checks that properties are always true, but it can be difficult and tedious to select a goal and to annotate programs for input to a static checker. Combining these techniques overcomes the weaknesses of each: dynamically detected invariants can annotate a program or provide goals for static verification, and static verification can confirm properties proposed by a dynamic tool.We have integrated a tool for dynam...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
This paper describes three contributions I made to our system which collectively produce the executi...
Abstract—Verifiers that can prove programs correct against their full functional specification requi...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
Static checking can verify the absence of errors in a program, but often requires written annotation...
Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant...
AbstractDaikon is an implementation of dynamic detection of likely invariants; that is, the Daikon i...
Software development and maintenance are costly endeavors. The cost can be reduced if more software ...
Dynamic invariant detection is the process of distilling invariants from information about a program...
Verifiers that can prove programs correct against their full functional specification require, for p...
Dynamic invariant detection is a software analysis technique that uses traces of function entry and ...
Abstract: This paper introduces formal verification techniques applied by PolySpace Verifier as a st...
Object invariants describe the consistency of object-oriented data structures and are central to rea...
The specifications of a program can be dynamically inferred from its executions, or equivalently, fr...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
This paper describes three contributions I made to our system which collectively produce the executi...
Abstract—Verifiers that can prove programs correct against their full functional specification requi...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
Static checking can verify the absence of errors in a program, but often requires written annotation...
Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant...
AbstractDaikon is an implementation of dynamic detection of likely invariants; that is, the Daikon i...
Software development and maintenance are costly endeavors. The cost can be reduced if more software ...
Dynamic invariant detection is the process of distilling invariants from information about a program...
Verifiers that can prove programs correct against their full functional specification require, for p...
Dynamic invariant detection is a software analysis technique that uses traces of function entry and ...
Abstract: This paper introduces formal verification techniques applied by PolySpace Verifier as a st...
Object invariants describe the consistency of object-oriented data structures and are central to rea...
The specifications of a program can be dynamically inferred from its executions, or equivalently, fr...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
This paper describes three contributions I made to our system which collectively produce the executi...
Abstract—Verifiers that can prove programs correct against their full functional specification requi...