76 search results - page 7 / 16 » Efficient reachability checking using sequential SAT |
ISSTA
1998
ACM
15 years 1 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...
102
Voted
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
ASP
2001
Springer
15 years 2 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
89
Voted
CAV
2012
Springer
13 years 1 days ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...