Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
DELFIN+: An efficient deadlock detection tool for CCS processes
Journal of Computer and System Sciences
A verification system for transient response of analog circuits
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Formal Verification of Concurrent Systems via Directed Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Multithreaded Programs by Means of Reduced Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
Clone detection through process algebras and Java bytecode
Proceedings of the 5th International Workshop on Software Clones
Abstraction-Guided model checking using symbolic IDA* and heuristic synthesis
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Many tools for the automatic analysis or verification of finite-state distributed systems are based on the construction of the global state graph of the system under consideration. Thus, they often fail because of the state explosion problem: The state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem in this paper, we present a model checking procedure, based on the combination of heuristic searches with ideas taken from local model checking. We use heuristic mechanisms for the exploration of the search space in order to avoid the construction of the complete state graph.