Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On-the-fly state space reductions for weak equivalences
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
A Database Approach to Distributed State Space Generation
Electronic Notes in Theoretical Computer Science (ENTCS)
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Distributed analysis with µCRL: a compendium of case studies
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Towards informed swarm verification
NFM'11 Proceedings of the Third international conference on NASA Formal methods
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
Large-scale Distributed Verification Using CADP: Beyond Clusters to Grids
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The explicit-state verification of complex concurrent systems, whose underlying state spaces may be prohibitively large, requires an important amount of memory and computation time. Although explicit state space generation is known to be exponential as the number of concurrent processes in the system increases, it is tempting to push forward the capabilities of verification tools by exploiting the computing resources (memory and processors) of massively parallel machines, such as clusters and grids.