Sciweavers

115 search results - page 3 / 23
» A Compact Linear Translation for Bounded Model Checking
Sort
View
TPHOL
2005
IEEE
13 years 12 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
ENTCS
2006
99views more  ENTCS 2006»
13 years 6 months ago
Termination Criteria for Bounded Model Checking: Extensions and Comparison
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
Mohammad Awedh, Fabio Somenzi
CONCUR
2001
Springer
13 years 10 months ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 25 days ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SPIN
2010
Springer
13 years 4 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric