Conference paper
From Explicit to Symbolic Types for Communication Protocols in CCS
In
Lecture Notes in Computer Science
—
2012, pp. 74-89
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.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2012 |
| Pages: | 74-89 |
| Proceedings: | Symposium in honor of Carolyn Talcott |
| Series: | Lecture Notes in Computer Science |
| Journal subtitle: | Essays Dedicated To Carolyn Talcott on the Occasion of Her 70th Birthday |
| ISBN: | 3642249329 , 3642249337 , 9783642249327 and 9783642249334 |
| ISSN: | 03029743 |
| Types: | Conference paper |
| DOI: | 10.1007/978-3-642-24933-4_5 |
| ORCIDs: | Nielson, Hanne Riis and Nielson, Flemming |
