Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Relaxed Visibility Enhances Partial Order Reduction
Formal Methods in System Design
Combining Software and Hardware Verification Techniques
Formal Methods in System Design
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
State Space Reduction Based on Live Variables Analysis
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
SDLcheck: A Model Checking Tool
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Model classifications and automated verification
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Error-preserving local transformations on communication protocols
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
An optimization technique is presented that compresses a chain of transitions into a single jump transition, thus making a model smaller prior to model checking. We give compression algorithms, together with conditions that allow such compressions to preserve next-time-free LTL. Experimental results are presented and discussed.