Abstract
A new approach to program verification is based on automata. The notion of automaton depends on the verification problem at hand (nested word automata for recursion, Büchi automata for termination, a form of data automata for parametrized programs, etc.). The approach is to first construct an automaton for the candidate proof and then check its validity via automata inclusion. The originality of the approach lies in the construction of an automaton from a correctness proof of a given sequence of statements. A sequence of statements is at the same time a word over a finite alphabet and it is (a very simple case of) a program. Just as we ask whether a word has an accepting run, we can ask whether a sequence of statements has a correctness proof (of a certain form). The automaton accepts exactly the sequences that do.
Cite
CITATION STYLE
Farzan, A., Heizmann, M., Hoenicke, J., Kincaid, Z., & Podelski, A. (2015). Automated program verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 25–46). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
