Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Reasoning about systems with many processes
Journal of the ACM (JACM)
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
A practical method for verifying event-driven software
Proceedings of the 21st international conference on Software engineering
Verifying Systems with Replicated Components in Mur&b.phiv;
Formal Methods in System Design
Feature Interactions in Telecommunications and Software Systems V
Feature Interactions in Telecommunications and Software Systems V
Feature Interactions in Telecommunications and Software Systems VI
Feature Interactions in Telecommunications and Software Systems VI
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)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Veryfying Parameterized Networks using Abstraction and Regular Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Induction in Compositional Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Inductively Verifying Invariant Properties of Parameterized Systems
Automated Software Engineering
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
An automatic abstraction technique for verifying featured, parameterised systems
Theoretical Computer Science
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)
Automatic symmetry detection for model checking using computational group theory
FM'05 Proceedings of the 2005 international conference on Formal Methods
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards Verifying Correctness of Wireless Sensor Network Applications Using Insense and Spin
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Formal modeling of robot behavior with learning
Neural Computation
Hi-index | 0.00 |
We investigate the relationship between symmetry reduction and inductive reasoning when applied to model checking networks of featured components. Popular reduction techniques for combatting state space explosion in model checking, like abstraction and symmetry reduction, can only be applied effectively when the natural symmetry of a system is not destroyed during specification. We introduce a property which ensures this is preserved, open symmetry. We describe a template-based approach for the construction of open symmetric Promela specifications of featured systems. For certain systems (safely featured parameterised systems) our generated specifications are suitable for conversion to abstract specifications representing any size of network. This enables feature interaction analysis to be carried out, via model checking and induction, for systems of any number of featured components. In addition, we show how, for any balanced network of components, by using a graphical representation of the features and the process communication structure, a group of permutations of the underlying state space of the generated specification can be determined easily. Due to the open symmetry of our Promela specifications, this group of permutations can be used directly for symmetry reduced model checking. The main contributions of this paper are an automatic method for developing open symmetric specifications which can be used for generic feature interaction analysis, and the novel application of symmetry detection and reduction in the context of model checking featured networks. We apply our techniques to a well known example of a featured network - an email system.