Sciweavers

96 search results - page 9 / 20
» Three-valued logic in bounded model checking
Sort
View
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
ESOP
2003
Springer
14 years 20 days ago
Automatic Software Model Checking Using CLP
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
Cormac Flanagan
FORMATS
2008
Springer
13 years 9 months ago
Some Recent Results in Metric Temporal Logic
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
Joël Ouaknine, James Worrell
ATAL
2010
Springer
13 years 8 months ago
Distributed BDD-based BMC for the verification of multi-agent systems
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
Andrew V. Jones, Alessio Lomuscio
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...