Factorising temporal specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Factorising temporal specifications

Abstract

This paper proposes a method to factorise the verification of temporal properties for multi-threaded programs over groups of different threads. Essentially, the method boils down to showing that there exists a group of threads that establishes the property of interest, while the remaining threads do not affect it. We fine-tune the method by identifying for each property particular conditions under which the preservation is necessary. As specification language we use the so-called specification patterns, developed at SAnToS. For each specification pattern we propose a decomposition rule. We have shown the soundness of each rule using the pattern mappings as defined for LTL. The proofs have been formalised using the theorem prover Isabelle.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5326.pdf (208.87 Ko) Télécharger le fichier

Dates and versions

inria-00070674 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070674 , version 1

Cite

Marieke Huisman, Kerry Trentelman. Factorising temporal specifications. RR-5326, INRIA. 2004, pp.28. ⟨inria-00070674⟩
63 View
17084 Download

Share

Gmail Facebook Twitter LinkedIn More