A Denotational Semantics for the π-Calculus

Authors:
B. Aziz;G. W. Hamilton
Affiliations:
School of Computer Applications, Dublin City University, Dublin, Ireland;School of Computer Applications, Dublin City University, Dublin, Ireland
Venue:
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Year:
2001

Citing 13
Cited 2

The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I

Information and Computation
A co-induction principle for recursively defined domains

Theoretical Computer Science
A calculus for cryptographic protocols: the spi calculus

Proceedings of the 4th ACM conference on Computer and communications security
Certification of programs for secure information flow

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A fully abstract denotational semantics for the π-calculus

Theoretical Computer Science
A Petri Net Semantics for pi-Calculus

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Abstract Interpretation of Small-Step Semantics

Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Presheaf Models for the pi-Calculus

CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Fully-Abstract Model for the p-calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

A Semiring-based Quantitative Analysis of Mobile Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Measuring the speed of information leakage in mobile processes

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark's denotational model for the π-calculus and provide a full definition of the semantic domains involved. We also include an example of how the model may be approximated in an abstract interpretation analysis.