Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
Model checking
SMC: a symmetry-based model checker for verification of safety and liveness properties
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model checking systems of replicated processes with spin
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Featherweight Java: a minimal core calculus for Java and GJ
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Exploiting Symmetry when Model-Checking Software
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
SableCC, an Object-Oriented Compiler Framework
TOOLS '98 Proceedings of the Technology of Object-Oriented Languages and Systems
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Extending Symmetry Reduction Techniques to a Realistic Model of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic symmetry detection for model checking using computational group theory
FM'05 Proceedings of the 2005 international conference on Formal Methods
ETCH: an enhanced type checking tool for promela
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Exact and approximate strategies for symmetry reduction in model checking
FM'06 Proceedings of the 14th international conference on Formal Methods
A computational group theoretic symmetry reduction package for the SPIN model checker
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Counterexample-guided abstraction refinement for symmetric concurrent programs
Formal Methods in System Design
Hi-index | 0.00 |
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we can detect symmetry in specifications defined in Promela-lite by constructing a directed, coloured bipartite digraph called a static channel diagram, and applying computational group theoretic techniques. We extend our approach to Promela and introduce a tool, SymmExtractor, for automatically detecting symmetries of Promela specifications. We demonstrate the effectiveness of our approach via experimental results for a suite of Promela specifications. Unlike previous approaches our technique is fully automatic, and not restricted to fully symmetric systems.