Sciweavers

713 search results - page 10 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
DLOG
2006
13 years 10 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
LOGCOM
2002
100views more  LOGCOM 2002»
13 years 8 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
ASE
2004
117views more  ASE 2004»
13 years 8 months ago
Model Checking for Combined Logics with an Application to Mobile Systems
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...
CONCUR
2009
Springer
14 years 3 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
CAV
2012
Springer
222views Hardware» more  CAV 2012»
11 years 11 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...