Sciweavers

493 search results - page 5 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
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
ICALP
2000
Springer
13 years 11 months ago
A New Unfolding Approach to LTL Model Checking
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
Javier Esparza, Keijo Heljanko
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, ...
28
Voted
ASP
2001
Springer
14 years 3 days ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä