The Daikon dynamic invariant detector

The Daikon dynamic invariant detector - The Daikon dynamic...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
[ Home | FAQ | Download | Documentation | Publications | Mailing lists ] The Daikon invariant detector Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant detector reports likely program invariants. An invariant is a property that holds at a certain point or points in a program; these are often seen in assert statements, documentation, and formal specifications. Invariants can be 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 extend Daikon to add new properties. Dynamic invariant detection runs a program, observes the values that the program computes, and then reports properties that were true over the observed executions. Daikon can detect properties in C, C++, Eiffel, IOA,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online