Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Principles of Program Analysis
Principles of Program Analysis
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Validating firewalls using flow logics
Theoretical Computer Science
Flow logic for Dolev-Yao secrecy in cryptographic processes
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Shape analysis for mobile ambients
Nordic Journal of Computing
A calculus for control flow analysis of security protocols
International Journal of Information Security - Special issue on security in global computing
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Static validation of security protocols
Journal of Computer Security
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
A flow-sensitive analysis of privacy properties
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Program analysis and compilation, theory and practice
Nesting analysis of mobile ambients
Computer Languages, Systems and Structures
Topology-dependent abstractions of broadcast networks
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Modal Abstractions of Concurrent Behaviour
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Reachability for finite-state process algebras using static analysis
RP'11 Proceedings of the 5th international conference on Reachability problems
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The calculus of communicating systems, CCS, was introduced by Robin Milner as a calculus for modelling concurrent systems. Subsequently several techniques have been developed for analysing such models in order to get further insight into their dynamic behaviour. In this paper we present a static analysis for approximating the control structure embedded within the models. We formulate the analysis as an instance of a monotone framework and thus draw on techniques that often are associated with the efficient implementation of classical imperative programming languages. We show how to construct a finite automaton that faithfully captures the control structure of a CCS model. Each state in the automaton records a multiset of the enabled actions and appropriate transfer functions are developed for transforming one state into another. A classical worklist algorithm governs the overall construction of the automaton and its termination is ensured using techniques from abstract interpretation.