Constraint-based deductive model checking |
| |
Authors: | Giorgio Delzanno Andreas Podelski |
| |
Affiliation: | (1) Max-Planck-Institut für Informatik, Am Stadtwald, 66123 Saarbrücken, Germany; E-mail: {delzanno,podelski}@mpi-sb.mpg.de, DE |
| |
Abstract: | We show that constraint logic programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinite-state systems. CLP programs are logical formulas (built up from constraints) that have both a logical interpretation and an operational semantics. Our contributions are: (1) a translation of concurrent systems (imperative programs) into CLP programs with the same operational semantics; and (2) a deductive method for verifying safety and liveness properties of the systems which is based on the logical interpretation of the CLP programs produced by the translation. We have implemented the method in a CLP system and verified well-known examples of infinite-state programs over integers, using linear constraints here as opposed to Presburger arithmetic as in previous solutions. Published online: 18 July 2001 |
| |
Keywords: | : Constraints – Logic programming – Verification – Model checking |
本文献已被 SpringerLink 等数据库收录! |