Joachim Parrow

79 papers A* 9A 3B 11C 3Journal 28Unranked 21

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Modal Logics for Nominal Transition Systems. Log. Methods Comput. Sci. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2019	J	`jnl`	Modal Logics for Nominal Transition Systems. CoRR Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2017	C	`conf`	Weak Nominal Modal Logic. FORTE Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson
2016	J	`jnl`	A Sorted Semantic Framework for Applied Process Calculi. Log. Methods Comput. Sci. Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2016	B	`conf`	Bisimulation up-to techniques for psi-calculi. CPP Johannes Åman Pohjola, Joachim Parrow
2016	J	`jnl`	Editorial. Formal Aspects Comput. Marco Carbone, Thomas T. Hildebrandt, Joachim Parrow, Matthias Weidlich
2016	J	`jnl`	General conditions for full abstraction. Math. Struct. Comput. Sci. Joachim Parrow
2016	J	`jnl`	Modal Logics for Nominal Transition Systems. Arch. Formal Proofs Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, Ramunas Gutkovas
2016	J	`jnl`	Psi-Calculi in Isabelle. J. Autom. Reason. Jesper Bengtson, Joachim Parrow, Tjark Weber
2016	A	`conf`	The Expressive Power of Monotonic Parallel Composition. ESOP Johannes Åman Pohjola, Joachim Parrow
2016	J	`jnl`	The Largest Respectful Function. Log. Methods Comput. Sci. Joachim Parrow, Tjark Weber
2015	J	`jnl`	Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2015	B	`conf`	Modal Logics for Nominal Transition Systems. CONCUR Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber
2015	B	`conf`	Motivation and Grade Gap Related to Gender in a Programming Course. ITiCSE Virginia Grande, Joachim Parrow
2014	J	`jnl`	Higher-order psi-calculi. Math. Struct. Comput. Sci. Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola
2014	—	`conf`	Priorities Without Priorities: Representing Preemption in Psi-Calculi. EXPRESS/SOS Johannes Åman Pohjola, Joachim Parrow
2013	—	`conf`	A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). TGC Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
2012	J	`jnl`	Computing strong and weak bisimulations for psi-calculi. J. Log. Algebraic Methods Program. Magnus Johansson, Björn Victor, Joachim Parrow
2011	B	`conf`	Broadcast Psi-calculi with an Application to Wireless Protocols. SEFM Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2011	J	`jnl`	Psi-calculi: a framework for mobile processes with nominal data and logic Log. Methods Comput. Sci. Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor
2010	A*	`conf`	Weak Equivalences in Psi-Calculi. LICS Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor
2009	—	`conf`	A Fully Abstract Symbolic Semantics for Psi-Calculi SOS Magnus Johansson, Björn Victor, Joachim Parrow
2009	J	`jnl`	Formalising the pi-calculus using nominal logic Log. Methods Comput. Sci. Jesper Bengtson, Joachim Parrow
2009	—	`conf`	Psi-calculi in Isabelle. TPHOLs Jesper Bengtson, Joachim Parrow
2009	A*	`conf`	Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor
2008	—	`conf`	Extended pi-Calculi. ICALP (2) Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson
2007	—	`conf`	A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. SOS@LICS/ICALP Jesper Bengtson, Joachim Parrow
2007	B	`conf`	Formalising the FoSSaCS Jesper Bengtson, Joachim Parrow
2006	—	`conf`	Expressiveness of Process Algebras. LIX Joachim Parrow
2005	A*	`conf`	A Fully Abstract Encoding of the ICALP Michael Baldamus, Joachim Parrow, Björn Victor
2005	C	`conf`	Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. FORTE Oskar Wibling, Joachim Parrow, Arnold Neville Pears
2004	C	`conf`	Automatized Verification of Ad Hoc Routing Protocols. FORTE Oskar Wibling, Joachim Parrow, Arnold Neville Pears
2004	A*	`conf`	Spi Calculus Translated to ?--Calculus Preserving May-Tests. LICS Michael Baldamus, Joachim Parrow, Björn Victor
2003	A*	`ed.`	Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings ICALP Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
2001	—	`ch.`	An Introduction to the π-Calculus. Handbook of Process Algebra Joachim Parrow
2001	—	`conf`	Solo Diagrams. TACS Cosimo Laneve, Joachim Parrow, Björn Victor
2000	J	`jnl`	Preface. Inf. Comput. Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek
2000	—	`conf`	Trios in concert. Proof, Language, and Interaction Joachim Parrow
1998	A*	`conf`	Concurrent Constraints in the Fusion Calculus. ICALP Björn Victor, Joachim Parrow
1998	A*	`conf`	The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes LICS Joachim Parrow, Björn Victor
1998	B	`conf`	The Tau-Laws of Fusion. CONCUR Joachim Parrow, Björn Victor
1997	—	`conf`	Foreword. EXPRESS Catuscia Palamidessi, Joachim Parrow
1997	—	`ed.`	International Workshop on Expressiveness in Concurrency, EXPRESS 1997, Santa Margherita Ligure, Italy, September 8-12, 1997 EXPRESS Catuscia Palamidessi, Joachim Parrow
1997	—	`conf`	The Update Calculus (Extended Abstract). AMAST Joachim Parrow, Björn Victor
1996	B	`conf`	Constraints as Processes. CONCUR Björn Victor, Joachim Parrow
1996	J	`jnl`	Designing a multiway synchronization protocol. Comput. Commun. Joachim Parrow, Peter Sjödin
1996	—	`ed.`	Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings FTRTFT Bengt Jonsson, Joachim Parrow
1995	J	`jnl`	Algebraic Theories for Name-Passing Calculi Inf. Comput. Joachim Parrow, Davide Sangiorgi
1995	J	`jnl`	Concurrency without Homotopy. Bull. EATCS Joachim Parrow
1995	J	`jnl`	Guest Editors Foreword. Nord. J. Comput. Bengt Jonsson, Joachim Parrow
1995	J	`jnl`	Interaction Diagrams. Nord. J. Comput. Joachim Parrow
1994	B	`ed.`	CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings CONCUR Bengt Jonsson, Joachim Parrow
1994	A	`conf`	The Complete Axiomatization of Cs-congruence. STACS Joachim Parrow, Peter Sjödin
1993	—	`conf`	Algebraic Theories for Name-Passing Calculi. REX School/Symposium Joachim Parrow, Davide Sangiorgi
1993	J	`jnl`	Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs Inf. Comput. Bengt Jonsson, Joachim Parrow
1993	—	`conf`	Interaction Diagrams. REX School/Symposium Joachim Parrow
1993	J	`jnl`	Modal Logics for Mobile Processes. Theor. Comput. Sci. Robin Milner, Joachim Parrow, David Walker
1993	J	`jnl`	Structural and Behavioural Equivalences of Networks Inf. Comput. Joachim Parrow
1993	J	`jnl`	The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Trans. Program. Lang. Syst. Rance Cleaveland, Joachim Parrow, Bernhard Steffen
1992	J	`jnl`	A Calculus of Mobile Processes, I Inf. Comput. Robin Milner, Joachim Parrow, David Walker
1992	J	`jnl`	A Calculus of Mobile Processes, II Inf. Comput. Robin Milner, Joachim Parrow, David Walker
1992	J	`jnl`	An Algebraic Verification of a Mobile Network. Formal Aspects Comput. Fredrik Orava, Joachim Parrow
1992	B	`conf`	Multiway Synchronization Verified with Coupled Simulation. CONCUR Joachim Parrow, Peter Sjödin
1991	B	`conf`	Modal Logics for Mobile Processes. CONCUR Robin Milner, Joachim Parrow, David Walker
1991	—	`ed.`	Protocol Specification, Testing and Verification XI, Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, 18-20 June 1991 PSTV Bengt Jonsson, Joachim Parrow, Björn Pehrson
1990	—	`conf`	Algebraic descriptions of mobile networks: An example. PSTV Fredrik Orava, Joachim Parrow
1990	B	`conf`	An Implementation of a Translational Semantics for an Imperative Language. CONCUR Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
1990	A*	`conf`	Structural and Behavioural Equivalences of Networks. ICALP Joachim Parrow
1990	J	`jnl`	The expressive power of parallelism. Future Gener. Comput. Syst. Joachim Parrow
1989	—	`conf`	A Semantics Based Verification Tool for Finite State Systems. PSTV Rance Cleaveland, Joachim Parrow, Bernhard Steffen
1989	A	`conf`	Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS Bengt Jonsson, Joachim Parrow
1989	—	`conf`	Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. Automatic Verification Methods for Finite State Systems Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow
1989	J	`jnl`	Submodule Construction as Equation Solving in CCS. Theor. Comput. Sci. Joachim Parrow
1989	—	`conf`	The Concurrency Workbench. Automatic Verification Methods for Finite State Systems Rance Cleaveland, Joachim Parrow, Bernhard Steffen
1989	—	`conf`	The Expressive Power of Simple Parallelism. PARLE (2) Joachim Parrow
1987	—	`conf`	Submodule Construction as Equation Solving CCS. FSTTCS Joachim Parrow
1984	—	`conf`	Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic. PSTV Joachim Parrow, Rune Gustavsson
1983	A*	`conf`	Caddie - An Interactive Design Environment ISCA Björn Pehrson, Joachim Parrow
1982	—	`conf`	An Integrated Approach to Protocol Design Research. PSTV Rune Gustavsson, Joachim Parrow, Björn Pehrson