MPI-I-98-2-012. July 1998, 44 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
The verification of safety and liveness properties
for infinite-state systems is an important research problem. Can
the well-established concepts and the existing technology for
programming over constraints as first-class data structures
contribute to this research? The work reported in this paper is a
starting point for the experimental evaluation of constraint logic
programming as a conceptual basis and practical implementation
platform for model checking. We have implemented an automated
verification method in CLP using real and boolean constraints.
We have used the method on a number of infinite-state systems
that model concurrent programs using integers or buffers.
The basis of the correctness of our
implementation is a formal connection between CLP programs and the
formalism used for specifying concurrent systems.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|