10870 search results - page 59 / 2174 » Model Checking Programs |
PDPTA
2003
13 years 9 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
JUCS
2006
13 years 7 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
POPL
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...