Software Model Checking for People Who Love Automata

  • Matthias Heizmann
  • Jochen Hoenicke
  • Andreas Podelski
Conference paper

DOI: 10.1007/978-3-642-39799-8_2

Volume 8044 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Heizmann M., Hoenicke J., Podelski A. (2013) Software Model Checking for People Who Love Automata. In: Sharygina N., Veith H. (eds) Computer Aided Verification. CAV 2013. Lecture Notes in Computer Science, vol 8044. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Matthias Heizmann
    • 1
  • Jochen Hoenicke
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgGermany