Affordable Access

From Explicit to Symbolic Types for Communication Protocols in CCS

Publication Date
  • Communication


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.

There are no comments yet on this publication. Be the first to share your thoughts.