Model Checking in CLP

  • Authors:
  • Giorgio Delzanno;Andreas Podelski

  • Affiliations:
  • -;-

  • Venue:
  • TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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. Our contributions are: (1) a semantics-preserving translation of concurrent systems into CLP programs, (2) a method for verifying safety and liveness properties on the CLP programs produced by the translation. We have implemented the method in a CLP system and verified well-known examples of infinitestate programs over integers, using here linear constraints as opposed to Presburger arithmetic as in previous solutions.