Joachim Parrow

According to our database1, Joachim Parrow
  • authored at least 71 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Weak Nominal Modal Logic.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

2016
General conditions for full abstraction.
Mathematical Structures in Computer Science, 2016

Psi-Calculi in Isabelle.
J. Autom. Reasoning, 2016

Editorial.
Formal Asp. Comput., 2016

The Largest Respectful Function.
Logical Methods in Computer Science, 2016

A Sorted Semantic Framework for Applied Process Calculi.
Logical Methods in Computer Science, 2016

Modal Logics for Nominal Transition Systems.
Archive of Formal Proofs, 2016

The Expressive Power of Monotonic Parallel Composition.
Proceedings of the Programming Languages and Systems, 2016

Bisimulation up-to techniques for psi-calculi.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
Broadcast psi-calculi with an application to wireless protocols.
Software and System Modeling, 2015

Motivation and Grade Gap Related to Gender in a Programming Course.
Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, 2015

Modal Logics for Nominal Transition Systems.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Higher-order psi-calculi.
Mathematical Structures in Computer Science, 2014

Priorities Without Priorities: Representing Preemption in Psi-Calculi.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, 2014

2013
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract).
Proceedings of the Trustworthy Global Computing - 8th International Symposium, 2013

2012
Computing strong and weak bisimulations for psi-calculi.
J. Log. Algebr. Program., 2012

2011
Psi-calculi: a framework for mobile processes with nominal data and logic
Logical Methods in Computer Science, 2011

Broadcast Psi-calculi with an Application to Wireless Protocols.
Proceedings of the Software Engineering and Formal Methods - 9th International Conference, 2011

2010
Weak Equivalences in Psi-Calculi.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
A Fully Abstract Symbolic Semantics for Psi-Calculi
Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

Formalising the pi-calculus using nominal logic
Logical Methods in Computer Science, 2009

Psi-calculi in Isabelle.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

Psi-calculi: Mobile Processes, Nominal Data, and Logic.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008
Expressiveness of Process Algebras.
Electr. Notes Theor. Comput. Sci., 2008

Extended pi-Calculi.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle.
Electr. Notes Theor. Comput. Sci., 2007

Formalising the pi-Calculus Using Nominal Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

2005
A Fully Abstract Encoding of the pi-Calculus with Data Terms.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Ad Hoc Routing Protocol Verification Through Broadcast Abstraction.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004
Spi Calculus Translated to ?--Calculus Preserving May-Tests.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Automatized Verification of Ad Hoc Routing Protocols.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

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

2000
Preface.
Inf. Comput., 2000

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

1998
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Concurrent Constraints in the Fusion Calculus.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

The Tau-Laws of Fusion.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Foreword.
Electr. Notes Theor. Comput. Sci., 1997

The Update Calculus (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
Designing a multiway synchronization protocol.
Computer Communications, 1996

Constraints as Processes.
Proceedings of the CONCUR '96, 1996

1995
Algebraic Theories for Name-Passing Calculi
Inf. Comput., August, 1995

Interaction Diagrams.
Nord. J. Comput., 1995

Guest Editors Foreword.
Nord. J. Comput., 1995

Concurrency without Homotopy.
Bulletin of the EATCS, 1995

1994
The Complete Axiomatization of Cs-congruence.
Proceedings of the STACS 94, 1994

1993
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
Inf. Comput., December, 1993

Structural and Behavioural Equivalences of Networks
Inf. Comput., November, 1993

The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems.
ACM Trans. Program. Lang. Syst., 1993

Modal Logics for Mobile Processes.
Theor. Comput. Sci., 1993

Algebraic Theories for Name-Passing Calculi.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Interaction Diagrams.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

1992
A Calculus of Mobile Processes, II
Inf. Comput., September, 1992

A Calculus of Mobile Processes, I
Inf. Comput., September, 1992

An Algebraic Verification of a Mobile Network.
Formal Asp. Comput., 1992

Multiway Synchrinizaton Verified with Coupled Simulation.
Proceedings of the CONCUR '92, 1992

1991
Modal Logics for Mobile Processes.
Proceedings of the CONCUR '91, 1991

1990
The expressive power of parallelism.
Future Generation Comp. Syst., 1990

Algebraic descriptions of mobile networks: An example.
Proceedings of the Protocol Specification, 1990

Structural and Behavioural Equivalences of Networks.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

An Implementation of a Translational Semantics for an Imperative Language.
Proceedings of the CONCUR '90, 1990

1989
Submodule Construction as Equation Solving in CCS.
Theor. Comput. Sci., 1989

Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.
Proceedings of the STACS 89, 1989

A Semantics Based Verification Tool for Finite State Systems.
Proceedings of the Protocol Specification, 1989

The Expressive Power of Simple Parallelism.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Implementing a Model Checking Algorithm by Adapting Existing Automated Tools.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

The Concurrency Workbench.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1987
Submodule Construction as Equation Solving CCS.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1984
Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic.
Proceedings of the Protocol Specification, 1984

1983
Caddie - An Interactive Design Environment
Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983

1982
An Integrated Approach to Protocol Design Research.
Proceedings of the Protocol Specification, 1982


  Loading...