Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking of Control-User Component-Based Parametrised Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Journal of Supercomputing
| Hi-index | 0.00 |
Parameterized systems are systems that involve numerous instantiations of the same finite-state module. Examples of parameterized systems include tele-communication protocols, bus protocols, cache coherence protocols, and many other protocols that underly current state-of-the-art systems. Formal verification of parameterized systems is known to be undecidable [AK86] and thus cannot be automated. Recent research has shown that in many cases it is possible to use abstraction methods to generate a finite-state systems from a parameterized systems. The finite-state system can then be model-checked. If successful, it is possible to conclude that the original parameterized system satisfies its requirements. Otherwise, it is often the case that the counterexample produced by the model checker can indicate an error in the original parameterized system. This combined technique allows for automatic verification of parameterized systems.This presentation describes our recent approaches that combine abstraction and model-checking to verify safety as well we liveness properties of parameterized systems. We start with the method of invisible invariants [APR+01] that combines a small-model theorem with an heuristics to generate proofs of correctness of parameterized systems. We also describe the method of network invariants [ZPK02, KPSZ02] which allows to explicitly describe a finite-system that, in a precise sense, has the same external behavior as an infinite-state one, and can be used for model-checking properties.