Joachim Parrow
Professor at Department of Information Technology; Division of Computing Science
- Mobile phone:
- +46 70 573 33 24
- E-mail:
- Joachim.Parrow@it.uu.se
- Visiting address:
- Hus 10, Regementsvägen 10
- Postal address:
- Box 337
751 05 UPPSALA
Short presentation
Professor emeritus in Computing Science
RETIRED
For more information see http://user.it.uu.se/~joachim/
Biography
Born 25 Dec. 1956; Swedish Citizen, Married, three children. BSc in Computer Science, Uppsala University 1980; PhD in Computer Science, Uppsala University 1986 (Thesis title: Fairness properties in process algebra), Docent 1990.
Retired since 1 January 2026.
From May 2010 Joachim Parrow was professor in Computing Systems (Datalogi) at the department of Information Technology at Uppsala University, and 2017-2023 he was Dean of Mathematics and Computer Science. 2001--2010 he was professor of Computer Systems at the same department. 2005--2008 he was member of the faculty board and Dean of Education, and 2002--2005 he was Head of Education.
During 1994-2001 he was professor in Distributed Systems at the Royal Institute of Technology (KTH), Stockholm. There he was a member of Centrala Tjänsteförslagsnämnden, the committee for promotions of lecturers to professors. From April 1997 until October 2000 he was Prefekt (Head of Department), and 1997-1999 a member of the Scientific Council of the School of Electrical Engineering and Information Technology at KTH.
During 1986-1994 he was employed as a researcher at the Swedish Institute of Computer Science, leading the research group on Formal Design Techniques.
During 1986-1989 he spent in all 18 months at the University of Edinburgh, working with Robin Milner.
Research
Joachim Parrow works in the general area of formal methods for concurrent and distributed systems, mainly process algebraic formalisms and related logics and their applications in automated tools for formal verification. He began the development of the Concurrency Workbench (an automated verification tool for CCS) in 1986, and collaborated with Robin Milner and David Walker in developing the pi-calculus (a calculus of mobile processes) 1987-1989. Recent research has focused on developing and applying the pi-calculus, notably in the Psi- calculi and in formalising calculi in the theorem prover Isabelle, and on nominal modal logics for a general kind of transition systems.

Publications
Recent publications
-
Modal Logics for Nominal Transition Systems
Part of Logical Methods in Computer Science, 2021
- DOI for Modal Logics for Nominal Transition Systems
- Download full text 1 (pdf) of Modal Logics for Nominal Transition Systems
- Download full text 2 (pdf) of Modal Logics for Nominal Transition Systems
-
Part of Formal Techniques for Distributed Objects, Components, and Systems, p. 179-193, 2017
-
A Sorted Semantic Framework for Applied Process Calculi
Part of Logical Methods in Computer Science, p. 1-49, 2016
- DOI for A Sorted Semantic Framework for Applied Process Calculi
- Download full text (pdf) of A Sorted Semantic Framework for Applied Process Calculi
-
The largest respectful function
Part of Logical Methods in Computer Science, 2016
-
Modal Logics for Nominal Transition Systems
Part of Archive of Formal Proofs, 2016
All publications
Articles in journal
-
Modal Logics for Nominal Transition Systems
Part of Logical Methods in Computer Science, 2021
- DOI for Modal Logics for Nominal Transition Systems
- Download full text 1 (pdf) of Modal Logics for Nominal Transition Systems
- Download full text 2 (pdf) of Modal Logics for Nominal Transition Systems
-
A Sorted Semantic Framework for Applied Process Calculi
Part of Logical Methods in Computer Science, p. 1-49, 2016
- DOI for A Sorted Semantic Framework for Applied Process Calculi
- Download full text (pdf) of A Sorted Semantic Framework for Applied Process Calculi
-
The largest respectful function
Part of Logical Methods in Computer Science, 2016
-
Modal Logics for Nominal Transition Systems
Part of Archive of Formal Proofs, 2016
-
Extended versions of papers presented at WS-FM 2014 and Beat 2014
Part of Formal Aspects of Computing, p. 529-530, 2016
-
General conditions for full abstraction
Part of Mathematical Structures in Computer Science, p. 655-657, 2016
-
Part of Journal of automated reasoning, p. 1-47, 2016
-
Broadcast psi-calculi with an application to wireless protocols
Part of Software and Systems Modeling, p. 201-216, 2015
- DOI for Broadcast psi-calculi with an application to wireless protocols
- Download full text (pdf) of Broadcast psi-calculi with an application to wireless protocols
-
Part of Mathematical Structures in Computer Science, 2014
-
Computing Strong and Weak Bisimulations for Psi-Calculi
Part of Journal of Logic and Algebraic Programming, p. 162-180, 2012
-
Psi-calculi: a framework for mobile processes with nominal data and logic
Part of Logical Methods in Computer Science, p. 11, 2011
-
Formalising the π-calculus using nominal logic
Part of Logical Methods in Computer Science, 2009
- DOI for Formalising the π-calculus using nominal logic
- Download full text (pdf) of Formalising the π-calculus using nominal logic
-
Expressiveness of Process Algebras
Part of Electronic Notes in Theoretical Computer Science, p. 173-186, 2008
-
A completeness proof for bisimulation in the pi-calculus using Isabelle
Part of Electronic Notes in Theoretical Computer Science, p. 61-75, 2007
-
Part of Forskning och Framsteg, p. 14-19, 1998
-
Designing a Multiway Synchronisation Protocol
Part of Computer Communications, p. 1151-1160, 1996
-
Part of Nordic Journal of Computing, p. 407-443, 1995
-
Algebraic Theories of Name-Passing Calculi
Part of Information and Computation, p. 174-197, 1995
-
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
Part of Information and Computation, p. 272-302, 1993
-
Modal Logics for Mobile Processes
Part of Theoretical Computer Science, p. 149-171, 1993
-
The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems
Part of ACM Transactions on Programming Languages and Systems, p. 36-72, 1993
-
Structural and Behavioural Equivalences of Networks
Part of Information and Computation, p. 58-90, 1993
-
An Algebraic Verification of a Mobile Network
Part of Formal Aspects of Computing, p. 497-543, 1992
-
A Calculus of Mobile Processes - Part I
Part of Information and Computation, p. 1-40, 1992
-
A Calculus of Mobile Processes - Part II
Part of Information and Computation, p. 41-77, 1992
-
The Expressive Power of Parallelism
Part of Future Generation Computer Systems, p. 271-285, 1990
-
Submodule Construction as Equation Solving in CCS
Part of Theoretical Computer Science, p. 175-202, 1989
Chapters in book
-
An introduction to the pi-calculus
Part of Handbook of Pocess Algebra, p. 479-543, Elsevier, 2001
-
Part of Proof, Language and Interaction, Essays in Honor of Robin Milner, p. 621-637, MIT Press, 2000
Conference papers
-
Part of Formal Techniques for Distributed Objects, Components, and Systems, p. 179-193, 2017
-
Bisimulation up-to techniques for psi-calculi
Part of Proc. 5th ACM SIGPLAN Conference on Certified Programs and Proofs, p. 142-153, 2016
-
The Expressive Power of Monotonic Parallel Composition
Part of Programming Languages and Systems, p. 780-803, 2016
-
Motivation and Grade Gap Related to Gender in a Programming Course
2015
-
Modal Logics for Nominal Transition Systems
Part of 26th International Conference on Concurrency Theory, p. 198-211, 2015
-
A Sorted Semantic Framework for Applied Process Calculi (extended abstract)
Part of Trustworthy Global Computing, p. 103-118, 2014
-
Priorities Without Priorities: Representing Preemption in Psi-Calculi
Part of Proc. 21st International Workshop on Expressiveness in Concurrency, and 11th Workshop on Structural Operational Semantics, p. 2-15, 2014
-
Broadcast Psi-calculi with an Application to Wireless Protocols
Part of Software Engineering and Formal Methods, p. 74-89, 2011
- DOI for Broadcast Psi-calculi with an Application to Wireless Protocols
- Download full text (pdf) of Broadcast Psi-calculi with an Application to Wireless Protocols
-
A Fully Abstract Symbolic Semantics for Psi-Calculi
Part of Proc. 6th Workshop on Structural Operational Semantics, p. 17-31, 2010
-
Weak Equivalences in Psi-calculi
Part of Proc. 25th Symposium on Logic in Computer Science, p. 322-331, 2010
-
Psi-calculi: Mobile processes, nominal data, and logic
Part of Proc. 24th Annual IEEE Symposium on Logic in Computer Science, p. 39-48, 2009
-
Part of Theorem Proving in Higher Order Logics, p. 99-114, 2009
-
Part of Automata, Languages and Programming, PT 2, p. 87-98, 2008
-
Formalising the pi-calculus using nominal logic
Part of FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, p. 63-77, 2007
-
A Fully Abstract Encoding of the pi-Calculus with Data Terms
Part of Proceedings of ICALP 2005, p. 1202-1213, 2005
-
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction
Part of Formal Techniques for Networked and Distributed Systems – FORTE 2005, p. 128-142, 2005
-
Automatized Verification of Ad Hoc Routing Protocols
Part of Formal Techniques for Networked and Distributed Systems – FORTE 2004, p. 343-358, 2004
-
Spi Calculus Translated to pi-Calculus Preserving May-Tests
Part of Proceedings of LICS 2004, p. 22-31, 2004
-
Part of Proceedings of TACS 2001, p. 127-144, 2001
-
Concurrent Constraints in the Fusion Calculus
Part of Proceedings of ICALP'98, p. 455-469, 1998
-
Part of Proceedings of CONCUR'98, p. 99-114, 1998
-
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
Part of Proceedings of LICS'98, p. 176-185, 1998
-
Part of Proceedings of AMAST'97, p. 409-423, 1997
-
Part of Proceedings of CONCUR'96, p. 389-405, 1996
-
The Complete Axiomatization of Cs-Congruence
Part of Proceedings of STACS 94, p. 557-568, 1994
-
Multiway Synchronization Verified with Coupled Simulation
Part of Proceedings of CONCUR '92, p. 518-533, 1992