Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:11:07 PM
Last modification on : Friday, February 4, 2022 - 3:16:10 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:41:54 PM


  • HAL Id : inria-00070674, version 1



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



Record views


Files downloads