Data flow analysis for CCS

Authors:
Hanne Riis Nielson;Flemming Nielson
Affiliations:
Informatics and Mathematical Modelling, Technical University of Denmark, Kongens Lyngby, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, Kongens Lyngby, Denmark
Venue:
Program analysis and compilation, theory and practice
Year:
2007

Citing 12
Cited 4

Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
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
Protocols for Key Establishment and Authentication

Protocols for Key Establishment and Authentication
A calculus for control flow analysis of security protocols

International Journal of Information Security - Special issue on security in global computing
Static validation of security protocols

Journal of Computer Security
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Information flow analysis for VHDL

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies

A monotone framework for CCS

Computer Languages, Systems and Structures
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
Topology-dependent abstractions of broadcast networks

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementation of these languages. Robin Milner's Calculus of Communicating Systems, CCS, is concerned with modelling concurrent systems and has mainly been analysed using types and control flow analyses. In the present paper we present an instance of a Monotone Framework together with a novel worklist algorithm for more precisely approximating the flow-sensitive control structure of even infinitary processes expressed in CCS.