|
Search the dblp DataBase
Joachim Parrow:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Rance Cleaveland, Joachim Parrow, Bernhard Steffen
The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. [Citation Graph (1, 0)][DBLP] ACM Trans. Program. Lang. Syst., 1993, v:15, n:1, pp:36-72 [Journal]
- Joachim Parrow, Björn Victor
The Update Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP] AMAST, 1997, pp:409-423 [Conf]
- Rance Cleaveland, Joachim Parrow, Bernhard Steffen
The Concurrency Workbench. [Citation Graph (0, 0)][DBLP] Automatic Verification Methods for Finite State Systems, 1989, pp:24-37 [Conf]
- Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow
Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. [Citation Graph (0, 0)][DBLP] Automatic Verification Methods for Finite State Systems, 1989, pp:179-188 [Conf]
- Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
An Implementation of a Translational Semantics for an Imperative Language. [Citation Graph (0, 0)][DBLP] CONCUR, 1990, pp:246-262 [Conf]
- Joachim Parrow, Peter Sjödin
Multiway Synchrinizaton Verified with Coupled Simulation. [Citation Graph (0, 0)][DBLP] CONCUR, 1992, pp:518-533 [Conf]
- Joachim Parrow, Björn Victor
The Tau-Laws of Fusion. [Citation Graph (0, 0)][DBLP] CONCUR, 1998, pp:99-114 [Conf]
- Robin Milner, Joachim Parrow, David Walker
Modal Logics for Mobile Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 1991, pp:45-60 [Conf]
- Björn Victor, Joachim Parrow
Constraints as Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 1996, pp:389-405 [Conf]
- Oskar Wibling, Joachim Parrow, Arnold Neville Pears
Automatized Verification of Ad Hoc Routing Protocols. [Citation Graph (0, 0)][DBLP] FORTE, 2004, pp:343-358 [Conf]
- Oskar Wibling, Joachim Parrow, Arnold Neville Pears
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. [Citation Graph (0, 0)][DBLP] FORTE, 2005, pp:128-142 [Conf]
- Joachim Parrow
Submodule Construction as Equation Solving CCS. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:103-123 [Conf]
- Michael Baldamus, Joachim Parrow, Björn Victor
A Fully Abstract Encoding of the pi-Calculus with Data Terms. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1202-1213 [Conf]
- Joachim Parrow
Structural and Behavioural Equivalences of Networks. [Citation Graph (0, 0)][DBLP] ICALP, 1990, pp:540-552 [Conf]
- Björn Victor, Joachim Parrow
Concurrent Constraints in the Fusion Calculus. [Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:455-469 [Conf]
- Björn Pehrson, Joachim Parrow
Caddie - An Interactive Design Environment [Citation Graph (0, 0)][DBLP] ISCA, 1983, pp:24-31 [Conf]
- Michael Baldamus, Joachim Parrow, Björn Victor
Spi Calculus Translated to ?--Calculus Preserving May-Tests. [Citation Graph (0, 0)][DBLP] LICS, 2004, pp:22-31 [Conf]
- Joachim Parrow, Björn Victor
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes [Citation Graph (0, 0)][DBLP] LICS, 1998, pp:176-185 [Conf]
- Joachim Parrow
The Expressive Power of Simple Parallelism. [Citation Graph (0, 0)][DBLP] PARLE (2), 1989, pp:389-405 [Conf]
- Rance Cleaveland, Joachim Parrow, Bernhard Steffen
A Semantics Based Verification Tool for Finite State Systems. [Citation Graph (0, 0)][DBLP] PSTV, 1989, pp:287-302 [Conf]
- Rune Gustavsson, Joachim Parrow, Björn Pehrson
An Integrated Approach to Protocol Design Research. [Citation Graph (0, 0)][DBLP] PSTV, 1982, pp:309-310 [Conf]
- Fredrik Orava, Joachim Parrow
Algebraic descriptions of mobile networks: An example. [Citation Graph (0, 0)][DBLP] PSTV, 1990, pp:275-291 [Conf]
- Joachim Parrow, Rune Gustavsson
Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic. [Citation Graph (0, 0)][DBLP] PSTV, 1984, pp:309-348 [Conf]
- Joachim Parrow
Interaction Diagrams. [Citation Graph (0, 0)][DBLP] REX School/Symposium, 1993, pp:477-508 [Conf]
- Joachim Parrow, Davide Sangiorgi
Algebraic Theories for Name-Passing Calculi. [Citation Graph (0, 0)][DBLP] REX School/Symposium, 1993, pp:509-529 [Conf]
- Bengt Jonsson, Joachim Parrow
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. [Citation Graph (0, 0)][DBLP] STACS, 1989, pp:421-433 [Conf]
- Joachim Parrow, Peter Sjödin
The Complete Axiomatization of Cs-congruence. [Citation Graph (0, 0)][DBLP] STACS, 1994, pp:557-568 [Conf]
- Cosimo Laneve, Joachim Parrow, Björn Victor
Solo Diagrams. [Citation Graph (0, 0)][DBLP] TACS, 2001, pp:127-144 [Conf]
- Joachim Parrow, Peter Sjödin
Designing a multiway synchronization protocol. [Citation Graph (0, 0)][DBLP] Computer Communications, 1996, v:19, n:14, pp:1151-1160 [Journal]
- Joachim Parrow
Concurrency without Homotopy. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1995, v:55, n:, pp:- [Journal]
- Catuscia Palamidessi, Joachim Parrow
Foreword. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
- Fredrik Orava, Joachim Parrow
An Algebraic Verification of a Mobile Network. [Citation Graph (0, 0)][DBLP] Formal Asp. Comput., 1992, v:4, n:6, pp:497-543 [Journal]
- Bengt Jonsson, Joachim Parrow
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs [Citation Graph (0, 0)][DBLP] Inf. Comput., 1993, v:107, n:2, pp:272-302 [Journal]
- Robin Milner, Joachim Parrow, David Walker
A Calculus of Mobile Processes, I [Citation Graph (0, 0)][DBLP] Inf. Comput., 1992, v:100, n:1, pp:1-40 [Journal]
- Robin Milner, Joachim Parrow, David Walker
A Calculus of Mobile Processes, II [Citation Graph (0, 0)][DBLP] Inf. Comput., 1992, v:100, n:1, pp:41-77 [Journal]
- Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
Preface. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2000, v:156, n:1-2, pp:1- [Journal]
- Joachim Parrow
Structural and Behavioural Equivalences of Networks [Citation Graph (0, 0)][DBLP] Inf. Comput., 1993, v:107, n:1, pp:58-90 [Journal]
- Joachim Parrow, Davide Sangiorgi
Algebraic Theories for Name-Passing Calculi [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:120, n:2, pp:174-197 [Journal]
- Bengt Jonsson, Joachim Parrow
Guest Editors Foreword. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1995, v:2, n:2, pp:87- [Journal]
- Joachim Parrow
Interaction Diagrams. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1995, v:2, n:4, pp:407-443 [Journal]
- Robin Milner, Joachim Parrow, David Walker
Modal Logics for Mobile Processes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:114, n:1, pp:149-171 [Journal]
- Joachim Parrow
Submodule Construction as Equation Solving in CCS. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1989, v:68, n:2, pp:175-202 [Journal]
- Jesper Bengtson, Joachim Parrow
Formalising the pi-Calculus Using Nominal Logic. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2007, pp:63-77 [Conf]
Trios in concert. [Citation Graph (, )][DBLP]
Extended pi-Calculi. [Citation Graph (, )][DBLP]
Psi-calculi: Mobile Processes, Nominal Data, and Logic. [Citation Graph (, )][DBLP]
Weak Equivalences in Psi-Calculi. [Citation Graph (, )][DBLP]
Psi-calculi in Isabelle. [Citation Graph (, )][DBLP]
Formalising the pi-calculus using nominal logic [Citation Graph (, )][DBLP]
A Fully Abstract Symbolic Semantics for Psi-Calculi [Citation Graph (, )][DBLP]
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. [Citation Graph (, )][DBLP]
Expressiveness of Process Algebras. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.285secs
|