Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Parallel program design: a foundation
Parallel program design: a foundation
Invariants for the construction of a handshake register
Information Processing Letters
Communication and Concurrency
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Refinement and Verification Applied to an In-Flight Data Acquisition Unit
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
State Space Reduction Based on Live Variables Analysis
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Verifying Erlang Code: A Resource Locker Case-Study
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Source-Level Transformations for Improved Formal Verification
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Computer assisted manipulation of algebraic process specifications
Computer assisted manipulation of algebraic process specifications
Static Analysis for State-Space Reductions Preserving Temporal Logics
Formal Methods in System Design
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
State space reduction for process algebra specifications
Theoretical Computer Science - Algebraic methodology and software technology
Symbolic Reachability for Process Algebras with Recursive Data Types
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Modelling, reduction and analysis of markov automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We present a new method for fighting the state space explosion of process algebraic specifications, by performing static analysis on an intermediate format: linear process equations (LPEs). Our method consists of two steps: (1) we reconstruct the LPE's control flow, detecting control flow parameters that were introduced by linearisation as well as those already encoded in the original specification; (2) we reset parameters found to be irrelevant based on data flow analysis techniques similar to traditional liveness analysis, modified to take into account the parallel nature of the specifications. Our transformation is correct with respect to strong bisimilarity, and never increases the state space. Case studies show that impressive reductions occur in practice, which could not be obtained automatically without reconstructing the control flow.