Skip to Main content Skip to Navigation

Vérification des propriétés temporelles des programmes parallèles

Abstract : Formal verification is essential in order to ensure reliability of critical applications like communication protocols and distributed systems. The so-called model-checking verification technique consists in translating the application into a Labelled Transition System (LTS) on which the desired properties, expressed in temporal logic, are verified using specialized tools called model-checkers. However, the "classical" temporal logics, defined over an alphabet of atomic actions, are not well-adapted for description languages as LOTOS, whose actions contain typed values. This thesis defines a formalism called XTL (eXecutable Temporal Language), which allows to express temporal properties involving the data handled by the program to be verified. XTL is based upon an extension of the modal mu-calculus with typed variables. The values contained in the LTS, extracted using extended modal operators, can be passed as arguments to the fixed point operators or can be combined by means of functional-like constructs as "let", "if-then-else", "case", etc. The properties over action sequences of the program can be described succinctly using regular expressions. Special meta-operators allow to evaluate formulas on an LTS as well as to express non-standard temporal properties by exploring the transition relation. The semantics of XTL is formally defined, and efficient algorithms are proposed for the evaluation of temporal XTL formulas over LTS models. A model-checker for XTL is developed and successfully used for the validation of industrial applications such as the BRP protocol designed by Philips and the link layer of the IEEE-1394 serial bus ("FireWire").
Document type :
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Thursday, February 19, 2004 - 3:15:55 PM
Last modification on : Thursday, February 11, 2021 - 2:56:02 PM
Long-term archiving on: : Wednesday, September 12, 2012 - 1:40:12 PM


  • HAL Id : tel-00004896, version 1



Radu Mateescu. Vérification des propriétés temporelles des programmes parallèles. Autre [cs.OH]. Institut National Polytechnique de Grenoble - INPG, 1998. Français. ⟨tel-00004896⟩



Record views


Files downloads