ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement

  • Andreas Podelski
  • Andrey Rybalchenko
Conference paper

DOI: 10.1007/978-3-540-69611-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4354)
Cite this paper as:
Podelski A., Rybalchenko A. (2006) ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. In: Hanus M. (eds) Practical Aspects of Declarative Languages. PADL 2007. Lecture Notes in Computer Science, vol 4354. Springer, Berlin, Heidelberg

Abstract

Software model checking with abstraction refinement is emerging as a practical approach to verify industrial software systems. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. It is therefore natural to investigate whether and how the use of a constraint-based programming language may lead to an elegant and concise implementation of a practical tool. In this paper we describe the outcome of our investigation. Using a Prolog system together with Constraint Logic Programming extensions as the implementation platform of our choice we have built such a tool, called ARMC (for Abstraction Refinement Model Checking), which has already been used for practical verification.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andreas Podelski
    • 1
    • 3
  • Andrey Rybalchenko
    • 2
    • 3
  1. 1.University of Freiburg 
  2. 2.Ecole Polytechnique Fédérale de Lausanne 
  3. 3.Max-Planck-Institut für Informatik Saarbrücken 

Personalised recommendations