The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joachim Parrow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Joachim Parrow, Björn Victor
    The Update Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AMAST, 1997, pp:409-423 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. Joachim Parrow, Peter Sjödin
    Multiway Synchrinizaton Verified with Coupled Simulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:518-533 [Conf]
  7. Joachim Parrow, Björn Victor
    The Tau-Laws of Fusion. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:99-114 [Conf]
  8. Robin Milner, Joachim Parrow, David Walker
    Modal Logics for Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:45-60 [Conf]
  9. Björn Victor, Joachim Parrow
    Constraints as Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:389-405 [Conf]
  10. 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]
  11. 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]
  12. Joachim Parrow
    Submodule Construction as Equation Solving CCS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:103-123 [Conf]
  13. 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]
  14. Joachim Parrow
    Structural and Behavioural Equivalences of Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:540-552 [Conf]
  15. Björn Victor, Joachim Parrow
    Concurrent Constraints in the Fusion Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:455-469 [Conf]
  16. Björn Pehrson, Joachim Parrow
    Caddie - An Interactive Design Environment [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:24-31 [Conf]
  17. 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]
  18. 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]
  19. Joachim Parrow
    The Expressive Power of Simple Parallelism. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1989, pp:389-405 [Conf]
  20. 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]
  21. 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]
  22. Fredrik Orava, Joachim Parrow
    Algebraic descriptions of mobile networks: An example. [Citation Graph (0, 0)][DBLP]
    PSTV, 1990, pp:275-291 [Conf]
  23. 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]
  24. Joachim Parrow
    Interaction Diagrams. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:477-508 [Conf]
  25. Joachim Parrow, Davide Sangiorgi
    Algebraic Theories for Name-Passing Calculi. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:509-529 [Conf]
  26. 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]
  27. Joachim Parrow, Peter Sjödin
    The Complete Axiomatization of Cs-congruence. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:557-568 [Conf]
  28. Cosimo Laneve, Joachim Parrow, Björn Victor
    Solo Diagrams. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:127-144 [Conf]
  29. 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]
  30. Joachim Parrow
    Concurrency without Homotopy. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:55, n:, pp:- [Journal]
  31. Catuscia Palamidessi, Joachim Parrow
    Foreword. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. Joachim Parrow
    Structural and Behavioural Equivalences of Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:1, pp:58-90 [Journal]
  38. 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]
  39. Bengt Jonsson, Joachim Parrow
    Guest Editors Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:2, pp:87- [Journal]
  40. Joachim Parrow
    Interaction Diagrams. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:4, pp:407-443 [Journal]
  41. 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]
  42. 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]
  43. Jesper Bengtson, Joachim Parrow
    Formalising the pi-Calculus Using Nominal Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:63-77 [Conf]

  44. Trios in concert. [Citation Graph (, )][DBLP]


  45. Extended pi-Calculi. [Citation Graph (, )][DBLP]


  46. Psi-calculi: Mobile Processes, Nominal Data, and Logic. [Citation Graph (, )][DBLP]


  47. Weak Equivalences in Psi-Calculi. [Citation Graph (, )][DBLP]


  48. Psi-calculi in Isabelle. [Citation Graph (, )][DBLP]


  49. Formalising the pi-calculus using nominal logic [Citation Graph (, )][DBLP]


  50. A Fully Abstract Symbolic Semantics for Psi-Calculi [Citation Graph (, )][DBLP]


  51. A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. [Citation Graph (, )][DBLP]


  52. Expressiveness of Process Algebras. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.045secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002