Joachim Parrow
Professor i datorteknik 01/ i datalogi 10 vid Institutionen för informationsteknologi; Datalogi
- Mobiltelefon:
- 070-573 33 24
- E-post:
- Joachim.Parrow@it.uu.se
- Besöksadress:
- Hus 10, Regementsvägen 10
- Postadress:
- Box 337
751 05 UPPSALA
Ladda ned kontaktuppgifter för Joachim Parrow vid Institutionen för informationsteknologi; Datalogi
- Akademiska meriter:
- TeknD / Docent
Kort presentation
Professor in Computing Science
Dean of Mathematics and Computer Science
For more information see http://user.it.uu.se/~joachim/
Biografi
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.
From May 2010 Joachim Parrow is professor in Computing Systems (Datalogi) at the department of Information Technology at Uppsala University, and from July 2017 he is 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 Department of Microelectronics and Information Technology 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.
Forskning
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.
Joachim Parrow is an ISI highly cited researcher (2001).

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