A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
On-the-fly verification of finite transition systems
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Controlling state explosion in reachability analysis
Controlling state explosion in reachability analysis
Confluence for process verification
Theoretical Computer Science
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Weak confluence and &tgr;-inertness
Theoretical Computer Science
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation
Formal Methods in System Design
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems
Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
SVL: A Scripting Language for Compositional Verification
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Verifying Bisimulations "On the Fly"
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
Compositional State Space Generation from Lotos Programs
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
MEC: A System for Constructing and Analysing Transition Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Partial-Order Reduction in the Weak Modal Mu-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Compositional State Space Generation
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Partial $\tau$-confluence for efficient state space generation
Partial $\'tau$-confluence for efficient state space generation
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A generic on-the-fly solver for alternation-free boolean equation systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Refined interfaces for compositional verification
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
DISTRIBUTOR and BCG_MERGE: tools for distributed explicit state space generation
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Verification of orchestration systems using compositional partial order reduction
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Error-preserving local transformations on communication protocols
Software Testing, Verification & Reliability
Hi-index | 0.00 |
Explicit state methods have proven useful in verifying safety-critical systems containing concurrent processes that run asynchronously and communicate. Such methods consist of inspecting the states and transitions of a graph representation of the system. Their main limitation is state explosion, which happens when the graph is too large to be stored in the available computer memory. Several techniques can be used to palliate state explosion, such as on-the-fly verification, compositional verification, and partial order reductions. In this paper, we propose a new technique of partial order reductions based on compositional confluence detection (Ccd ), which can be combined with the techniques mentioned above. Ccd is based upon a generalization of the notion of confluence defined by Milner and exploits the fact that synchronizing transitions that are confluent in the individual processes yield a confluent transition in the system graph. It thus consists of analysing the transitions of the individual process graphs and the synchronization structure to identify such confluent transitions compositionally. Under some additional conditions, the confluent transitions can be given priority over the other transitions, thus enabling graph reductions. We propose two such additional conditions: one ensuring that the generated graph is equivalent to the original system graph modulo branching bisimulation, and one ensuring that the generated graph contains the same deadlock states as the original system graph. We also describe how Ccd -based reductions were implemented in the Cadp toolbox, and present examples and a case study in which adding Ccd improves reductions with respect to compositional verification and other partial order reductions.