Software Model Checking for People Who Love Automata

@inproceedings{Heizmann2013SoftwareMC,
  title={Software Model Checking for People Who Love Automata},
  author={Matthias Heizmann and Jochen Hoenicke and Andreas 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. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 62 CITATIONS, ESTIMATED 87% COVERAGE

Trace Abstraction Modulo Probability

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Automated verification of system requirements and software specifications

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Abstract Transducers

VIEW 1 EXCERPT
CITES BACKGROUND

Additive Number Theory via Automata Theory

  • Theory of Computing Systems
  • 2019
VIEW 1 EXCERPT
CITES METHODS

Joint forces for memory safety checking revisited

  • International Journal on Software Tools for Technology Transfer
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2014
2019

CITATION STATISTICS

  • 2 Highly Influenced Citations

  • Averaged 12 Citations per year from 2017 through 2019