Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Design and validation of computer protocols
Design and validation of computer protocols
On-the-fly verification of finite transition systems
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Automatically closing open reactive programs
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Advanced compiler design and implementation
Advanced compiler design and implementation
Verification and test generation for the SSCOP protocol
Science of Computer Programming
Verification experiments on the MASCARA protocol
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Model Checking
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Reducing the number of clock variables of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
State space reduction for process algebra specifications
Theoretical Computer Science - Algebraic methodology and software technology
Efficient Reduction Techniques for Systems with Many Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic abstraction for verification of cyber-physical systems
Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
Systematic correct construction of self-stabilizing systems: a case study
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
The intrinsic complexity of most protocol specifications in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model-checking techniques as a way to enhance the performances of automated validation tools. In this context, we found that a non-trivial equivalence over the model states can be derived from the information on live variables. This equivalence exploits the unused dead values stored both in process variables and in communication queues and allows to reduce the model with a rather Important factor. Furthermore, this reduction comes almost for free and is always possible to directly generate the quotient model without generating the initial one.