Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Algebraic theory of processes
Entity-life modeling and structured analysis in real-time software design—a comparison
Communications of the ACM
Verifying properties of large sets of processes with network invariants
Proceedings of the international workshop on Automatic verification methods for finite state systems
A structural induction theorem for processes
Information and Computation
Verifying parameterized networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Communicating sequential processes
Communications of the ACM
Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Towards scalable compositional analysis by refactoring design models
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
On-the-Fly branching bisimulation minimization for compositional analysis
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Computing refactorings of behavior models
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
| Hi-index | 0.00 |
Systems composed of many identical processes can sometimes be verified inductively using a network invariant, but systems whose component processes vary in some systematic way are not amenable to direct application of that method. We describe how variations in behavior can be "factored out" into additional processes, thus enabling induction over the number of processes. The process is semi-automatic: The designer must choose from among a set of idiomatic transformations, but each transformation is applied and checked automatically.