Sciweavers

499 search results - page 22 / 100
» LTL satisfiability checking
Sort
View
CAV
2007
Springer
86views Hardware» more  CAV 2007»
14 years 4 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
FDL
2003
IEEE
14 years 3 months ago
Using Symbolic Simulation for Bounded Property Checking
Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. I...
Jürgen Ruf, Prakash Mohan Peranandam, Thomas ...
POPL
2011
ACM
13 years 20 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
CAV
2012
Springer
231views Hardware» more  CAV 2012»
12 years 8 days ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
ENTCS
2006
120views more  ENTCS 2006»
13 years 9 months ago
Temporal Assertions using AspectJ
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
Volker Stolz, Eric Bodden