Design and validation of computer protocols
Design and validation of computer protocols
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
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
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Compressing Transitions for Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Exploring the Scope for Partial Order Reduction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Transparent partial order reduction
Formal Methods in System Design
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Abstract matching for software model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Strength-Based decomposition of the property Büchi automaton for faster model checking
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the order of execution of concurrent (independent) atomic actions is in many cases unimportant for the checked property, it allows reducing the state space by exploring fewer execution sequences. However, in order to guarantee that the reduced state space preserves the correctness of the checked property, the partial order reductions put constraints about commuting the order of atomic actions that may change the value of propositions appearing in the checked specification. In this paper we relax this constraint, allowing a weaker requirement to be imposed, and thus achieving a better reduction. We demonstrate the benefits of our improved reduction with experimental results.