An algorithm to generate the context-sensitive synchronized control flow graph

Authors:
M. Llorens;J. Oliver;J. Silva;S. Tamarit
Affiliations:
Universidad Politécnica de Valencia, Valencia, Spain;Universidad Politécnica de Valencia, Valencia, Spain;Universidad Politécnica de Valencia, Valencia, Spain;Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 7
Cited 2

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
Context-sensitive slicing of concurrent programs

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
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

A tracking semantics for CSP

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Generating a Petri net from a CSP specification: A semantics-based method

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses 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. To overcome this problem, there has been a recent proposal that allows to statically simplify a specification before the analyses. This simplification allows to drastically reduce the time needed by the analyses because it reduces the state explosion. Unfortunately, the approach has been implemented but it has not been formalized neither proved correct. In this paper, we formally define the data structures needed to automatically simplify a CSP specification and we define an algorithm able to automatically generate these data structures.