212 search results - page 17 / 43 » Completeness and Complexity of Bounded Model Checking |
SCP
2010
13 years 5 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
ICALP
1994
Springer
13 years 11 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
ATAL
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...