Sciweavers

51 search results - page 4 / 11
» Simple Bounded LTL Model Checking
Sort
View
LFCS
2007
Springer
14 years 1 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
CAV
2007
Springer
86views Hardware» more  CAV 2007»
14 years 1 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
CONCUR
2011
Springer
12 years 7 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
FMCAD
2007
Springer
14 years 1 months ago
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...
Jocelyn Simmonds, Jessica Davies, Arie Gurfinkel, ...
QEST
2005
IEEE
14 years 1 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha