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
Reasoning about networks with many identical finite state processes
Information and Computation
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)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying Systems with Replicated Components in Mur&b.phiv;
Formal Methods in System Design
Model checking
Automatic verification of parameterized networks of processes
Theoretical Computer Science
Using SPIN for feature interaction analysis—a case study
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Model Checking
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Network Grammars, Communication Behaviors and Automatic Verification
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes
CONCUR '94 Proceedings of the Concurrency Theory
Veryfying Parameterized Networks using Abstraction and Regular Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Verification of Parameterized Bus Arbitration Protocol
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
An Iterative Approach to Language Containment
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Murphi Verification System
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)
CAV '96 Proceedings of the 8th 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
Automatic Verification of any Number of Concurrent, Communicating Processes
Proceedings of the 17th IEEE international conference on Automated software engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Inductively Verifying Invariant Properties of Parameterized Systems
Automated Software Engineering
Automatic symmetry detection for model checking using computational group theory
FM'05 Proceedings of the 2005 international conference on Formal Methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Counterexample Guided Spotlight Abstraction Refinement
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Model Checking of Control-User Component-Based Parametrised Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Temporal Verification of Fault-Tolerant Protocols
Methods, Models and Tools for Fault Tolerance
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
A general technique combining model checking and abstraction is presented that allows property based analysis of systems consisting of an arbitrary number of featured components. We show how parameterised systems can be specified in a guarded command form with constraints placed on variables which occur in guards. We prove that results that hold for a small number of components can be shown to scale up. We then show how featured systems can be specified in a similar way, by relaxing constraints on guards. The main result is a generalisation theorem for featured systems which we apply to two well known examples.