# Daikon

The Daikon system for dynamic detection of likely invariants. 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 used in assert statements, documentation, and formal specifications. Examples include being constant $(x=a)$, non-zero $(x eq 0)$, being in a range $(a leq x leq b)$, linear relationships $(y=ax+b)$, ordering $(x leq y)$, functions from a library ($x=fn(y))$, containment $(x in y)$, sortedness ($x$ is sorted), and many more. Users can extend Daikon to check for additional invariants. Dynamic invariant detection runs a program, observes the values that the program computes, and then reports properties that were true over the observed executions. Dynamic invariant detection is a machine learning technique that can be applied to arbitrary data. Daikon can detect invariants in C, C++, Java, and Perl programs, and in record-structured data sources; it is easy to extend Daikon to other applications. Invariants can be useful in program understanding and a host of other applications. Daikon’s output has been used for generating test cases, predicting incompatibilities in component integration, automating theorem proving, repairing inconsistent data structures, and checking the validity of data streams, among other tasks.

## Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

## References in zbMATH (referenced in 43 articles , 1 standard article )

Showing results 1 to 20 of 43.
Sorted by year (citations)