XTL: A Meta-Language and Tool for Temporal Logic Model-Checking

We present a temporal logic model-checking environment based on a new language called Xtl (eXecutable Temporal Language). Xtl is a functional programming language designed to allow a compact description of various temporal logic operators , which are evaluated over a Labelled Transition System (Lts). Xtl ooers primitives to access the data values (possibly) contained in the states and labels of the Lts, as well as to explore the transition relation. The temporal logic operators are implemented by means of iteration expressions computing sets of states and sets of transitions. Various useful modal and temporal logics like Hml, Ctl, Ltac and Actl, have been implemented in Xtl, and several industrial case-studies, such as the Brp protocol designed by Philips, the Ieee-1394 serial bus standardized by Ieee, and the Cfs protocol developed by Bull and Inria, have been successfully validated using the Xtl model-checker.

[1]  Mihaela Sighireanu,et al.  Verification of the Link layer protocol of the IEEE-1394 serial bus (FireWire): an experiment with E-LOTOS , 1998, International Journal on Software Tools for Technology Transfer.

[2]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[3]  Radu Mateescu,et al.  Formal Description and Analysis of a Bounded Retransmission Protocol , 1996 .

[4]  Paul Crubillé,et al.  Construction and Analysis of Transition Systems with MEC , 1995, AMAST Series in Computing.

[5]  Stefania Gnesi,et al.  The Integration Project for the JACK Environement , 1994 .

[6]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[7]  Paul Crubillé,et al.  A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems , 1988, Inf. Process. Lett..

[8]  Hubert Garavel,et al.  OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing , 1998, TACAS.

[9]  Julian Rathke,et al.  Local Model Checking for a Value-Based Modal µ-Calculus , 1996 .

[10]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[11]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

[12]  Anne Dicky,et al.  An algebraic and algorithmic method for analysing transition systems , 1986, Theor. Comput. Sci..

[13]  Rance Cleaveland,et al.  The Concurrency Factory: A Development Environment for Concurrent Systems , 1996, CAV.

[14]  S. P. Luttik.  Description and formal specification of the Link Layer of P1394 , 1997, FME 1997.

[15]  Jan Friso Groote,et al.  A Bounded Retransmission Protocol for Large Data Packets , 1993, AMAST.

[16]  Rocco De Nicola,et al.  Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.

[17]  Charles Pecheur,et al.  Advanced modelling and verification techniques applied to a cluster file system , 1999, 14th IEEE International Conference on Automated Software Engineering.

[18]  Jacques Mossière,et al.  The Arias Distributed Shared Memory: An Overview , 1996, SOFSEM.

[19]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .