Boolean and Cartesian Abstraction for Model Checking C Programs

  • Authors:
  • Thomas Ball;Andreas Podelski;Sriram K. Rajamani

  • Affiliations:
  • -;-;-

  • Venue:
  • TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
  • Year:
  • 2001

Quantified Score

Hi-index 0.03

Visualization

Abstract

We show how to attack the problem of model checking a C program with recursive procedures using an abstraction that we formally define as the composition of the Boolean and the Cartesian abstractions. It is implemented through a source-to-source transformation into a 'Boolean' C program; we give an algorithm to compute the transformation with a cost that is exponential in its theoretical worst-case complexity but feasible in practice.