Joachim Parrow

According to our database, Joachim Parrow authored at least 64 papers between 1982 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2021

Modal Logics for Nominal Transition Systems.

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber

Log. Methods Comput. Sci., 2021

2017

Weak Nominal Modal Logic.

Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

2016

General conditions for full abstraction.

Joachim Parrow

Math. Struct. Comput. Sci., 2016

Psi-Calculi in Isabelle.

Jesper Bengtson, Joachim Parrow, Tjark Weber

J. Autom. Reason., 2016

Editorial.

Marco Carbone, Thomas T. Hildebrandt, Joachim Parrow, Matthias Weidlich

Formal Aspects Comput., 2016

The Largest Respectful Function.

Joachim Parrow, Tjark Weber

Log. Methods Comput. Sci., 2016

A Sorted Semantic Framework for Applied Process Calculi.

Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola

Log. Methods Comput. Sci., 2016

The Expressive Power of Monotonic Parallel Composition.

Johannes Åman Pohjola, Joachim Parrow

Proceedings of the Programming Languages and Systems, 2016

Bisimulation up-to techniques for psi-calculi.

Johannes Åman Pohjola, Joachim Parrow

Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015

Broadcast psi-calculi with an application to wireless protocols.

Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow

Softw. Syst. Model., 2015

Motivation and Grade Gap Related to Gender in a Programming Course.

Virginia Grande, Joachim Parrow

Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, 2015

2014

Higher-order psi-calculi.

Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola

Math. Struct. Comput. Sci., 2014

Priorities Without Priorities: Representing Preemption in Psi-Calculi.

Johannes Åman Pohjola, Joachim Parrow

Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

2013

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).

Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola

Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

2012

Computing strong and weak bisimulations for psi-calculi.

Magnus Johansson, Björn Victor, Joachim Parrow

J. Log. Algebraic Methods Program., 2012

2011

Psi-calculi: a framework for mobile processes with nominal data and logic

Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor

Log. Methods Comput. Sci., 2011

2010

Weak Equivalences in Psi-Calculi.

Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

A Fully Abstract Symbolic Semantics for Psi-Calculi

Magnus Johansson, Björn Victor, Joachim Parrow

Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

Formalising the pi-calculus using nominal logic

Jesper Bengtson, Joachim Parrow

Log. Methods Comput. Sci., 2009

Psi-calculi in Isabelle.

Jesper Bengtson, Joachim Parrow

Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

Psi-calculi: Mobile Processes, Nominal Data, and Logic.

Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

Extended pi-Calculi.

Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle.

Jesper Bengtson, Joachim Parrow

Proceedings of the Fourth Workshop on Structural Operational Semantics, 2007

Formalising the <i>pi</i>-Calculus Using Nominal Logic.

Jesper Bengtson, Joachim Parrow

Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006

Expressiveness of Process Algebras.

Joachim Parrow

Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

2005

A Fully Abstract Encoding of the <i>pi</i>-Calculus with Data Terms.

Michael Baldamus, Joachim Parrow, Björn Victor

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Ad Hoc Routing Protocol Verification Through Broadcast Abstraction.

Oskar Wibling, Joachim Parrow, Arnold Neville Pears

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004

Spi Calculus Translated to ?--Calculus Preserving May-Tests.

Michael Baldamus, Joachim Parrow, Björn Victor

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Automatized Verification of Ad Hoc Routing Protocols.

Oskar Wibling, Joachim Parrow, Arnold Neville Pears

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

2001

Solo Diagrams.

Cosimo Laneve, Joachim Parrow, Björn Victor

Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

An Introduction to the π-Calculus.

Joachim Parrow

Proceedings of the Handbook of Process Algebra, 2001

2000

Preface.

Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek

Inf. Comput., 2000

Trios in concert.

Joachim Parrow

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1998

The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes

Joachim Parrow, Björn Victor

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Concurrent Constraints in the Fusion Calculus.

Björn Victor, Joachim Parrow

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

The Tau-Laws of Fusion.

Joachim Parrow, Björn Victor

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

Foreword.

Catuscia Palamidessi, Joachim Parrow

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

The Update Calculus (Extended Abstract).

Joachim Parrow, Björn Victor

Proceedings of the Algebraic Methodology and Software Technology, 1997

1996

Designing a multiway synchronization protocol.

Joachim Parrow, Peter Sjödin

Comput. Commun., 1996

Constraints as Processes.

Björn Victor, Joachim Parrow

Proceedings of the CONCUR '96, 1996

1995

Algebraic Theories for Name-Passing Calculi

Joachim Parrow, Davide Sangiorgi

Inf. Comput., August, 1995

Interaction Diagrams.

Joachim Parrow

Nord. J. Comput., 1995

Guest Editors Foreword.

Bengt Jonsson, Joachim Parrow

Nord. J. Comput., 1995

Concurrency without Homotopy.

Joachim Parrow

Bull. EATCS, 1995

1994

The Complete Axiomatization of Cs-congruence.

Joachim Parrow, Peter Sjödin

Proceedings of the STACS 94, 1994

1993

Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs

Bengt Jonsson, Joachim Parrow

Inf. Comput., December, 1993

Structural and Behavioural Equivalences of Networks

Joachim Parrow

Inf. Comput., November, 1993

The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems.

Rance Cleaveland, Joachim Parrow, Bernhard Steffen

ACM Trans. Program. Lang. Syst., 1993

Modal Logics for Mobile Processes.

Robin Milner, Joachim Parrow, David Walker

Theor. Comput. Sci., 1993

1992

A Calculus of Mobile Processes, II

Robin Milner, Joachim Parrow, David Walker

Inf. Comput., September, 1992

A Calculus of Mobile Processes, I

Robin Milner, Joachim Parrow, David Walker

Inf. Comput., September, 1992

An Algebraic Verification of a Mobile Network.

Fredrik Orava, Joachim Parrow

Formal Aspects Comput., 1992

Multiway Synchronization Verified with Coupled Simulation.

Joachim Parrow, Peter Sjödin

Proceedings of the CONCUR '92, 1992

1990

The expressive power of parallelism.

Joachim Parrow

Future Gener. Comput. Syst., 1990

Algebraic descriptions of mobile networks: An example.

Fredrik Orava, Joachim Parrow

Proceedings of the Protocol Specification, 1990

An Implementation of a Translational Semantics for an Imperative Language.

Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow

Proceedings of the CONCUR '90, 1990

1989

Submodule Construction as Equation Solving in CCS.

Joachim Parrow

Theor. Comput. Sci., 1989

A Semantics Based Verification Tool for Finite State Systems.

Rance Cleaveland, Joachim Parrow, Bernhard Steffen

Proceedings of the Protocol Specification, 1989

The Expressive Power of Simple Parallelism.

Joachim Parrow

Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Implementing a Model Checking Algorithm by Adapting Existing Automated Tools.

Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

The Concurrency Workbench.

Rance Cleaveland, Joachim Parrow, Bernhard Steffen

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1984

Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic.

Joachim Parrow, Rune Gustavsson

Proceedings of the Protocol Specification, 1984

1983

Caddie - An Interactive Design Environment

Björn Pehrson, Joachim Parrow

Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983

1982

An Integrated Approach to Protocol Design Research.

Rune Gustavsson, Joachim Parrow, Björn Pehrson

Proceedings of the Protocol Specification, 1982