Skip header Section
Skip Bibliometrics Section
PI-Calculus: A Theory of Mobile ProcessesJuly 2001
- Authors:
- Davide Sangiorgi,
- David Walker
Skip Abstract Section
Abstract
From the Publisher:
Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviors.
The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyze their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming.
The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.
Cited By
Din C, Hähnle R, Henrio L, Johnsen E, Pun V and Tarifa S (2024). Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages, ACM Transactions on Programming Languages and Systems, 46:1, (1-58), Online publication date: 31-Mar-2024.- Bandukara M and Tzevelekos N (2023). On-the-fly bisimulation equivalence checking for fresh-register automata, Journal of Systems Architecture: the EUROMICRO Journal, 145:C, Online publication date: 1-Dec-2023.
- van den Heuvel B, Paulus J, Nantes-Sobrinho D and Pérez J Typed Non-determinism in Functional and Concurrent Calculi Programming Languages and Systems, (112-132)
- Frumin D, D’Osualdo E, van den Heuvel B and Pérez J (2022). A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency, Proceedings of the ACM on Programming Languages, 6:OOPSLA2, (841-869), Online publication date: 31-Oct-2022.
- Dardha O, Giachino E and Sangiorgi D Session Types Revisited: A Decade Later Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming, (1-4)
- Durier A, Hirschkoff D and Sangiorgi D (2022). Eager functions as processes, Theoretical Computer Science, 913:C, (8-42), Online publication date: 20-Apr-2022.
- Casal F, Mordido A and Vasconcelos V (2022). Mixed sessions, Theoretical Computer Science, 897:C, (23-48), Online publication date: 2-Jan-2022.
- Nweke L, Weldehawaryat G and Wolthusen S (2021). Threat Modelling of Cyber–Physical Systems Using an Applied π-Calculus, International Journal of Critical Infrastructure Protection, 35:C, Online publication date: 1-Dec-2021.
- Toninho B and Yoshida N (2021). On Polymorphic Sessions and Functions, ACM Transactions on Programming Languages and Systems, 43:2, (1-55), Online publication date: 30-Jun-2021.
- Hirschkoff D, Prebet E and Sangiorgi D On sequentiality and well-bracketing in the π-calculus Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Zalakain U and Dardha O with Leftovers: A Mechanisation in Agda Formal Techniques for Distributed Objects, Components, and Systems, (157-174)
- Zhang W, Xu X, Yin Q and Long H (2021). On the Interactive Power of Higher-order Processes Extended with Parameterization, Formal Aspects of Computing, 33:2, (151-183), Online publication date: 1-Mar-2021.
- Ambal G, Lenglet S and Schmitt A (2021). HO in Coq, Journal of Automated Reasoning, 65:1, (75-124), Online publication date: 1-Jan-2021.
- Aschieri F, Ciabattoni A and Genco F (2020). On the concurrent computational content of intermediate logics, Theoretical Computer Science, 813:C, (375-409), Online publication date: 12-Apr-2020.
- Durier A, Hirschkoff D and Sangiorgi D (2020). Towards ‘up to context’ reasoning about higher-order processes, Theoretical Computer Science, 807:C, (154-168), Online publication date: 6-Feb-2020.
- Erkens R, Rot J and Luttik B Up-to Techniques for Branching Bisimilarity SOFSEM 2020: Theory and Practice of Computer Science, (285-297)
- Patrignani M, Ahmed A and Clarke D (2019). Formal Approaches to Secure Compilation, ACM Computing Surveys, 51:6, (1-36), Online publication date: 30-Nov-2019.
- Scalas A, Yoshida N and Benussi E Effpi Proceedings of the Tenth ACM SIGPLAN Symposium on Scala, (27-31)
- Gabbrielli M, Giallorenzo S, Lanese I, Montesi F, Peressotti M and Zingaro S No More, No Less Coordination Models and Languages, (148-157)
- Scalas A, Yoshida N and Benussi E Verifying message-passing programs with dependent behavioural types Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, (502-516)
- Kungne W, Kouamou G and Tangha C Introducing an Artifact-driven language for Service Composition Proceedings of the ArabWIC 6th Annual International Conference Research Track, (1-6)
- Baldan P and Gadducci F (2019). Petri nets are dioids, Acta Informatica, 56:1, (61-92), Online publication date: 1-Feb-2019.
- Kokke W, Montesi F and Peressotti M (2019). Better late than never: a fully-abstract semantics for classical processes, Proceedings of the ACM on Programming Languages, 3:POPL, (1-29), Online publication date: 2-Jan-2019.
- Dal Lago U, de Visme M, Mazza D and Yoshimizu A (2019). Intersection types and runtime errors in the pi-calculus, Proceedings of the ACM on Programming Languages, 3:POPL, (1-29), Online publication date: 2-Jan-2019.
- Gu R, Shao Z, Kim J, Wu X, Koenig J, Sjöberg V, Chen H, Costanzo D and Ramananandro T (2018). Certified concurrent abstraction layers, ACM SIGPLAN Notices, 53:4, (646-661), Online publication date: 2-Dec-2018.
- Durier A, Hirschkoff D and Sangiorgi D Eager Functions as Processes Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, (364-373)
- Gu R, Shao Z, Kim J, Wu X, Koenig J, Sjöberg V, Chen H, Costanzo D and Ramananandro T Certified concurrent abstraction layers Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (646-661)
- Borda A, Pasquale L, Koutavas V and Nuseibeh B Compositional verification of self-adaptive cyber-physical systems Proceedings of the 13th International Conference on Software Engineering for Adaptive and Self-Managing Systems, (1-11)
- Carbone M, Montesi F and Schürmann C (2018). Choreographies, logically, Distributed Computing, 31:1, (51-67), Online publication date: 1-Feb-2018.
- Lenglet S and Schmitt A HOπ in Coq Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, (252-265)
- Dardha O, Giachino E and Sangiorgi D (2017). Session types revisited, Information and Computation, 256:C, (253-286), Online publication date: 1-Oct-2017.
- Crafa S and Padovani L (2017). The Chemical Approach to Typestate-Oriented Programming, ACM Transactions on Programming Languages and Systems, 39:3, (1-45), Online publication date: 30-Sep-2017.
- Biernacka M, Biernacki D, Lenglet S, Polesiuk P, Pous D and Schmitt A Fully abstract encodings of λ-calculus in hocore through abstract machines Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Aschieri F, Ciabattoni A and Genco F Gödel logic Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Lange J, Ng N, Toninho B and Yoshida N (2017). Fencing off go: liveness and safety for channel-based programming, ACM SIGPLAN Notices, 52:1, (748-761), Online publication date: 11-May-2017.
- Carbone M, Montesi F, Schürmann C and Yoshida N (2017). Multiparty session types as coherence proofs, Acta Informatica, 54:3, (243-269), Online publication date: 1-May-2017.
- Caires L and Pérez J Linearity, Control Effects, and Behavioral Types Programming Languages and Systems, (229-259)
- Pous D and Rot J Companions, Codensity and Causality Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203, (106-123)
- Cruz-Filipe L, Larsen K and Montesi F The Paths to Choreography Extraction Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203, (424-440)
- Cruz-Filipe L and Montesi F Encoding asynchrony in choreographies Proceedings of the Symposium on Applied Computing, (1175-1177)
- Bhattacharyya A, Mokhov A and Pierce K (2017). An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems, Formal Aspects of Computing, 29:2, (251-307), Online publication date: 1-Mar-2017.
- Sangiorgi D (2017). Equations, Contractions, and Unique Solutions, ACM Transactions on Computational Logic, 18:1, (1-30), Online publication date: 31-Jan-2017.
- Lange J, Ng N, Toninho B and Yoshida N Fencing off go: liveness and safety for channel-based programming Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (748-761)
- Madeira A, Neves R, Barbosa L and Martins M (2016). A method for rigorous design of reconfigurable systems, Science of Computer Programming, 132:P1, (50-76), Online publication date: 15-Dec-2016.
- Hirschkoff D, Madiot J and Sangiorgi D (2016). Name-passing calculi, Information and Computation, 251:C, (335-360), Online publication date: 1-Dec-2016.
- Montesi F (2016). Process-aware web programming with Jolie, Science of Computer Programming, 130:C, (69-96), Online publication date: 15-Nov-2016.
- Siewe F and Yang H (2016). Privacy protection by typing in ubiquitous computing systems, Journal of Systems and Software, 120:C, (133-153), Online publication date: 1-Oct-2016.
- Pous D Coinduction All the Way Up Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (307-316)
- Ancona D, Bono V, Bravetti M, Campos J, Castagna G, Deniélou P, Gay S, Gesbert N, Giachino E, Hu R, Johnsen E, Martins F, Mascardi V, Montesi F, Neykova R, Ng N, Padovani L, Vasconcelos V and Yoshida N (2016). Behavioral Types in Programming Languages, Foundations and Trends in Programming Languages, 3:2-3, (95-230), Online publication date: 1-Jul-2016.
- Caires L and Pérez J Multiparty Session Types Within a Canonical Binary Theory, and Beyond 36th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems - Volume 9688, (74-95)
- Abd Alrahman Y, De Nicola R and Loreti M On the Power of Attribute-Based Communication 36th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems - Volume 9688, (1-18)
- Orchard D and Yoshida N (2016). Effects as sessions, sessions as effects, ACM SIGPLAN Notices, 51:1, (568-581), Online publication date: 8-Apr-2016.
- Kouzapas D, Pérez J and Yoshida N On the Relative Expressiveness of Higher-Order Session Processes Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (446-475)
- Garnock-Jones T and Felleisen M Coordinated Concurrent Programming in Syndicate Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (310-336)
- (2016). Effect capabilities for Haskell, Science of Computer Programming, 119:C, (3-30), Online publication date: 1-Apr-2016.
- Åman Pohjola J and Parrow J Bisimulation up-to techniques for psi-calculi Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, (142-153)
- (2016). Theory of interaction, Theoretical Computer Science, 611:C, (1-49), Online publication date: 18-Jan-2016.
- Orchard D and Yoshida N Effects as sessions, sessions as effects Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (568-581)
- Arbab F Proper Protocol Essays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 9660, (65-87)
- Crafa S and Padovani L (2015). The chemical approach to typestate-oriented programming, ACM SIGPLAN Notices, 50:10, (917-934), Online publication date: 18-Dec-2015.
- Cervesato I and Lam E Modular Multiset Rewriting Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - Volume 9450, (515-531)
- Pasqualin D, Vizzotto J and Piveta E (2015). Typed context awareness Ambient Calculus for pervasive applications, Formal Aspects of Computing, 27:5-6, (885-916), Online publication date: 1-Nov-2015.
- Sangiorgi D The Proof Technique of Unique Solutions of Contractions Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (63-68)
- Cristescu I, Krivine J and Varacca D Rigid Families for CCS and the $$\pi $$-calculus Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 9399, (223-240)
- Crafa S and Padovani L The chemical approach to typestate-oriented programming Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (917-934)
- Kumar N and Shyamasundar R Labelled mobile ambients model for information flow security in distributed systems Proceedings of the 8th International Conference on Security of Information and Networks, (330-337)
- Wilcox J, Woos D, Panchekha P, Tatlock Z, Wang X, Ernst M and Anderson T (2015). Verdi: a framework for implementing and formally verifying distributed systems, ACM SIGPLAN Notices, 50:6, (357-368), Online publication date: 7-Aug-2015.
- Khomenko V and Germanos V Modelling and Analysis Mobile Systems Using $$\pi $$-calculus EFCP Transactions on Petri Nets and Other Models of Concurrency X - Volume 9410, (153-175)
- Wilcox J, Woos D, Panchekha P, Tatlock Z, Wang X, Ernst M and Anderson T Verdi: a framework for implementing and formally verifying distributed systems Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (357-368)
- Sangiorgi D (2015). Equations, Contractions, and Unique Solutions, ACM SIGPLAN Notices, 50:1, (421-432), Online publication date: 11-May-2015.
- Al-Humaimeedy A and Fernández M (2015). Enabling Synchronous and Asynchronous Communications in CSP for SOC, Electronic Notes in Theoretical Computer Science (ENTCS), 312:C, (69-88), Online publication date: 24-Apr-2015.
- Sangiorgi D Equations, Contractions, and Unique Solutions Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (421-432)
- Chaudhuri K, Cimini M and Miller D A Lightweight Formalization of the Metatheory of Bisimulation-Up-To Proceedings of the 2015 Conference on Certified Programs and Proofs, (157-166)
- Pérez J, Caires L, Pfenning F and Toninho B (2014). Linear logical relations and observational equivalences for session-based concurrency, Information and Computation, 239:C, (254-302), Online publication date: 1-Dec-2014.
- Downen P, Maurer L, Ariola Z and Varacca D Continuations, Processes, and Sharing Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, (69-80)
- Cruz-Filipe L, Lanese I, Martins F, Ravara A and Thudichum Vasconcelos V (2014). The stream-based service-centred calculus: a foundation for service-oriented programming, Formal Aspects of Computing, 26:5, (865-918), Online publication date: 1-Sep-2014.
- He J, Wadler P and Trinder P Typecasting actors Proceedings of the Fifth Annual Scala Workshop, (23-33)
- Boer F and Gouw S Combining Monitoring with Run-Time Assertion Checking Advanced Lectures of the 14th International School on Formal Methods for Executable Software Models - Volume 8483, (217-262)
- Garnock-Jones T, Tobin-Hochstadt S and Felleisen M The Network as a Language Construct Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410, (473-492)
- Umatani S Practical implementation techniques of ambient calculus in conventional dynamic languages Proceedings of the 29th Annual ACM Symposium on Applied Computing, (1345-1351)
- Dal Lago U, Sangiorgi D and Alberti M (2014). On coinductive equivalences for higher-order probabilistic functional programs, ACM SIGPLAN Notices, 49:1, (297-308), Online publication date: 13-Jan-2014.
- Dal Lago U, Sangiorgi D and Alberti M On coinductive equivalences for higher-order probabilistic functional programs Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (297-308)
- Cervesato I and Sans T (2014). Substructural Meta-Theory of a Type-Safe Language for Web Programming, Fundamenta Informaticae, 130:1, (67-97), Online publication date: 1-Jan-2014.
- Yang H, Cai C, Peng L, Zhao X, Qiu Z and Qin S (2013). Algorithms for checking channel passing in web service choreography, Frontiers of Computer Science: Selected Publications from Chinese Universities, 7:5, (710-728), Online publication date: 1-Oct-2013.
- Blyth A Role Logic and its Application to the Analysis of Process Control Systems from the Socio-Technical System Perspective Proceedings of the 1st International Symposium on ICS & SCADA Cyber Security Research 2013, (42-47)
- Hüchting R, Majumdar R and Meyer R A theory of name boundedness Proceedings of the 24th international conference on Concurrency Theory, (182-196)
- Hirschkoff D, Madiot J and Sangiorgi D Name-Passing Calculi Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (378-387)
- Lanese I, Bedogni L and Di Felice M Internet of things Proceedings of the 28th Annual ACM Symposium on Applied Computing, (1339-1346)
- Lanese I, Lienhardt M, Mezzina C, Schmitt A and Stefani J Concurrent flexible reversibility Proceedings of the 22nd European conference on Programming Languages and Systems, (370-390)
- Caires L, Pérez J, Pfenning F and Toninho B Behavioral polymorphism and parametricity in session-based communication Proceedings of the 22nd European conference on Programming Languages and Systems, (330-349)
- Akella R and McMillin B Modeling and verification of security properties for critical infrastructure protection Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop, (1-5)
- Chen Y Algebraic program semantics for supercomputing Theories of Programming and Formal Methods, (118-135)
- Jeffrey A and Rathke J (2013). Contextual Equivalence for Higher-Order π-Calculus Revisited, Electronic Notes in Theoretical Computer Science (ENTCS), 83, (149-168), Online publication date: 1-Jan-2013.
- (2012). Rule formats for distributivity, Theoretical Computer Science, 458:C, (1-28), Online publication date: 2-Nov-2012.
- Deng Y and Feng Y Open bisimulation for quantum processes Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science, (119-133)
- Bodei C, Degano P, Ferrari G, Galletta L and Mezzetti G Formalising security in ubiquitous and cloud scenarios Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management, (1-29)
- Kurnia I and Poetzsch-Heffter A Verification of Open Concurrent Object Systems Revised Lectures of the 11th International Symposium on Formal Methods for Components and Objects - Volume 7866, (83-118)
- Monjaraz R and Mariño J From the π-calculus to flat GHC Proceedings of the 14th symposium on Principles and practice of declarative programming, (163-172)
- Dardha O, Giachino E and Sangiorgi D Session types revisited Proceedings of the 14th symposium on Principles and practice of declarative programming, (139-150)
- Baltazar P, Caires L, Vasconcelos V and Vieira H A Type System for Flexible Role Assignment in Multiparty Communicating Systems Revised Selected Papers of the 7th International Symposium on Trustworthy Global Computing - Volume 8191, (82-96)
- Meyer R, Khomenko V and Hüchting R A polynomial translation of π-calculus (FCP) to safe petri nets Proceedings of the 23rd international conference on Concurrency Theory, (440-455)
- Hirschkoff D, Madiot J and Sangiorgi D Duality and i/o-types in the π-calculus Proceedings of the 23rd international conference on Concurrency Theory, (302-316)
- Cimini M, Mousavi M, Reniers M and Gabbay M (2012). Nominal SOS, Electronic Notes in Theoretical Computer Science (ENTCS), 286, (103-116), Online publication date: 1-Sep-2012.
- Tzevelekos N (2012). Program equivalence in a simple language with state, Computer Languages, Systems and Structures, 38:2, (181-198), Online publication date: 1-Jul-2012.
- Hennessy M (2012). Exploring probabilistic bisimulations, part I, Formal Aspects of Computing, 24:4-6, (749-768), Online publication date: 1-Jul-2012.
- Deng Y and Tiu A (2012). Characterisations of testing preorders for a finite probabilistic π-calculus, Formal Aspects of Computing, 24:4-6, (701-726), Online publication date: 1-Jul-2012.
- Sabel D and Schmidt-Schauβ M Conservative Concurrency in Haskell Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (561-570)
- Pierard A and Sumii E A Higher-Order Distributed Calculus with Name Creation Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (531-540)
- Degano P, Ferrari G, Galletta L and Mezzetti G Types for coordinating secure behavioural variations Proceedings of the 14th international conference on Coordination Models and Languages, (261-276)
- Aman B, Ciobanu G and Koutny M Behavioural equivalences over migrating processes with timers Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems, (52-66)
- Biernacki D and Lenglet S Normal form bisimulations for delimited-control operators Proceedings of the 11th international conference on Functional and Logic Programming, (47-61)
- Cappello I and Quaglia P Expressing global priorities by best-matching Proceedings of the 27th Annual ACM Symposium on Applied Computing, (1544-1550)
- Pérez J, Caires L, Pfenning F and Toninho B Linear logical relations for session-based concurrency Proceedings of the 21st European conference on Programming Languages and Systems, (539-558)
- Biernacki D and Lenglet S Applicative bisimulations for delimited-control operators Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (119-134)
- Toninho B, Caires L and Pfenning F Functions as session-typed processes Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (346-360)
- Peters K and Nestmann U Is it a "good" encoding of mixed choice? Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures, (210-224)
- Caires L, Pfenning F and Toninho B Towards concurrent type theory Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, (1-12)
- Piccolo M (2012). Strong Normalization in the π-calculus with Intersection and Union Types, Fundamenta Informaticae, 121:1-4, (227-252), Online publication date: 1-Jan-2012.
- Poroor J and Jayaraman B Formal specification and verification of vehicular handoff using π-calculus Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, (165-168)
- Borgström J, Huang S, Johansson M, Raabjerg P, Victor B, Pohjola J and Parrow J Broadcast psi-calculi with an application to wireless protocols Proceedings of the 9th international conference on Software engineering and formal methods, (74-89)
- Pérez-Sotelo J, Cuesta C and Ossowski S Adaptation patterns in multi-agent architectures Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems, (657-661)
- Demangeon R and Honda K Full abstraction in a subtyped pi-calculus with linear types Proceedings of the 22nd international conference on Concurrency theory, (280-296)
- Hüttel H Typed Ψ-calculi Proceedings of the 22nd international conference on Concurrency theory, (265-279)
- Klin B (2011). Bialgebras for structural operational semantics, Theoretical Computer Science, 412:38, (5043-5069), Online publication date: 2-Sep-2011.
- Preda M and Di Giusto C Hunting distributed malware with the κ-calculus Proceedings of the 18th international conference on Fundamentals of computation theory, (102-113)
- Toninho B, Caires L and Pfenning F Dependent session types via intuitionistic linear type theory Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, (161-172)
- Sabel D and Schmidt-Schauß M A contextual semantics for concurrent Haskell with futures Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, (101-112)
- Deng Y and Hennessy M On the semantics of Markov automata Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (307-318)
- Siewe F, Zedan H and Cau A (2011). The Calculus of Context-aware Ambients, Journal of Computer and System Sciences, 77:4, (597-620), Online publication date: 1-Jul-2011.
- He C, Fu Y and Fu H Decidability of behavioral equivalences in process calculi with name scoping Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, (284-298)
- Martinho J and Ravara A (2011). Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation, Journal of Automated Reasoning, 46:3-4, (293-323), Online publication date: 1-Apr-2011.
- Koutavas V and Hennessy M A testing theory for a higher-order cryptographic language Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software, (358-377)
- Piérard A and Sumii E Sound bisimulations for higher-order distributed process calculus Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software, (123-137)
- Tzevelekos N Fresh-register automata Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (295-306)
- Turon A and Wand M A separation logic for refining concurrent objects Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (247-258)
- Tzevelekos N (2011). Fresh-register automata, ACM SIGPLAN Notices, 46:1, (295-306), Online publication date: 26-Jan-2011.
- Turon A and Wand M (2011). A separation logic for refining concurrent objects, ACM SIGPLAN Notices, 46:1, (247-258), Online publication date: 26-Jan-2011.
- Peschanski F Parallel computing with the Pi-calculus Proceedings of the sixth workshop on Declarative aspects of multicore programming, (45-54)
- Crafa S, Ranzato F and Tapparo F (2011). Saving Space in a Time Efficient Simulation Algorithm, Fundamenta Informaticae, 108:1-2, (23-42), Online publication date: 1-Jan-2011.
- Hartmann L, Jones N, Simonsen J and Vrist S Computational biology Formal modeling, (403-433)
- Arbab F Puff, the magic protocol Formal modeling, (169-206)
- Cappello I, Clark A, Gilmore S, Latella D, Loreti M, Quaglia P and Schivo S Quantitative analysis of services Rigorous software engineering for service-oriented systems, (522-540)
- Ferreira C, Lanese I, Ravara A, Vieira H and Zavattaro G Advanced mechanisms for service combination and transactions Rigorous software engineering for service-oriented systems, (302-325)
- Lanese I, Ravara A and Vieira H Behavioral theory for session-oriented calculi Rigorous software engineering for service-oriented systems, (189-213)
- Sangiorgi D, Kobayashi N and Sumii E (2011). Environmental bisimulations for higher-order languages, ACM Transactions on Programming Languages and Systems, 33:1, (1-69), Online publication date: 1-Jan-2011.
- Du W and Deng Y (2010). On Mobility and Communication, Electronic Notes in Theoretical Computer Science (ENTCS), 257, (19-33), Online publication date: 1-Dec-2010.
- Gorla D (2010). A taxonomy of process calculi for distribution and mobility, Distributed Computing, 23:4, (273-299), Online publication date: 1-Dec-2010.
- Zhou X, Li Y, Li W, Qiao H and Shu Z Bisimulation proof methods in a path-based specification language for polynomial coalgebras Proceedings of the 8th Asian conference on Programming languages and systems, (239-254)
- Paulevé L, Youssef S, Lakin M and Phillips A A generic abstract machine for stochastic process calculi Proceedings of the 8th International Conference on Computational Methods in Systems Biology, (43-54)
- Al-Sammarraie M, Siewe F and Zedan H Formalising policies of a mLearning system using CCA Proceedings of the 4th ACM International Workshop on Context-Awareness for Self-Managing Systems, (11-19)
- McEvoy T and Wolthusen S A formal adversary capability model for SCADA environments Proceedings of the 5th international conference on Critical Information Infrastructures Security, (93-103)
- Lanese I, Mezzina C and Stefani J Reversing higher-order pi Proceedings of the 21st international conference on Concurrency theory, (478-493)
- Demangeon R, Hirschkoff D and Sangiorgi D Termination in impure concurrent languages Proceedings of the 21st international conference on Concurrency theory, (328-342)
- Caires L and Pfenning F Session types as intuitionistic linear propositions Proceedings of the 21st international conference on Concurrency theory, (222-236)
- Rosa-Velardo F Depth boundedness in multiset rewriting systems with name binding Proceedings of the 4th international conference on Reachability problems, (161-175)
- Su G, Ying M and Zhang C An ADL-approach to specifying and analyzing centralized-mode architectural connection Proceedings of the 4th European conference on Software architecture, (8-23)
- Góngora P, Ufferman E and Hernández-Quiroz F Formal semantics of a dynamic epistemic logic for describing knowledge properties of π-calculus processes Proceedings of the 11th international conference on Computational logic in multi-agent systems, (65-81)
- Barbanera F and de'Liguoro U Two notions of sub-behaviour for session-based client/server systems Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, (155-164)
- Hirschkoff D and Pous D On bisimilarity and substitution in presence of replication Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II, (454-465)
- Godskesen J Observables for mobile and wireless broadcasting systems Proceedings of the 12th international conference on Coordination Models and Languages, (1-15)
- Kobayashi N and Sangiorgi D (2008). A hybrid type system for lock-freedom of mobile processes, ACM Transactions on Programming Languages and Systems, 32:5, (1-49), Online publication date: 1-May-2010.
- Rosa-Velardo F Multiset rewriting Proceedings of the 8th international conference on Rewriting logic and its applications, (191-207)
- Schmidt-Schauβ M and Sabel D (2010). On generic context lemmas for higher-order calculi with sharing, Theoretical Computer Science, 411:11-13, (1521-1541), Online publication date: 1-Mar-2010.
- Fu Y and Lu H (2010). On the expressiveness of interaction, Theoretical Computer Science, 411:11-13, (1387-1451), Online publication date: 1-Mar-2010.
- Cappello I and Quaglia P A tool for checking probabilistic properties of COWS services Proceedings of the 5th international conference on Trustworthly global computing, (364-378)
- Montesi F and Sangiorgi D A model of evolvable components Proceedings of the 5th international conference on Trustworthly global computing, (153-171)
- Gamboni M and Ravara A Responsive choice in mobile processes Proceedings of the 5th international conference on Trustworthly global computing, (135-152)
- Cimini M, Coen C and Sangiorgi D Functions as processes Proceedings of the 5th international conference on Trustworthly global computing, (73-86)
- Larcher R, Priami C and Romanel A Modelling self-assembly in BlenX Transactions on Computational Systems Biology XII, (163-198)
- Tiu A and Miller D (2010). Proof search specifications of bisimulation and modal logics for the π-calculus, ACM Transactions on Computational Logic, 11:2, (1-35), Online publication date: 1-Jan-2010.
- Romanel A and Priami C (2010). On the computational power of BlenX, Theoretical Computer Science, 411:2, (542-565), Online publication date: 1-Jan-2010.
- Srivatsa M, Agrawal D and Reidt S A metadata calculus for secure information sharing Proceedings of the 16th ACM conference on Computer and communications security, (488-499)
- Cirillo A and Riely J Reflections on trust Proceedings of the 6th international conference on Formal Aspects in Security and Trust, (51-65)
- Hoare C, Möller B, Struth G and Wehrman I Foundations of Concurrent Kleene Algebra Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science, (166-186)
- Cervesato I and Scedrov A (2009). Relating state-based and process-based concurrency through linear logic (full-version), Information and Computation, 207:10, (1044-1077), Online publication date: 1-Oct-2009.
- Cuesta C and Romay M Elements of self-adaptive systems Proceedings of the First international conference on Self-organizing architectures, (1-20)
- Staton S Relating coalgebraic notions of bisimulation Proceedings of the 3rd international conference on Algebra and coalgebra in computer science, (191-205)
- Popescu A Weak bisimilarity coalgebraically Proceedings of the 3rd international conference on Algebra and coalgebra in computer science, (157-172)
- Dezani-Ciancaglini M and De'Liguoro U Sessions and session types Proceedings of the 6th international conference on Web services and formal methods, (1-28)
- Stannett M (2009). The computational status of physics, Natural Computing: an international journal, 8:3, (517-538), Online publication date: 1-Sep-2009.
- Meyer R, Khomenko V and Strazny T (2009). A Practical Approach to Verification of Mobile Systems Using Net Unfoldings, Fundamenta Informaticae, 94:3-4, (439-471), Online publication date: 1-Aug-2009.
- Meyer R, Khomenko V and Strazny T (2009). A Practical Approach to Verification of Mobile Systems Using Net Unfoldings, Fundamenta Informaticae, 94:3-4, (439-471), Online publication date: 1-Aug-2009.
- Barbosa M and Barbosa L (2009). A perspective on service orchestration, Science of Computer Programming, 74:9, (671-687), Online publication date: 1-Jul-2009.
- Hennessy M and Gaur M (2009). Counting the Cost in the Picalculus (Extended Abstract), Electronic Notes in Theoretical Computer Science (ENTCS), 229:3, (117-129), Online publication date: 1-Jul-2009.
- Bundgaard M, Godskesen J, Haagensen B and Hüttel H (2009). Decidable Fragments of a Higher Order Calculus with Locations, Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (113-138), Online publication date: 1-Jul-2009.
- Bartoletti M, Degano P, Ferrari G and Zunino R (2009). Hard Life with Weak Binders, Electronic Notes in Theoretical Computer Science (ENTCS), 242:1, (49-72), Online publication date: 1-Jul-2009.
- Cogumbreiro T, Martins F and Vasconcelos V (2009). Compiling the π-calculus into a Multithreaded Typed Assembly Language, Electronic Notes in Theoretical Computer Science (ENTCS), 241, (57-84), Online publication date: 1-Jul-2009.
- Szirbik N and Stuit M Default interactions for multi-agent simulations of complex organizations Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation, (1-15)
- Hennessy M Distributed Systems and Their Environments Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (4-5)
- Sangiorgi D (2009). On the origins of bisimulation and coinduction, ACM Transactions on Programming Languages and Systems, 31:4, (1-41), Online publication date: 1-May-2009.
- Lenglet S, Schmitt A and Stefani J Normal Bisimulations in Calculi with Passivation Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (257-271)
- Höhn S Model-based reasoning on the achievement of business goals Proceedings of the 2009 ACM symposium on Applied Computing, (1589-1593)
- Fiore M and Staton S (2009). A congruence rule format for name-passing process calculi, Information and Computation, 207:2, (209-236), Online publication date: 1-Feb-2009.
- Merro M (2009). An Observational Theory for Mobile Ad Hoc Networks (full version), Information and Computation, 207:2, (194-208), Online publication date: 1-Feb-2009.
- Cappello I and Quaglia P (2009). A Translation of Beta-binders in a Prioritized Pi-calculus, Electronic Notes in Theoretical Computer Science (ENTCS), 229:1, (109-125), Online publication date: 1-Feb-2009.
- Demangeon R, Hirschkoff D and Sangiorgi D Mobile processes and termination Semantics and algebraic specification, (250-273)
- Klin B Structural operational semantics for weighted transition systems Semantics and algebraic specification, (121-139)
- Tiu A (2009). On the Role of Names in Reasoning about λ-tree Syntax Specifications, Electronic Notes in Theoretical Computer Science (ENTCS), 228, (135-150), Online publication date: 1-Jan-2009.
- Xu X (2009). Expressing first-order π-calculus in higher-order calculus of communicating systems, Journal of Computer Science and Technology, 24:1, (122-137), Online publication date: 1-Jan-2009.
- Acciai L and Boreale M (2008). Responsiveness in process calculi, Theoretical Computer Science, 409:1, (59-93), Online publication date: 1-Dec-2008.
- Donnelly K and Fluet M (2008). Transactional events1, Journal of Functional Programming, 18:5-6, (649-706), Online publication date: 1-Sep-2008.
- Cheney J and Urban C (2008). Nominal logic programming, ACM Transactions on Programming Languages and Systems, 30:5, (1-47), Online publication date: 1-Aug-2008.
- Pous D (2008). Using bisimulation proof techniques for the analysis of distributed abstract machines, Theoretical Computer Science, 402:2-3, (199-220), Online publication date: 20-Jul-2008.
- Dezani-Ciancaglini M, Ghilezan S, Pantovi J and Varacca D (2008). Security types for dynamic web data, Theoretical Computer Science, 402:2-3, (156-171), Online publication date: 20-Jul-2008.
- Bruni R and Lanese I (2008). Parametric synchronizations in mobile nominal calculi, Theoretical Computer Science, 402:2-3, (102-119), Online publication date: 20-Jul-2008.
- Paolini L and Piccolo M Semantically linear programming languages Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (97-107)
- Kobayashi N and Sangiorgi D A Hybrid Type System for Lock-Freedom of Mobile Processes Proceedings of the 20th international conference on Computer Aided Verification, (80-93)
- Meyer R, Khomenko V and Strazny T A Practical Approach to Verification of Mobile Systems Using Net Unfoldings Proceedings of the 29th international conference on Applications and Theory of Petri Nets, (327-347)
- Cruz-Filipe L, Lanese I, Martins F, Ravara A and Vasconcelos V Behavioural Theory at Work Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (59-77)
- Coppo M, Dezani-ciancaglini M and Giovannetti E (2008). Types for ambient and process mobility†, Mathematical Structures in Computer Science, 18:2, (221-290), Online publication date: 1-Apr-2008.
- Vieira H, Caires L and Seco J The conversation calculus Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems, (269-283)
- Laid K and Allaoua C Code mobility modeling Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications, (1-6)
- Stark I (2008). Free-algebra models for the π -calculus, Theoretical Computer Science, 390:2-3, (248-270), Online publication date: 20-Jan-2008.
- Jeffrey A and Rathke J (2008). Full abstraction for polymorphic π-calculus, Theoretical Computer Science, 390:2-3, (171-196), Online publication date: 20-Jan-2008.
- Phillips I and Vigliotti M (2008). Symmetric electoral systems for ambient calculi, Information and Computation, 206:1, (34-72), Online publication date: 1-Jan-2008.
- Barthe G and Prensa Nieto L (2007). Secure information flow for a concurrent language with scheduling, Journal of Computer Security, 15:6, (647-689), Online publication date: 1-Dec-2007.
- Vigliotti M, Phillips I and Palamidessi C (2007). Tutorial on separation results in process calculi via leader election problems, Theoretical Computer Science, 388:1-3, (267-289), Online publication date: 1-Dec-2007.
- Aranda J, Di Giusto C, Nielsen M and Valencia F CCS with replication in the Chomsky hierarchy Proceedings of the 5th Asian conference on Programming languages and systems, (383-398)
- Pous D Complete lattices and up-to techniques Proceedings of the 5th Asian conference on Programming languages and systems, (351-366)
- Aranda J, Di Giusto C, Nielsen M and Valencia F CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence Programming Languages and Systems, (383-398)
- Pous D Complete Lattices and Up-To Techniques Programming Languages and Systems, (351-366)
- Puhlmann F Soundness verification of business processes specified in the Pi-calculus Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I, (6-23)
- Castellani I (2007). State-oriented Noninterference for CCS, Electronic Notes in Theoretical Computer Science (ENTCS), 194:1, (39-60), Online publication date: 1-Nov-2007.
- Briais S and Nestmann U (2007). Open bisimulation, revisited, Theoretical Computer Science, 386:3, (236-271), Online publication date: 20-Oct-2007.
- Gardner P, Laneve C and Wischik L (2007). Linear forwarders, Information and Computation, 205:10, (1526-1550), Online publication date: 1-Oct-2007.
- Sobociński P (2007). A Well-behaved LTS for the Pi-calculus, Electronic Notes in Theoretical Computer Science (ENTCS), 192:1, (5-11), Online publication date: 1-Oct-2007.
- Prandi D and Quaglia P Stochastic COWS Proceedings of the 5th international conference on Service-Oriented Computing, (245-256)
- Ehrhard T and Laurent O Interpreting a finitary pi-calculus in differential interaction nets Proceedings of the 18th international conference on Concurrency Theory, (333-348)
- König B Deriving bisimulation congruences with borrowed contexts Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (36-39)
- Caires L Logical semantics of types for concurrency Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (16-35)
- Pous D (2007). New up-to techniques for weak bisimulation, Theoretical Computer Science, 380:1-2, (164-180), Online publication date: 20-Jul-2007.
- Karkinsky D, Schneider S and Treharne H Combining mobility with state Proceedings of the 6th international conference on Integrated formal methods, (373-392)
- Abadi M, Blanchet B and Fournet C (2007). Just fast keying in the pi calculus, ACM Transactions on Information and System Security, 10:3, (9-es), Online publication date: 1-Jul-2007.
- Faggian C and Piccolo M Ludics is a model for the finitary linear pi-calculus Proceedings of the 8th international conference on Typed lambda calculi and applications, (148-162)
- Bidinger P and Compagnoni A Pict correctness revisited Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems, (206-220)
- Yang Q, Li M, Wang Q, Yang G, Zhai J, Li J, Hou L and Yang Y An algebraic approach for managing inconsistencies in software processes Proceedings of the 2007 international conference on Software process, (121-133)
- Niehren J, Sabel D, Schmidt-Schauß M and Schwinghammer J (2007). Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, Electronic Notes in Theoretical Computer Science (ENTCS), 173, (313-337), Online publication date: 1-Apr-2007.
- Mousavi M, Reniers M and Groote J (2007). SOS formats and meta-theory, Theoretical Computer Science, 373:3, (238-272), Online publication date: 30-Mar-2007.
- Hirschkoff D and Pous D A distribution law for CCS and a new congruence result for the π-calculus Proceedings of the 10th international conference on Foundations of software science and computational structures, (228-242)
- Hui P and Riely J Typing for a minimal aspect language Proceedings of the 6th workshop on Foundations of aspect-oriented languages, (15-22)
- Gooneratne N, Tari Z and Harland J Verification of web service descriptions using graph-based traversal algorithms Proceedings of the 2007 ACM symposium on Applied computing, (1385-1392)
- Lanese I Concurrent and Located Synchronizations in π-Calculus Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (388-399)
- Bugliesi M and Giunti M Secure implementations of typed channel abstractions Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (251-262)
- Bugliesi M and Giunti M (2007). Secure implementations of typed channel abstractions, ACM SIGPLAN Notices, 42:1, (251-262), Online publication date: 17-Jan-2007.
- Engelfriet J and Gelsema T (2007). An exercise in structural congruence, Information Processing Letters, 101:1, (1-5), Online publication date: 16-Jan-2007.
- Jones C Understanding programming language concepts via operational semantics Domain modeling and the duration calculus, (177-235)
- Acciai L and Boreale M Responsiveness in process calculi Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues, (136-150)
- Puhlmann F and Weske M Interaction soundness for service orchestrations Proceedings of the 4th international conference on Service-Oriented Computing, (302-313)
- Vasconcelos V, Gay S and Ravara A (2006). Type checking a multithreaded functional language with session types, Theoretical Computer Science, 368:1-2, (64-87), Online publication date: 1-Dec-2006.
- Aranda J, Di Giusto C, Palamidessi C and Valencia F On recursion, replication and scope mechanisms in process calculi Proceedings of the 5th international conference on Formal methods for components and objects, (185-206)
- Dezani-Ciancaglini M, Ghilezan S and Pantović J Security types for dynamic web data Proceedings of the 2nd international conference on Trustworthy global computing, (263-280)
- Ehrhard T and Regnier L (2006). Differential interaction nets, Theoretical Computer Science, 364:2, (166-195), Online publication date: 6-Nov-2006.
- Crafa S and Rossi S P-congruences as non-interference for the pi-calculus Proceedings of the fourth ACM workshop on Formal methods in security, (13-22)
- Prandi D A formal approach to molecular docking Proceedings of the 2006 international conference on Computational Methods in Systems Biology, (78-92)
- Zhang M, Li G and Fu Y Secrecy of signals by typing in signal transduction Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II, (384-393)
- Donnelly K and Fluet M Transactional events Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, (124-135)
- Donnelly K and Fluet M (2006). Transactional events, ACM SIGPLAN Notices, 41:9, (124-135), Online publication date: 16-Sep-2006.
- Decker G, Puhlmann F and Weske M Formalizing service interactions Proceedings of the 4th international conference on Business Process Management, (414-419)
- Puhlmann F and Weske M Investigations on soundness regarding lazy activities Proceedings of the 4th international conference on Business Process Management, (145-160)
- Nestmann U Welcome to the jungle Proceedings of the 17th international conference on Concurrency Theory, (52-63)
- Pous D Weak bisimulation up to elaboration Proceedings of the 17th international conference on Concurrency Theory, (390-405)
- Caires L and Lozes E (2006). Elimination of quantifiers and undecidability in spatial logics for concurrency, Theoretical Computer Science, 358:2, (293-314), Online publication date: 7-Aug-2006.
- Boreale M Quantifying information leakage in process calculi Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (119-131)
- Deng Y and Sangiorgi D (2006). Ensuring termination by typability, Information and Computation, 204:7, (1045-1082), Online publication date: 1-Jul-2006.
- Ciobanu G and Zakharov V Encoding mobile ambients into the π-calculus Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics, (148-165)
- Peschanski F and Hym S A stackless runtime environment for a Pi-calculus Proceedings of the 2nd international conference on Virtual execution environments, (57-67)
- Sangiorgi D The bisimulation proof method Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (18-19)
- Beffara E and Maurel F (2006). Concurrent nets, Theoretical Computer Science, 356:3, (356-373), Online publication date: 30-May-2006.
- Guan X (2006). Name-passing in an ambient-like calculus and its proof using spatial logic, Theoretical Computer Science, 356:3, (440-467), Online publication date: 30-May-2006.
- Solanki M, Cau A and Zedan H ASDL Proceedings of the 15th international conference on World Wide Web, (687-696)
- Li M, Yang Q, Zhai J and Yang G On mobility of software processes Proceedings of the 2006 international conference on Software Process Simulation and Modeling, (105-114)
- Xu K, Wang Y and Wu C Ensuring secure and robust grid applications – from a formal method point of view Proceedings of the First international conference on Advances in Grid and Pervasive Computing, (537-546)
- Pitts A (2006). Alpha-structural recursion and induction, Journal of the ACM, 53:3, (459-506), Online publication date: 1-May-2006.
- Mezzetti N and Sangiorgi D (2006). Towards a Calculus For Wireless Systems, Electronic Notes in Theoretical Computer Science (ENTCS), 158, (331-353), Online publication date: 1-May-2006.
- Groote J, Mousavi M and Reniers M (2006). A Hierarchy of SOS Rule Formats, Electronic Notes in Theoretical Computer Science (ENTCS), 156:1, (3-25), Online publication date: 1-May-2006.
- Miller D and Saurin A (2006). A Game Semantics for Proof Search, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (543-563), Online publication date: 1-May-2006.
- Beffara E (2006). A Concurrent Model for Linear Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (147-168), Online publication date: 1-May-2006.
- Jones C (2006). An Approach to Splitting Atoms Safely, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (43-60), Online publication date: 1-May-2006.
- Ziegler A, Miller D and Palamidessi C (2006). A Congruence Format for Name-passing Calculi, Electronic Notes in Theoretical Computer Science (ENTCS), 156:1, (169-189), Online publication date: 1-May-2006.
- Braghin C, Gorla D and Sassone V (2006). Role-based access control for a distributed calculus, Journal of Computer Security, 14:2, (113-155), Online publication date: 20-Apr-2006.
- Lu Y, Zhang L, Liu Y and Sun J Using π-calculus to formalize domain administration of RBAC Proceedings of the Second international conference on Information Security Practice and Experience, (278-289)
- Cao Z More on bisimulations for higher order π-calculus Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (63-78)
- Zhu Z (2006). Similarity between preferential models, Theoretical Computer Science, 353:1, (26-52), Online publication date: 14-Mar-2006.
- Merro M and Hennessy M (2006). A bisimulation-based semantic theory of Safe Ambients, ACM Transactions on Programming Languages and Systems, 28:2, (290-330), Online publication date: 1-Mar-2006.
- Bidinger P, Leclercq M, Quéma V, Schmitt A and Stefani J (2005). Dream types, ACM SIGSOFT Software Engineering Notes, 31:2, (2-es), Online publication date: 1-Mar-2006.
- Deng Y and Sangiorgi D (2006). Towards an algebraic theory of typed mobile processes, Theoretical Computer Science, 350:2, (188-212), Online publication date: 7-Feb-2006.
- Phillips A, Cardelli L and Castagna G A graphical representation for biological processes in the stochastic pi-calculus Transactions on Computational Systems Biology VII, (123-152)
- Chen J and Yang Y Key research issues in grid workflow verification and validation Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54, (97-104)
- Oquendo F (2006). Formally modelling software architectures with the UML 2.0 profile for π-ADL, ACM SIGSOFT Software Engineering Notes, 31:1, (1-13), Online publication date: 1-Jan-2006.
- Chen T, Han T and Lu J On the bisimulation congruence in χ-calculus Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science, (128-139)
- Liu F, Yu Z and Cai Y Modeling and analysis of multi-agent systems based on π-calculus Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I, (410-415)
- Merro M and Nardelli F (2005). Behavioral theory for mobile ambients, Journal of the ACM, 52:6, (961-1023), Online publication date: 1-Nov-2005.
- Vigliotti M, Phillips I and Palamidessi C Separation results via leader election problems Proceedings of the 4th international conference on Formal Methods for Components and Objects, (172-194)
- Sangiorgi D Beyond bisimulation Proceedings of the 4th international conference on Formal Methods for Components and Objects, (161-171)
- da Silva P and de Melo A An ontology for mobile agents in the context of formal verification Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II, (1500-1516)
- Ciaffaglione A, Hennessy M and Rathke J Proof methodologies for behavioural equivalence in DPI Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (335-350)
- Gardner P and Maffeis S (2005). Modelling dynamic web data, Theoretical Computer Science, 342:1, (104-131), Online publication date: 6-Sep-2005.
- Bidinger P, Leclercq M, Quéma V, Schmitt A and Stefani J Dream types Proceedings of the 2005 conference on Specification and verification of component-based systems, (2-es)
- Puhlmann F and Weske M Using the π-calculus for formalizing workflow patterns Proceedings of the 3rd international conference on Business Process Management, (153-168)
- Tiu A Model checking for π-calculus using proof search CONCUR 2005 - Concurrency Theory, (36-50)
- Garg D and Pfenning F Type-directed concurrency CONCUR 2005 - Concurrency Theory, (6-20)
- Yu Z, Cai Y, Wang R and Han J π-Net ADL Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II, (218-227)
- Pitts A Alpha-structural recursion and induction Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (17-34)
- Donaldson A and Gay S ETCH Proceedings of the 12th international conference on Model Checking Software, (266-271)
- Quaglia P and Walker D (2005). Types and full abstraction for polyadic π-calculus, Information and Computation, 200:2, (215-246), Online publication date: 1-Aug-2005.
- Gustavsson R and Fredriksson M (2005). Process algebras as support for sustainable systems of services, Applicable Algebra in Engineering, Communication and Computing, 16:2-3, (179-203), Online publication date: 1-Aug-2005.
- De Nicola R, Gorla D and Pugliese R Basic observables for a calculus for global computing Proceedings of the 32nd international conference on Automata, Languages and Programming, (1226-1238)
- Baldamus M, Parrow J and Victor B A fully abstract encoding of the π-calculus with data terms Proceedings of the 32nd international conference on Automata, Languages and Programming, (1202-1213)
- Bidinger P, Schmitt A and Stefani J An abstract machine for the kell calculus Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems, (31-46)
- Gruhn V and Schäfer C Architecture description for mobile distributed systems Proceedings of the 2nd European conference on Software Architecture, (239-246)
- Fu Y (2005). On quasi-open bisimulation, Theoretical Computer Science, 338:1-3, (96-126), Online publication date: 10-Jun-2005.
- Oquendo F Model-driven refinement of software architectures with π-ARL Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science, (1-7)
- Lanese I and Tuosto E Synchronized hyperedge replacement for heterogeneous systems Proceedings of the 7th international conference on Coordination Models and Languages, (220-235)
- Mazzara M and Govoni S A case study of web services orchestration Proceedings of the 7th international conference on Coordination Models and Languages, (1-16)
- Guan X (2005). Name-Passing in an Ambient-Like Calculus and Its Proof Using Spatial Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 128:2, (169-183), Online publication date: 14-Apr-2005.
- De Nicola R, Gorla D and Pugliese R (2005). On the Expressive Power of Klaim-based Calculi, Electronic Notes in Theoretical Computer Science (ENTCS), 128:2, (117-130), Online publication date: 14-Apr-2005.
- Meredith L and Radestock M Namespace logic Proceedings of the 1st international conference on Trustworthy global computing, (353-369)
- Crafa S and Rossi S A theory of noninterference for the π-calculus Proceedings of the 1st international conference on Trustworthy global computing, (2-18)
- Jeffrey A and Rathke J Java JR Proceedings of the 14th European conference on Programming Languages and Systems, (423-438)
- Ehrhard T and Regnier L (2005). Differential Interaction Nets, Electronic Notes in Theoretical Computer Science (ENTCS), 123:C, (35-74), Online publication date: 1-Mar-2005.
- Carayol A, Hirschkoff D and Sangiorgi D (2005). On the representation of McCarthy's amb in the π-calculus, Theoretical Computer Science, 330:3, (439-473), Online publication date: 9-Feb-2005.
- Gay S and Nagarajan R (2005). Communicating quantum processes, ACM SIGPLAN Notices, 40:1, (145-157), Online publication date: 12-Jan-2005.
- Gay S and Nagarajan R Communicating quantum processes Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (145-157)
- Gadducci F and Montanari U Observing reductions in nominal calculi via a graphical encoding of processes Processes, Terms and Cycles, (106-126)
- Priami C and Quaglia P Operational patterns in beta-binders Transactions on Computational Systems Biology I, (50-65)
- Ciocchetta F, Priami C and Quaglia P Modeling kohn interaction maps with beta-binders Transactions on Computational Systems Biology III, (33-48)
- Bodei C, Degano P and Priami C (2005). Checking security policies through an enhanced control flow analysis, Journal of Computer Security, 13:1, (49-85), Online publication date: 1-Jan-2005.
- Ghani N, Yemane K and Victor B (2004). Relationally Staged Computations in Calculi of Mobile Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 106:C, (105-120), Online publication date: 11-Dec-2004.
- Bruni R, Honsell F, Lenisa M and Miculan M (2004). Modeling Fresh Names in the π-calculus Using Abstractions, Electronic Notes in Theoretical Computer Science (ENTCS), 106:C, (25-41), Online publication date: 11-Dec-2004.
- Colaço J, Girault A, Hamon G and Pouzet M Towards a higher-order synchronous data-flow language Proceedings of the 4th ACM international conference on Embedded software, (230-239)
- Ábrahám E, Bonsangue M, de Boer F and Steffen M Object connectivity and full abstraction for a concurrent calculus of classes Proceedings of the First international conference on Theoretical Aspects of Computing, (37-51)
- Busi N and Zavattaro G (2004). On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, 322:3, (477-515), Online publication date: 6-Sep-2004.
- Oquendo F (2004). Formally refining software architectures with π-ARL, ACM SIGSOFT Software Engineering Notes, 29:5, (1-26), Online publication date: 1-Sep-2004.
- Oquendo F (2004). π-ARL, ACM SIGSOFT Software Engineering Notes, 29:5, (1-20), Online publication date: 1-Sep-2004.
- Wan F and Singh M Mapping Dooley Graphs and Commitment Causality to the "-Calculus Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, (412-419)
- Murakami M (2004). A model of runtime transformation for distributed systems based on directed acyclic graph model, Journal of Systems Architecture: the EUROMICRO Journal, 50:7, (417-425), Online publication date: 1-Jul-2004.
- Nygaard M and Winskel G (2004). Domain theory for concurrency, Theoretical Computer Science, 316:1-3, (153-190), Online publication date: 28-May-2004.
- Priami C and Quaglia P Beta binders for biological interactions Proceedings of the 20 international conference on Computational Methods in Systems Biology, (20-33)
- Oquendo F (2004). π-ADL, ACM SIGSOFT Software Engineering Notes, 29:3, (1-14), Online publication date: 1-May-2004.
- Schmitt A and Stefani J The Kell Calculus IST/FET International Workshop on Global Computing - Volume 3267, (146-178)
- Pokozy-Korenblat K, Priami C and Quaglia P Performance Analysis of a UML Micro-business Case Study IST/FET International Workshop on Global Computing - Volume 3267, (107-126)
- Liu X (2003). Evaluation of the capability of interaction, ACM SIGGROUP Bulletin, 24:3, (98-102), Online publication date: 1-Dec-2003.
- Ferrari G, Gnesi S, Montanari U and Pistore M (2003). A model-checking verification environment for mobile processes, ACM Transactions on Software Engineering and Methodology, 12:4, (440-473), Online publication date: 1-Oct-2003.
- Pahl C and Casey M (2003). Ontology support for web service processes, ACM SIGSOFT Software Engineering Notes, 28:5, (208-216), Online publication date: 1-Sep-2003.
- Pahl C and Casey M Ontology support for web service processes Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (208-216)
- Rossberg A Generativity and dynamic opacity for abstract types Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, (241-252)
- Wang L and Chen K A typed theory for access control and information flow control in mobile systems Proceedings of the 8th Australasian conference on Information security and privacy, (154-165)
- Merro M and Nardelli F Bisimulation proof methods for mobile ambients Proceedings of the 30th international conference on Automata, languages and programming, (584-598)
- Busi N, Gabbrielli M and Zavattaro G Replication vs. recursive definitions in channel based calculi Proceedings of the 30th international conference on Automata, languages and programming, (133-144)
- Kobayashi N (2003). Time regions and effects for resource usage analysis, ACM SIGPLAN Notices, 38:3, (50-61), Online publication date: 18-Mar-2003.
- Kobayashi N Time regions and effects for resource usage analysis Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, (50-61)
- Jensen O and Milner R (2003). Bigraphs and transitions, ACM SIGPLAN Notices, 38:1, (38-49), Online publication date: 15-Jan-2003.
- Jensen O and Milner R Bigraphs and transitions Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (38-49)
- Levi F and Sangiorgi D (2003). Mobile safe ambients, ACM Transactions on Programming Languages and Systems, 25:1, (1-69), Online publication date: 1-Jan-2003.
- Palamidessi C Mobile calculi for distributed programming Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, (74-75)
- Zilio S Mobile processes Modeling and verification of parallel processes, (206-222)
Recommendations
π-ARL: an architecture refinement language for formally modelling the stepwise refinement of software architectures
A key aspect of the formal development of any software system is the specification and stepwise refinement of its architecture. In a stepwise refinement, a sequence of steps starting from an abstract specification of the architecture leads to a concrete,...
A Pi-calculus formalism for discrete event simulation
WSC '08: Proceedings of the 40th Conference on Winter SimulationThis paper presents PiDES, a formalism for discrete event simulation based on Pi-calculus. PiDES provides a rigorous semantics of behavior modeling and coordination for simulation federates. The capability of PiDES is demonstrated by translating a ...
Weakest Preconditions for Applied \pi-Calculus
ICCGI '07: Proceedings of the International Multi-Conference on Computing in the Global Information TechnologyIn this paper, we develop a logic for reasoning about applied \pi-calculus processes based on the concept of weakest precondition and Hoare's logic. We propose a set of weakest precondition (wp) rules for applied \pi-calculus and give the soundness ...