An improved protocol reachability analysis technique
Software—Practice & Experience
Design and validation of computer protocols
Design and validation of computer protocols
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An improvement in formal verification
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Projections of the Reachability Graph and Environment Models
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Efficiently verifying safety properties with idle office computers
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
| Hi-index | 0.00 |
Checking that a given finite state program satisfies a linear temporallogic property suffers from the state explosion problem. Often the resultinglack of available memory is more significant than any time limitations. One wayto cope with this is to reduce the state graph used for modelchecking. We present an algorithm for constructing a state graph thatis a projection of the program‘s state graph. The algorithm maintainsthe transitions and states that affect the truth of the property to bechecked. Especially in conjunction with known partial orderreduction algorithms, we show a substantial reduction in memory over usingpartial order methods alone, both in the precomputation stage, andin the result presented to a model checker. The price of the space reductionis a single additionaltraversal of the graph obtained with partial order reduction.As part of our space-saving methods, we present a new way to exploitHolzmann‘s Bit Hash Table, which assists us in solving the revisiting problem.