Efficient incremental algorithms for dynamic detection of likely invariants

@inproceedings{Perkins2004EfficientIA,
  title={Efficient incremental algorithms for dynamic detection of likely invariants},
  author={Jeff H. Perkins and Michael D. Ernst},
  booktitle={SIGSOFT FSE},
  year={2004}
}
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of likely invariants over the program, also known as an operational abstraction. Operational abstractions are useful in testing, verification, bug detection, refactoring, comparing… CONTINUE READING

7 Figures & Tables

Topics

Statistics

01020'04'06'08'10'12'14'16'18
Citations per Year

118 Citations

Semantic Scholar estimates that this publication has 118 citations based on the available data.

See our FAQ for additional information.