Efficient incremental algorithms for dynamic detection of likely invariants

Abstract

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 behavior, and many other tasks.

BibTeX

@inproceedings{Perkins-Ernst:FSE04,
  author    = {Jeff H. Perkins and
               Michael D. Ernst},
  title     = {Efficient incremental algorithms for dynamic detection of likely invariants},
  booktitle = {FSE},
  pages     = {23--32},
  publisher = {{ACM}},
  year      = {2004},
}

Efficient incremental algorithms for dynamic detection of likely invariants

Abstract

Related papers