Detecting inconsistencies via universal reachability analysis

@inproceedings{Tomb2012DetectingIV,
  title={Detecting inconsistencies via universal reachability analysis},
  author={Aaron Tomb and Cormac Flanagan},
  booktitle={ISSTA},
  year={2012}
}
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumptions. Existing approaches to inconsistency detection have used intentionally unsound techniques aimed at bug-finding rather than verification. We describe an inconsistency detection analysis that extends previous work and is based on the foundation of the weakest precondition calculus. On a closed program, this analysis… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Finding Inconsistencies in Programs with Loops

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Severity Levels of Inconsistent Code

VIEW 4 EXCERPTS
HIGHLY INFLUENCED

Reconstructing Paths for Reachable Code

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Bixie: Finding and Understanding Inconsistent Code

  • 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Logic for Programming, Artificial Intelligence, and Reasoning

  • Lecture Notes in Computer Science
  • 2015
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.