Joachim Parrow

Magnus Johansson, Björn Victor, Joachim Parrow: Computing strong and weak bisimulations for psi-calculi. J. Log. Algebr. Program. 81(3): 162-180 (2012)

Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1) (2011)

Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow: Broadcast Psi-calculi with an Application to Wireless Protocols. SEFM 2011: 74-89

Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor: Weak Equivalences in Psi-Calculi. LICS 2010: 322-331

Jesper Bengtson, Joachim Parrow: Formalising the pi-calculus using nominal logic. Logical Methods in Computer Science 5(2) (2009)

Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor: Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS 2009: 39-48

Jesper Bengtson, Joachim Parrow: Psi-calculi in Isabelle. TPHOLs 2009: 99-114

Magnus Johansson, Björn Victor, Joachim Parrow: A Fully Abstract Symbolic Semantics for Psi-Calculi. SOS 2009: 17-31

Joachim Parrow: Expressiveness of Process Algebras. Electr. Notes Theor. Comput. Sci. 209: 173-186 (2008)

Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson: Extended pi-Calculi. ICALP (2) 2008: 87-98

Jesper Bengtson, Joachim Parrow: A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. Electr. Notes Theor. Comput. Sci. 192(1): 61-75 (2007)

Jesper Bengtson, Joachim Parrow: Formalising the pi-Calculus Using Nominal Logic. FoSSaCS 2007: 63-77

Oskar Wibling, Joachim Parrow, Arnold Neville Pears: Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. FORTE 2005: 128-142

Michael Baldamus, Joachim Parrow, Björn Victor: A Fully Abstract Encoding of the pi-Calculus with Data Terms. ICALP 2005: 1202-1213

Oskar Wibling, Joachim Parrow, Arnold Neville Pears: Automatized Verification of Ad Hoc Routing Protocols. FORTE 2004: 343-358

Michael Baldamus, Joachim Parrow, Björn Victor: Spi Calculus Translated to ?--Calculus Preserving May-Tests. LICS 2004: 22-31

Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (Eds.): Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Lecture Notes in Computer Science 2719, Springer 2003, isbn 3-540-40493-7

Cosimo Laneve, Joachim Parrow, Björn Victor: Solo Diagrams. TACS 2001: 127-144

Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek: Preface. Inf. Comput. 156(1-2): 1 (2000)

Joachim Parrow: Trios in concert. Proof, Language, and Interaction 2000: 623-638

Joachim Parrow, Björn Victor: The Tau-Laws of Fusion. CONCUR 1998: 99-114

Björn Victor, Joachim Parrow: Concurrent Constraints in the Fusion Calculus. ICALP 1998: 455-469

Joachim Parrow, Björn Victor: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. LICS 1998: 176-185

Catuscia Palamidessi, Joachim Parrow: Foreword. Electr. Notes Theor. Comput. Sci. 7: 1-2 (1997)

Joachim Parrow, Björn Victor: The Update Calculus (Extended Abstract). AMAST 1997: 409-423

Joachim Parrow, Peter Sjödin: Designing a multiway synchronization protocol. Computer Communications 19(14): 1151-1160 (1996)

Björn Victor, Joachim Parrow: Constraints as Processes. CONCUR 1996: 389-405

Bengt Jonsson, Joachim Parrow (Eds.): Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings. Lecture Notes in Computer Science 1135, Springer 1996, isbn 3-540-61648-9

Joachim Parrow: Concurrency without Homotopy. Bulletin of the EATCS 55 (1995)

Joachim Parrow, Davide Sangiorgi: Algebraic Theories for Name-Passing Calculi. Inf. Comput. 120(2): 174-197 (1995)

Bengt Jonsson, Joachim Parrow: Guest Editors Foreword. Nord. J. Comput. 2(2): 87 (1995)

Joachim Parrow: Interaction Diagrams. Nord. J. Comput. 2(4): 407-443 (1995)

Joachim Parrow, Peter Sjödin: The Complete Axiomatization of Cs-congruence. STACS 1994: 557-568

Bengt Jonsson, Joachim Parrow (Eds.): CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings. Lecture Notes in Computer Science 836, Springer 1994, isbn 3-540-58329-7

Joachim Parrow: Structural and Behavioural Equivalences of Networks. Inf. Comput. 107(1): 58-90 (1993)

Bengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. Inf. Comput. 107(2): 272-302 (1993)

Robin Milner, Joachim Parrow, David Walker: Modal Logics for Mobile Processes. Theor. Comput. Sci. 114(1): 149-171 (1993)

Rance Cleaveland, Joachim Parrow, Bernhard Steffen: The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Trans. Program. Lang. Syst. 15(1): 36-72 (1993)

Joachim Parrow: Interaction Diagrams. REX School/Symposium 1993: 477-508

Joachim Parrow, Davide Sangiorgi: Algebraic Theories for Name-Passing Calculi. REX School/Symposium 1993: 509-529

Fredrik Orava, Joachim Parrow: An Algebraic Verification of a Mobile Network. Formal Asp. Comput. 4(6): 497-543 (1992)

Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, I. Inf. Comput. 100(1): 1-40 (1992)

Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, II. Inf. Comput. 100(1): 41-77 (1992)

Joachim Parrow, Peter Sjödin: Multiway Synchrinizaton Verified with Coupled Simulation. CONCUR 1992: 518-533

Robin Milner, Joachim Parrow, David Walker: Modal Logics for Mobile Processes. CONCUR 1991: 45-60

Bengt Jonsson, Joachim Parrow, Björn Pehrson (Eds.): Protocol Specification, Testing and Verification XI, Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, 18-20 June 1991. North-Holland 1991, isbn 0-444-89210-9

Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow: An Implementation of a Translational Semantics for an Imperative Language. CONCUR 1990: 246-262

Joachim Parrow: Structural and Behavioural Equivalences of Networks. ICALP 1990: 540-552

Fredrik Orava, Joachim Parrow: Algebraic descriptions of mobile networks: An example. PSTV 1990: 275-291

Joachim Parrow: Submodule Construction as Equation Solving in CCS. Theor. Comput. Sci. 68(2): 175-202 (1989)

Rance Cleaveland, Joachim Parrow, Bernhard Steffen: The Concurrency Workbench. Automatic Verification Methods for Finite State Systems 1989: 24-37

Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow: Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. Automatic Verification Methods for Finite State Systems 1989: 179-188

Joachim Parrow: The Expressive Power of Simple Parallelism. PARLE (2) 1989: 389-405

Rance Cleaveland, Joachim Parrow, Bernhard Steffen: A Semantics Based Verification Tool for Finite State Systems. PSTV 1989: 287-302

Bengt Jonsson, Joachim Parrow: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS 1989: 421-433

Joachim Parrow: Submodule Construction as Equation Solving CCS. FSTTCS 1987: 103-123

Joachim Parrow, Rune Gustavsson: Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic. PSTV 1984: 309-348

Björn Pehrson, Joachim Parrow: Caddie - An Interactive Design Environment. ISCA 1983: 24-31

Rune Gustavsson, Joachim Parrow, Björn Pehrson: An Integrated Approach to Protocol Design Research. PSTV 1982: 309-310