Graph generation to statically represent CSP processes

Authors:
Marisa Llorens;Javier Oliver;Josep Silva;Salvador Tamarit
Affiliations:
Universitat Politècnica de València, Camino de Vera S/N, Valencia, Spain;Universitat Politècnica de València, Camino de Vera S/N, Valencia, Spain;Universitat Politècnica de València, Camino de Vera S/N, Valencia, Spain;Universitat Politècnica de València, Camino de Vera S/N, Valencia, Spain
Venue:
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Year:
2010

Citing 9
Cited 0

Communicating sequential processes

Communicating sequential processes
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reliability analysis of CSP specifications using Petri nets and Markov processes

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
A semantics for tracing declarative multi-paradigm programs

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
ProB: an automated analysis toolset for the B method

International Journal on Software Tools for Technology Transfer (STTT)
SOC: a slicer for CSP specifications

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
The MEB and CEB Static Analysis for CSP Specifications

Logic-Based Program Synthesis and Transformation
Combining CSP and b for specification and property verification

FM'05 Proceedings of the 2005 international conference on Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

The CSP language allows the specification and verification of complex concurrent systems. Many analyses for CSP exist that have been successfully applied in different industrial projects. However, the cost of the analyses performed is usually very high, and sometimes prohibitive, due to the complexity imposed by the non-deterministic execution order of processes and to the restrictions imposed on this order by synchronizations. In this work, we define a data structure that allows us to statically simplify a specification before the analyses. This simplification can drastically reduce the time needed by many CSP analyses. We also introduce an algorithm able to automatically generate this data structure from a CSP specification. The algorithm has been proved correct and its implementation for the CSP's animator ProB is publicly available.