Joachim Parrow

Publication Activity (10 Years)

Years Active: 1982-2021
Publications (10 Years): 11

Top Topics

Transition Systems

Extended Abstract

Qualitative Spatial Reasoning

Top Venues

Log. Methods Comput. Sci.

Math. Struct. Comput. Sci.

J. Log. Algebraic Methods Program.

Publications

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
Modal Logics for Nominal Transition Systems. Log. Methods Comput. Sci. 17 (1) (2021)
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
Modal Logics for Nominal Transition Systems. CoRR (2019)
Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson
Weak Nominal Modal Logic. FORTE (2017)
Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
A Sorted Semantic Framework for Applied Process Calculi. Log. Methods Comput. Sci. 12 (1) (2016)
Marco Carbone, Thomas T. Hildebrandt, Joachim Parrow, Matthias Weidlich
Editorial. Formal Aspects Comput. 28 (4) (2016)
Johannes Åman Pohjola, Joachim Parrow
Bisimulation up-to techniques for psi-calculi. CPP (2016)
Joachim Parrow
General conditions for full abstraction. Math. Struct. Comput. Sci. 26 (4) (2016)
Jesper Bengtson, Joachim Parrow, Tjark Weber
Psi-Calculi in Isabelle. J. Autom. Reason. 56 (1) (2016)
Joachim Parrow, Tjark Weber
The Largest Respectful Function. Log. Methods Comput. Sci. 12 (2) (2016)
Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, Ramunas Gutkovas
Modal Logics for Nominal Transition Systems. Arch. Formal Proofs 2016 (2016)
Johannes Åman Pohjola, Joachim Parrow
The Expressive Power of Monotonic Parallel Composition. ESOP (2016)
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
Modal Logics for Nominal Transition Systems. CONCUR (2015)
Virginia Grande, Joachim Parrow
Motivation and Grade Gap Related to Gender in a Programming Course. ITiCSE (2015)
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. Softw. Syst. Model. 14 (1) (2015)
Johannes Åman Pohjola, Joachim Parrow
Priorities Without Priorities: Representing Preemption in Psi-Calculi. EXPRESS/SOS (2014)
Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola
Higher-order psi-calculi. Math. Struct. Comput. Sci. 24 (2) (2014)
Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). TGC (2013)
Magnus Johansson, Björn Victor, Joachim Parrow
Computing strong and weak bisimulations for psi-calculi. J. Log. Algebraic Methods Program. 81 (3) (2012)
Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor
Psi-calculi: a framework for mobile processes with nominal data and logic Log. Methods Comput. Sci. 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)
Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor
Weak Equivalences in Psi-Calculi. LICS (2010)
Jesper Bengtson, Joachim Parrow
Psi-calculi in Isabelle. TPHOLs (2009)
Magnus Johansson, Björn Victor, Joachim Parrow
A Fully Abstract Symbolic Semantics for Psi-Calculi SOS (2009)
Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor
Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS (2009)
Jesper Bengtson, Joachim Parrow
Formalising the pi-calculus using nominal logic Log. Methods Comput. Sci. 5 (2) (2009)
Joachim Parrow
Expressiveness of Process Algebras. Electron. Notes Theor. Comput. Sci. 209 (2008)
Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson
Extended pi-Calculi. ICALP (2) (2008)
Jesper Bengtson, Joachim Parrow
-Calculus Using Nominal Logic. FoSSaCS (2007)
Jesper Bengtson, Joachim Parrow
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. Electron. Notes Theor. Comput. Sci. 192 (1) (2007)
Oskar Wibling, Joachim Parrow, Arnold Neville Pears
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. FORTE (2005)
Michael Baldamus, Joachim Parrow, Björn Victor
-Calculus with Data Terms. ICALP (2005)
Oskar Wibling, Joachim Parrow, Arnold Neville Pears
Automatized Verification of Ad Hoc Routing Protocols. FORTE (2004)
Michael Baldamus, Joachim Parrow, Björn Victor
Spi Calculus Translated to ?--Calculus Preserving May-Tests. LICS (2004)
Cosimo Laneve, Joachim Parrow, Björn Victor
Solo Diagrams. TACS (2001)
Joachim Parrow
Trios in concert. Proof, Language, and Interaction (2000)
Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
Preface. Inf. Comput. 156 (1-2) (2000)
Joachim Parrow, Björn Victor
The Tau-Laws of Fusion. CONCUR (1998)
Joachim Parrow, Björn Victor
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes LICS (1998)
Björn Victor, Joachim Parrow
Concurrent Constraints in the Fusion Calculus. ICALP (1998)
Catuscia Palamidessi, Joachim Parrow
Foreword. EXPRESS (1997)
Joachim Parrow, Björn Victor
The Update Calculus (Extended Abstract). AMAST (1997)
Björn Victor, Joachim Parrow
Constraints as Processes. CONCUR (1996)
Joachim Parrow, Peter Sjödin
Designing a multiway synchronization protocol. Comput. Commun. 19 (14) (1996)
Joachim Parrow
Interaction Diagrams. Nord. J. Comput. 2 (4) (1995)
Joachim Parrow
Concurrency without Homotopy. Bull. EATCS 55 (1995)
Bengt Jonsson, Joachim Parrow
Guest Editors Foreword. Nord. J. Comput. 2 (2) (1995)
Joachim Parrow, Davide Sangiorgi
Algebraic Theories for Name-Passing Calculi Inf. Comput. 120 (2) (1995)
Joachim Parrow, Peter Sjödin
The Complete Axiomatization of Cs-congruence. STACS (1994)
Bengt Jonsson, Joachim Parrow
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs Inf. Comput. 107 (2) (1993)
Joachim Parrow
Interaction Diagrams. REX School/Symposium (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) (1993)
Joachim Parrow, Davide Sangiorgi
Algebraic Theories for Name-Passing Calculi. REX School/Symposium (1993)
Robin Milner, Joachim Parrow, David Walker
Modal Logics for Mobile Processes. Theor. Comput. Sci. 114 (1) (1993)
Joachim Parrow
Structural and Behavioural Equivalences of Networks Inf. Comput. 107 (1) (1993)
Robin Milner, Joachim Parrow, David Walker
A Calculus of Mobile Processes, I Inf. Comput. 100 (1) (1992)
Robin Milner, Joachim Parrow, David Walker
A Calculus of Mobile Processes, II Inf. Comput. 100 (1) (1992)
Fredrik Orava, Joachim Parrow
An Algebraic Verification of a Mobile Network. Formal Aspects Comput. 4 (6) (1992)
Joachim Parrow, Peter Sjödin
Multiway Synchronization Verified with Coupled Simulation. CONCUR (1992)
Robin Milner, Joachim Parrow, David Walker
Modal Logics for Mobile Processes. CONCUR (1991)
Joachim Parrow
Structural and Behavioural Equivalences of Networks. ICALP (1990)
Fredrik Orava, Joachim Parrow
Algebraic descriptions of mobile networks: An example. PSTV (1990)
Joachim Parrow
The expressive power of parallelism. Future Gener. Comput. Syst. 6 (3) (1990)
Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
An Implementation of a Translational Semantics for an Imperative Language. CONCUR (1990)
Joachim Parrow
The Expressive Power of Simple Parallelism. PARLE (2) (1989)
Bengt Jonsson, Joachim Parrow
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS (1989)
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)
Joachim Parrow
Submodule Construction as Equation Solving in CCS. Theor. Comput. Sci. 68 (2) (1989)
Rance Cleaveland, Joachim Parrow, Bernhard Steffen
The Concurrency Workbench. Automatic Verification Methods for Finite State Systems (1989)
Rance Cleaveland, Joachim Parrow, Bernhard Steffen
A Semantics Based Verification Tool for Finite State Systems. PSTV (1989)
Joachim Parrow
Submodule Construction as Equation Solving CCS. FSTTCS (1987)
Joachim Parrow, Rune Gustavsson
Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic. PSTV (1984)
Björn Pehrson, Joachim Parrow
Caddie - An Interactive Design Environment ISCA (1983)
Rune Gustavsson, Joachim Parrow, Björn Pehrson
An Integrated Approach to Protocol Design Research. PSTV (1982)