| 2008 |
|---|
| 52 | EE | Magnus Johansson,
Joachim Parrow,
Björn Victor,
Jesper Bengtson:
Extended pi-Calculi.
ICALP (2) 2008: 87-98 |
| 51 | EE | Jesper Bengtson,
Joachim Parrow:
Formalising the pi-calculus using nominal logic
CoRR abs/0809.3960: (2008) |
| 50 | EE | Joachim Parrow:
Expressiveness of Process Algebras.
Electr. Notes Theor. Comput. Sci. 209: 173-186 (2008) |
| 2007 |
|---|
| 49 | EE | Jesper Bengtson,
Joachim Parrow:
Formalising the pi-Calculus Using Nominal Logic.
FoSSaCS 2007: 63-77 |
| 48 | EE | 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) |
| 2005 |
|---|
| 47 | EE | Oskar Wibling,
Joachim Parrow,
Arnold Neville Pears:
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction.
FORTE 2005: 128-142 |
| 46 | EE | Michael Baldamus,
Joachim Parrow,
Björn Victor:
A Fully Abstract Encoding of the pi-Calculus with Data Terms.
ICALP 2005: 1202-1213 |
| 2004 |
|---|
| 45 | EE | Oskar Wibling,
Joachim Parrow,
Arnold Neville Pears:
Automatized Verification of Ad Hoc Routing Protocols.
FORTE 2004: 343-358 |
| 44 | EE | Michael Baldamus,
Joachim Parrow,
Björn Victor:
Spi Calculus Translated to ?--Calculus Preserving May-Tests.
LICS 2004: 22-31 |
| 2003 |
|---|
| 43 | | Jos C. M. Baeten,
Jan Karel Lenstra,
Joachim Parrow,
Gerhard J. Woeginger:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings
Springer 2003 |
| 2001 |
|---|
| 42 | EE | Cosimo Laneve,
Joachim Parrow,
Björn Victor:
Solo Diagrams.
TACS 2001: 127-144 |
| 2000 |
|---|
| 41 | | Joachim Parrow:
Trios in concert.
Proof, Language, and Interaction 2000: 623-638 |
| 40 | | Catuscia Palamidessi,
Joachim Parrow,
Rob J. van Glabbeek:
Preface.
Inf. Comput. 156(1-2): 1 (2000) |
| 1998 |
|---|
| 39 | EE | Joachim Parrow,
Björn Victor:
The Tau-Laws of Fusion.
CONCUR 1998: 99-114 |
| 38 | EE | Björn Victor,
Joachim Parrow:
Concurrent Constraints in the Fusion Calculus.
ICALP 1998: 455-469 |
| 37 | | Joachim Parrow,
Björn Victor:
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS 1998: 176-185 |
| 1997 |
|---|
| 36 | | Joachim Parrow,
Björn Victor:
The Update Calculus (Extended Abstract).
AMAST 1997: 409-423 |
| 35 | EE | Catuscia Palamidessi,
Joachim Parrow:
Foreword.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 1996 |
|---|
| 34 | | Bengt Jonsson,
Joachim Parrow:
Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings
Springer 1996 |
| 33 | | Björn Victor,
Joachim Parrow:
Constraints as Processes.
CONCUR 1996: 389-405 |
| 32 | EE | Joachim Parrow,
Peter Sjödin:
Designing a multiway synchronization protocol.
Computer Communications 19(14): 1151-1160 (1996) |
| 1995 |
|---|
| 31 | | Joachim Parrow:
Concurrency without Homotopy.
Bulletin of the EATCS 55: (1995) |
| 30 | | Joachim Parrow,
Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi
Inf. Comput. 120(2): 174-197 (1995) |
| 29 | | Bengt Jonsson,
Joachim Parrow:
Guest Editors Foreword.
Nord. J. Comput. 2(2): 87 (1995) |
| 28 | | Joachim Parrow:
Interaction Diagrams.
Nord. J. Comput. 2(4): 407-443 (1995) |
| 1994 |
|---|
| 27 | | Bengt Jonsson,
Joachim Parrow:
CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings
Springer 1994 |
| 26 | | Joachim Parrow,
Peter Sjödin:
The Complete Axiomatization of Cs-congruence.
STACS 1994: 557-568 |
| 1993 |
|---|
| 25 | | Joachim Parrow:
Interaction Diagrams.
REX School/Symposium 1993: 477-508 |
| 24 | | Joachim Parrow,
Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi.
REX School/Symposium 1993: 509-529 |
| 23 | EE | 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) |
| 22 | | Joachim Parrow:
Structural and Behavioural Equivalences of Networks
Inf. Comput. 107(1): 58-90 (1993) |
| 21 | | Bengt Jonsson,
Joachim Parrow:
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
Inf. Comput. 107(2): 272-302 (1993) |
| 20 | | Robin Milner,
Joachim Parrow,
David Walker:
Modal Logics for Mobile Processes.
Theor. Comput. Sci. 114(1): 149-171 (1993) |
| 1992 |
|---|
| 19 | | Joachim Parrow,
Peter Sjödin:
Multiway Synchrinizaton Verified with Coupled Simulation.
CONCUR 1992: 518-533 |
| 18 | | Fredrik Orava,
Joachim Parrow:
An Algebraic Verification of a Mobile Network.
Formal Asp. Comput. 4(6): 497-543 (1992) |
| 17 | | Robin Milner,
Joachim Parrow,
David Walker:
A Calculus of Mobile Processes, I
Inf. Comput. 100(1): 1-40 (1992) |
| 16 | | Robin Milner,
Joachim Parrow,
David Walker:
A Calculus of Mobile Processes, II
Inf. Comput. 100(1): 41-77 (1992) |
| 1991 |
|---|
| 15 | | Bengt Jonsson,
Joachim Parrow,
Björn Pehrson:
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 |
| 14 | | Robin Milner,
Joachim Parrow,
David Walker:
Modal Logics for Mobile Processes.
CONCUR 1991: 45-60 |
| 1990 |
|---|
| 13 | | Lars-Åke Fredlund,
Bengt Jonsson,
Joachim Parrow:
An Implementation of a Translational Semantics for an Imperative Language.
CONCUR 1990: 246-262 |
| 12 | | Joachim Parrow:
Structural and Behavioural Equivalences of Networks.
ICALP 1990: 540-552 |
| 11 | | Fredrik Orava,
Joachim Parrow:
Algebraic descriptions of mobile networks: An example.
PSTV 1990: 275-291 |
| 1989 |
|---|
| 10 | | 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 |
| 9 | | Rance Cleaveland,
Joachim Parrow,
Bernhard Steffen:
The Concurrency Workbench.
Automatic Verification Methods for Finite State Systems 1989: 24-37 |
| 8 | | Joachim Parrow:
The Expressive Power of Simple Parallelism.
PARLE (2) 1989: 389-405 |
| 7 | | Rance Cleaveland,
Joachim Parrow,
Bernhard Steffen:
A Semantics Based Verification Tool for Finite State Systems.
PSTV 1989: 287-302 |
| 6 | | Bengt Jonsson,
Joachim Parrow:
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.
STACS 1989: 421-433 |
| 5 | | Joachim Parrow:
Submodule Construction as Equation Solving in CCS.
Theor. Comput. Sci. 68(2): 175-202 (1989) |
| 1987 |
|---|
| 4 | | Joachim Parrow:
Submodule Construction as Equation Solving CCS.
FSTTCS 1987: 103-123 |
| 1984 |
|---|
| 3 | | Joachim Parrow,
Rune Gustavsson:
Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic.
PSTV 1984: 309-348 |
| 1983 |
|---|
| 2 | | Björn Pehrson,
Joachim Parrow:
Caddie - An Interactive Design Environment
ISCA 1983: 24-31 |
| 1982 |
|---|
| 1 | | Rune Gustavsson,
Joachim Parrow,
Björn Pehrson:
An Integrated Approach to Protocol Design Research.
PSTV 1982: 309-310 |
