319 search results - page 1 / 64 » Space-Efficient Bounded Model Checking |
DATE
2005
IEEE
13 years 11 months ago
2005
IEEE
CADE
2012
Springer
11 years 7 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
ISSTA
1998
ACM
13 years 9 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...