From explicit to symbolic types for communication protocols in CCS

Authors:
Hanne Riis Nielson;Flemming Nielson;Jörg Kreiker;Henrik Pilegaard
Affiliations:
DTU Informatics, Technical University of Denmark, Denmark;DTU Informatics, Technical University of Denmark, Denmark;Institut für Informatik, Technische Universität München, Germany;Institut für Informatik, Technische Universität München, Germany
Venue:
Formal modeling
Year:
2011

Citing 16
Cited 0

The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
A language with distributed scope

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Dependency Analysis of Mobile Systems

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Type and Effect Systems

Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Polymorphic Type Inference with Overloading and Subtyping

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Automatic Determination of Communication Topologies in Mobile Systems

SAS '98 Proceedings of the 5th International Symposium on Static Analysis
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Flow logic: a multi-paradigmatic approach to static analysis

The essence of computation
A foundation for actor computation

Journal of Functional Programming
Static validation of security protocols

Journal of Computer Security
Relational Analysis of Correlation

SAS '08 Proceedings of the 15th international symposium on Static Analysis
From Flow Logic to static type systems for coordination languages

Science of Computer Programming
A calculus for orchestration of web services

ESOP'07 Proceedings of the 16th European conference on Programming
Relational analysis for delivery of services

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Flow Logic for Process Calculi

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study communication protocols having several rounds and expressed in value passing CCS. We develop a type-based analysis for providing an explicit record of all communications and show the usual subject reduction result. Since the explicit records can be infinitely large, we also develop a type-based analysis for providing a finite, symbolic record of all communications. We show that it correctly approximates the explicit record and prove an adequacy result for it.