@inproceedings{7cb0326b62454830bddeae02f00be7b3,

title = "Automated program verification",

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{\"u}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.",

author = "Azadeh Farzan and Matthias Heizmann and Jochen Hoenicke and Zachary Kincaid and Andreas Podelski",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 9th International Conference on Language and Automata Theory and Applications, LATA 2015 ; Conference date: 02-03-2015 Through 06-03-2015",

year = "2015",

doi = "10.1007/978-3-319-15579-1_2",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "25--46",

editor = "Adrian-Horia Dediu and Carlos Mart{\'i}n-Vide and Enrico Formenti and Bianca Truthe",

booktitle = "Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Proceedings",

address = "Germany",

}