A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Controlling state explosion in reachability analysis
Controlling state explosion in reachability analysis
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Context constraints for compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems
Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
Compilation and verification of LOTOS specifications
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
A Graphical Parallel Composition Operator for Process Algebras
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
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
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
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
MEC: A System for Constructing and Analysing Transition Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop 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
Model checking the HAVi leader election protocol
Model checking the HAVi leader election protocol
An incremental approach to reachability analysis of distributed programs
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Automated interface refinement for compositional verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
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
| Hi-index | 0.00 |
The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space.Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes.This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.