Loading...
Please wait, while we are loading the content...
Similar Documents
Modular verification of software components in C (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Chaki, Sagar Clarke, Edmund Groce, Alex |
| Description | 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 finite model 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. |
| File Format | |
| Journal | IEEE Transactions on Software Engineering |
| Language | English |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Source Code Software Component Predicate Abstraction Boolean Satisfiability Openssl Toolkit Large Software System Automatic Verification Tool Magic Theorem Proving Weak Simulation Finite State Machine Specification Finite Model Sat Solver Experimental Result Available Theorem Provers Manageable Complexity New Methodology Abstractverify-refine Paradigm Software Design Linux Kernel Modular Verification |
| Content Type | Text |
| Resource Type | Article |
