212 search results - page 5 / 43 » Completeness and Complexity of Bounded Model Checking |
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional proce...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
ICSE
2010
IEEE-ACM
13 years 9 months ago
2010
IEEE-ACM
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...