Modular Verification of Software Components in C

  • Authors:
  • S. Chaki;E. M. Clarke;A. Groce;S. Jha;H. Veith

  • Affiliations:
  • Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA;-;-;-;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompose the verification of large software systems into subproblems of manageable complexity. The decomposition reflects the modularity in the software design. We use weak simulation as the notion of conformance between the program and its specification. Following the CounterExample Guided Abstraction Refinement (CEGAR) paradigm, our tool magic first extracts a finite model from C source code using predicate abstraction and theorem proving. Subsequently, weak simulation is checked via a reduction to Boolean satisfiability. magic has been interfaced with several publicly available theorem provers and SAT solvers. We report experimental results with procedures from the Linux kernel, the OpenSSL toolkit, and several industrial strength benchmarks.