Infinite State Model Checking by Abstract Interpretation and Program Specialisation
Leuschel, M. and Massart, T. (1999) Infinite State Model Checking by Abstract Interpretation and Program Specialisation. Logic-Based Program Synthesis and Transformation. Proceedings of LOPSTR'99, LNCS 1817 Springer-Verlag, Berlin, 63-82.
Download
Full text not available from this repository.
Description/Abstract
We illustrate the use of logic programming techniques for finite model checking of CTL formulae. We present a technique for infinite state model checking of safety properties based upon logic program specialisation and analysis techniques. The power of the approach is illustrated on several examples. For that, the efficient tools logen and ecce are used. We discuss how this approach has to be extended to handle more complicated infinite state systems and to handle arbitrary CTL formulae.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Venice, Italy |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 252665 |
| Date Deposited: | 27 Jun 2000 |
| Last Modified: | 02 Mar 2012 14:01 |
| Contributors: | Leuschel, M. (Author) Massart, T. (Author) Bossi, A. (Editor) |
| Date: | September 1999 |
| Additional Information: | Address: Venice, Italy |
| Status: | Published |
| Publisher: | Springer-Verlag, Berlin |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/252665 |
Actions (login required)
 |
View Item |
