Software Model Checking for People Who Love Automata
@inproceedings{Heizmann2013SoftwareMC, title={Software Model Checking for People Who Love Automata}, author={M. Heizmann and Jochen Hoenicke and A. Podelski}, booktitle={CAV}, year={2013} }
In this expository paper, we use automata for software model checking in a new way. The starting point is to fix the alphabet: the set of statements of the given program. We show how automata over the alphabet of statements can help to decompose the main problem in software model checking, which is to find the right abstraction of a program for a given correctness property.
97 Citations
Calculational Design of a Regular Model Checker by Abstract Interpretation
- Computer Science
- ICTAC
- 2019
- PDF
Ultimate Automizer with an On-Demand Construction of Floyd-Hoare Automata - (Competition Contribution)
- Computer Science
- TACAS
- 2017
- 15
WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL
- Computer Science
- Models, Algorithms, Logics and Tools
- 2017
- 2
References
SHOWING 1-10 OF 26 REFERENCES
Relative Completeness of Abstraction Refinement for Software Model Checking
- Computer Science
- TACAS
- 2002
- 116
- PDF
Counterexample-guided abstraction refinement
- Computer Science
- 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.
- 2003
- 1,272
- PDF