Skip to main content
Conference ProceedingsOPEN ACCESS

Software model checking for people who love automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8044 LNCS 36-52
DOI: 10.1007/978-3-642-39799-8_2
123Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Heizmann, M., Hoenicke, J., & Podelski, A. (2013). Software model checking for people who love automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8044 LNCS, pp. 36–52). https://doi.org/10.1007/978-3-642-39799-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free