Distributed and Predictable Software Model Checking

  • Nuno P. Lopes
  • Andrey Rybalchenko
Conference paper

DOI: 10.1007/978-3-642-18275-4_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6538)
Cite this paper as:
Lopes N.P., Rybalchenko A. (2011) Distributed and Predictable Software Model Checking. In: Jhala R., Schmidt D. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2011. Lecture Notes in Computer Science, vol 6538. Springer, Berlin, Heidelberg

Abstract

We present a predicate abstraction and refinement-based algorithm for software verification that is designed for the distributed execution on compute nodes that communicate via message passing, as found in today’s compute clusters. A successful adaptation of predicate abstraction and refinement from sequential to distributed setting needs to address challenges imposed by the inherent non-determinism present in distributed computing environments. In fact, our experiments show that up to an order of magnitude variation of the running time is common when a naive distribution scheme is applied, often resulting in significantly worse running time than the non-distributed version. We present an algorithm that overcomes this pitfall by making deterministic the counterexample selection in spite of the distribution, and still efficiently exploits distributed computational resources. We demonstrate that our distributed software verification algorithm is practical by an experimental evaluation on a set of difficult benchmark problems from the transportation domain.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Nuno P. Lopes
    • 1
  • Andrey Rybalchenko
    • 2
  1. 1.INESC-ID / ISTTU LisbonUnited Kingdom
  2. 2.Technische Universität MünchenGermany

Personalised recommendations