175 search results - page 19 / 35 » Symbolic Model Checking for Asynchronous Boolean Programs |
119
Voted
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
118
click to vote
IJFCS
2006
15 years 2 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
113
click to vote
FSTTCS
2005
Springer
15 years 7 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
141
Voted
FORMATS
2004
Springer
15 years 7 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
117
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...