The Marriage of Exploration and Deduction

  • Rupak Majumdar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7152)

Abstract

State space exploration based on abstraction and refinement has been the cornerstone of several successful software verification tools from the last decade. While these tools have made impressive progress in verifying control-dominant properties of code, most prominently in the domain of device drivers, their applications to more data-intensive properties have been limited. In particular, we focus on parameterized systems, which define infinite families of systems, one for each value of the parameter. Many real-life software systems, for example, memory management units or cache coherence protocols can be modeled as parameterized systems (parameterized, e.g., by the number of processes and memory locations), We want to perform uniform verification of parameterized systems, where we show a formula is an invariant of every member in the parameterized family.

Keywords

Parameterized System Model Checker Decision Procedure Parameterized Family Memory Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rupak Majumdar
    • 1
  1. 1.Max-Planck Institute for Software SystemsGermany

Personalised recommendations