A Sorted Semantic Framework for Applied Process Calculi (extended abstract)
2014 (English)In: Trustworthy Global Computing: TGC 2013, Springer Berlin/Heidelberg, 2014, 103-118 p.Conference paper (Refereed)
Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or computational paradigms.
Our goal is a unified framework to represent different process calculi and notions of computation. To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold. Our framework can accommodate several existing process calculi; the resulting transition systems are isomorphic to the originals up to strong bisimulation. We also demonstrate different notions of computation on data terms, including cryptographic primitives and a lambda-calculus with erratic choice. Substantial parts of the meta-theory of sorted psi-calculi have been machine-checked using Nominal Isabelle.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. 103-118 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8358
IdentifiersURN: urn:nbn:se:uu:diva-203382DOI: 10.1007/978-3-319-05119-2_7ISBN: 978-3-319-05118-5OAI: oai:DiVA.org:uu-203382DiVA: diva2:636375
8th International Symposium on Trustworthy Global Computing, August 30-31, 2013, Buenos Aires, Argentina
FunderSwedish Foundation for Strategic Research , RIT080065