From Explicit to Symbolic Types for Communication Protocols in CCS

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

Standard

From Explicit to Symbolic Types for Communication Protocols in CCS. / Nielson, Hanne Riis ; Nielson, Flemming; Kreiker, Jörg; Pilegaard, Henrik.

Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer, 2012. p. 74-89 (Lecture Notes in Computer Science; No. 7000).

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

Harvard

Nielson, HR , Nielson, F, Kreiker, J & Pilegaard, H 2012, 'From Explicit to Symbolic Types for Communication Protocols in CCS'. in Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer, pp. 74-89. Lecture Notes in Computer Science, no. 7000, , http://dx.doi.org/10.1007/978-3-642-24933-4_5

APA

Nielson, H. R., Nielson, F., Kreiker, J., & Pilegaard, H. (2012). From Explicit to Symbolic Types for Communication Protocols in CCS. In Formal Modeling: Actors, Open Systems, Biological Systems. (pp. 74-89). Springer. (Lecture Notes in Computer Science; No. 7000). 10.1007/978-3-642-24933-4_5

CBE

Nielson HR , Nielson F, Kreiker J, Pilegaard H. 2012. From Explicit to Symbolic Types for Communication Protocols in CCS. In Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer. pp. 74-89. (Lecture Notes in Computer Science; No. 7000). Available from: http://dx.doi.org/10.1007/978-3-642-24933-4_5

MLA

Nielson, Hanne Riis et al. "From Explicit to Symbolic Types for Communication Protocols in CCS". Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer. 2012. 74-89. (Lecture Notes in Computer Science; Journal number 7000). Available: http://dx.doi.org/10.1007/978-3-642-24933-4_5

Vancouver

Nielson HR , Nielson F, Kreiker J, Pilegaard H. From Explicit to Symbolic Types for Communication Protocols in CCS. In Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Springer. 2012. p. 74-89. (Lecture Notes in Computer Science; No. 7000). Available from: http://dx.doi.org/10.1007/978-3-642-24933-4_5

Author

Nielson, Hanne Riis ; Nielson, Flemming; Kreiker, Jörg; Pilegaard, Henrik / From Explicit to Symbolic Types for Communication Protocols in CCS.

Publication: Research - peer-review › Article in proceedings – Annual report year: 2012

Bibtex

@inbook{69a079c254c942d4ab30157fd284de7b,

title = "From Explicit to Symbolic Types for Communication Protocols in CCS",

publisher = "Springer",

author = "Nielson, {Hanne Riis} and Flemming Nielson and Jörg Kreiker and Henrik Pilegaard",

year = "2012",

doi = "10.1007/978-3-642-24933-4_5",

isbn = "978-3-642-24932-7",

series = "Lecture Notes in Computer Science",

pages = "74-89",

booktitle = "Formal Modeling: Actors, Open Systems, Biological Systems",

}

RIS

TY - GEN

T1 - From Explicit to Symbolic Types for Communication Protocols in CCS

A1 - Nielson,Hanne Riis

A1 - Nielson,Flemming

A1 - Kreiker,Jörg

A1 - Pilegaard,Henrik

AU - Nielson,Hanne Riis

AU - Nielson,Flemming

AU - Kreiker,Jörg

AU - Pilegaard,Henrik

PB - Springer

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-24933-4_5

DO - 10.1007/978-3-642-24933-4_5

SN - 978-3-642-24932-7

BT - Formal Modeling: Actors, Open Systems, Biological Systems

T2 - Formal Modeling: Actors, Open Systems, Biological Systems

T3 - Lecture Notes in Computer Science

T3 - en_GB

SP - 74

EP - 89

ER -