Fairness
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Parallel program design: a foundation
Parallel program design: a foundation
High-level Petri nets: theory and application
High-level Petri nets: theory and application
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic model checking for real-time systems
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 2)
Handbook of combinatorics (vol. 2)
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On-the-Fly Model Checking Under Fairness That Exploits Symmetry
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient On-the-Fly Model Checking for CTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Symmetric Symbolic Safety-Analysis of Concurrent Software with Pointer Data Structures
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Symmetry and Reduced Symmetry in Model Checking
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
IEEE Transactions on Software Engineering
Symmetry and reduced symmetry in model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Combining symmetry reduction and under-approximation for symbolic model checking
Formal Methods in System Design
Checking extended CTL properties using guarded quotient structures
Formal Methods in System Design
25 Years of Model Checking
Automatic Symmetry Detection for Promela
Journal of Automated Reasoning
ACM Computing Surveys (CSUR)
Model checking: algorithmic verification and debugging
Communications of the ACM - Scratch Programming for All
Electronic Notes in Theoretical Computer Science (ENTCS)
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Spin-to-Grape: A Tool for Analysing Symmetry in Promela Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Automatic formal model generation and analysis of SDL
SDL'03 Proceedings of the 11th international conference on System design
Rebeca: theory, applications, and tools
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Efficient approximate verification of Promela models via symmetry markers
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Sviss: symbolic verification of symmetric systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On the constructive orbit problem
Annals of Mathematics and Artificial Intelligence
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
Model checking of systems employing commutative functions
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Exact and approximate strategies for symmetry reduction in model checking
FM'06 Proceedings of the 14th international conference on Formal Methods
Efficient symmetry reduction for an actor-based model
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Employing symmetry reductions in model checking
Computer Languages, Systems and Structures
Hi-index | 0.00 |
The article presents the SMC system. SMC can be used for checking safety and liveness properties of concurrent programs under different fairness assumptions. It is based on explicit state enumeration. It combats the state explosion by exploiting symmetries of the input concurrent program, usually present in the form of identical processes, in two different ways. Firstly, it reduces the number of explored states by identifying those states that are equivalent under the symmetries of the system; this is called process symmetry. Secondly, it reduces the number of edges explored from each state, in0 the reduced state graph, by exploiting the symmetry of a single state; this is called state symmetry. SMC works in an on-the-fly manner; it constructs the reduced state graph as and when it is needed. This method facilitates early termination, speeds up model checking, and reduces memory requirements. We employed SMC to check the correctness of, among other standard examples, the Link Layer part of the IEEE Standard 1394 “Firewire” high-speed serial bus protocol. SMC found deadlocks in the protocol. SMC was also to check certain liveness properties. A report on the case study is included in the article.