Modular Verification of Software Components in C

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 abstractverify-refine paradigm, our tool MAGIC first extracts a fiel from C source code using predicate abstraction and theorem proving. Subsequently, simulation is checked via a reduction to Boolean satisfiability. MAGIC is able to interface with several publicly available theorem provers and SAT solvers. We report experimental results with procedures from the Linux kernel and the OpenSSL toolkit.

• Type: Conference
• Year: 2003
• Where: ICSE
• Authors: Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh Jha, Helmut Veith
• Keywords: ICSE 2003, Software Engineering