[ Home| FAQ| Download| Documentation| Publications| Mailing lists]The Daikon invariant detectorDaikonis an implementation of dynamic detection of likely invariants; that is, the Daikon invariant detectorreports likely program invariants. An invariant is a property that holds at a certain point or points in aprogram; these are often seen in assert statements, documentation, and formal specifications. Invariants canbe useful in program understanding and a host of other applications. Examples include “.field > abs(y)”; “y =2*x+3”; “array a is sorted”; “for all list objects lst, lst.next.prev = lst”; “for all treenode objects n, n.left.value< n.right.value”; “p != null ⇒p.content in myArray”; and many more. You can extendDaikon to add newproperties.Dynamic invariant detection runs a program, observes the values that the program computes, and then reportsproperties that were true over the observed executions. Daikon can detect properties in C, C++, Eiffel, IOA,
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 02/24/2012 for the course CSE 503 taught by Professor Davidnotikin during the Spring '11 term at University of Washington.