default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Parrow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j27]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)
2010 – 2019
- 2019
- [i1]Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CoRR abs/1904.02564 (2019) - 2017
- [c45]Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson:
Weak Nominal Modal Logic. FORTE 2017: 179-193 - 2016
- [j26]Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, Ramunas Gutkovas:
Modal Logics for Nominal Transition Systems. Arch. Formal Proofs 2016 (2016) - [j25]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) - [j24]Joachim Parrow, Tjark Weber:
The Largest Respectful Function. Log. Methods Comput. Sci. 12(2) (2016) - [j23]Marco Carbone, Thomas T. Hildebrandt, Joachim Parrow, Matthias Weidlich:
Editorial. Formal Aspects Comput. 28(4): 529-530 (2016) - [j22]Jesper Bengtson, Joachim Parrow, Tjark Weber:
Psi-Calculi in Isabelle. J. Autom. Reason. 56(1): 1-47 (2016) - [j21]Joachim Parrow:
General conditions for full abstraction. Math. Struct. Comput. Sci. 26(4): 655-657 (2016) - [c44]Johannes Åman Pohjola, Joachim Parrow:
Bisimulation up-to techniques for psi-calculi. CPP 2016: 142-153 - [c43]Johannes Åman Pohjola, Joachim Parrow:
The Expressive Power of Monotonic Parallel Composition. ESOP 2016: 780-803 - 2015
- [j20]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): 201-216 (2015) - [c42]Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CONCUR 2015: 198-211 - [c41]Virginia Grande, Joachim Parrow:
Motivation and Grade Gap Related to Gender in a Programming Course. ITiCSE 2015: 349 - 2014
- [j19]Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola:
Higher-order psi-calculi. Math. Struct. Comput. Sci. 24(2) (2014) - [c40]Johannes Åman Pohjola, Joachim Parrow:
Priorities Without Priorities: Representing Preemption in Psi-Calculi. EXPRESS/SOS 2014: 2-15 - 2013
- [c39]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: 103-118 - 2012
- [j18]Magnus Johansson, Björn Victor, Joachim Parrow:
Computing strong and weak bisimulations for psi-calculi. J. Log. Algebraic Methods Program. 81(3): 162-180 (2012) - 2011
- [j17]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) - [c38]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: 74-89 - 2010
- [c37]Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor:
Weak Equivalences in Psi-Calculi. LICS 2010: 322-331
2000 – 2009
- 2009
- [j16]Jesper Bengtson, Joachim Parrow:
Formalising the pi-calculus using nominal logic. Log. Methods Comput. Sci. 5(2) (2009) - [c36]Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor:
Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS 2009: 39-48 - [c35]Jesper Bengtson, Joachim Parrow:
Psi-calculi in Isabelle. TPHOLs 2009: 99-114 - [c34]Magnus Johansson, Björn Victor, Joachim Parrow:
A Fully Abstract Symbolic Semantics for Psi-Calculi. SOS 2009: 17-31 - 2008
- [c33]Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson:
Extended pi-Calculi. ICALP (2) 2008: 87-98 - 2007
- [c32]Jesper Bengtson, Joachim Parrow:
Formalising the pi-Calculus Using Nominal Logic. FoSSaCS 2007: 63-77 - [c31]Jesper Bengtson, Joachim Parrow:
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. SOS@LICS/ICALP 2007: 61-75 - 2006
- [c30]Joachim Parrow:
Expressiveness of Process Algebras. LIX 2006: 173-186 - 2005
- [c29]Oskar Wibling, Joachim Parrow, Arnold Neville Pears:
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. FORTE 2005: 128-142 - [c28]Michael Baldamus, Joachim Parrow, Björn Victor:
A Fully Abstract Encoding of the pi-Calculus with Data Terms. ICALP 2005: 1202-1213 - 2004
- [c27]Oskar Wibling, Joachim Parrow, Arnold Neville Pears:
Automatized Verification of Ad Hoc Routing Protocols. FORTE 2004: 343-358 - [c26]Michael Baldamus, Joachim Parrow, Björn Victor:
Spi Calculus Translated to ?--Calculus Preserving May-Tests. LICS 2004: 22-31 - 2003
- [e5]Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Lecture Notes in Computer Science 2719, Springer 2003, ISBN 3-540-40493-7 [contents] - 2001
- [c25]Cosimo Laneve, Joachim Parrow, Björn Victor:
Solo Diagrams. TACS 2001: 127-144 - [p1]Joachim Parrow:
An Introduction to the π-Calculus. Handbook of Process Algebra 2001: 479-543 - 2000
- [j15]Catuscia Palamidessi, Joachim Parrow, Rob J. van Glabbeek:
Preface. Inf. Comput. 156(1-2): 1 (2000) - [c24]Joachim Parrow:
Trios in concert. Proof, Language, and Interaction 2000: 623-638
1990 – 1999
- 1998
- [c23]Joachim Parrow, Björn Victor:
The Tau-Laws of Fusion. CONCUR 1998: 99-114 - [c22]Björn Victor, Joachim Parrow:
Concurrent Constraints in the Fusion Calculus. ICALP 1998: 455-469 - [c21]Joachim Parrow, Björn Victor:
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. LICS 1998: 176-185 - 1997
- [c20]Joachim Parrow, Björn Victor:
The Update Calculus (Extended Abstract). AMAST 1997: 409-423 - [c19]Catuscia Palamidessi, Joachim Parrow:
Foreword. EXPRESS 1997: 1-2 - [e4]Catuscia Palamidessi, Joachim Parrow:
International Workshop on Expressiveness in Concurrency, EXPRESS 1997, Santa Margherita Ligure, Italy, September 8-12, 1997. Electronic Notes in Theoretical Computer Science 7, Elsevier 1997 [contents] - 1996
- [j14]Joachim Parrow, Peter Sjödin:
Designing a multiway synchronization protocol. Comput. Commun. 19(14): 1151-1160 (1996) - [c18]Björn Victor, Joachim Parrow:
Constraints as Processes. CONCUR 1996: 389-405 - [e3]Bengt Jonsson, Joachim Parrow:
Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, Uppsala, Sweden, September 9-13, 1996, Proceedings. Lecture Notes in Computer Science 1135, Springer 1996, ISBN 3-540-61648-9 [contents] - 1995
- [j13]Joachim Parrow:
Concurrency without Homotopy. Bull. EATCS 55 (1995) - [j12]Joachim Parrow, Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi. Inf. Comput. 120(2): 174-197 (1995) - [j11]Bengt Jonsson, Joachim Parrow:
Guest Editors Foreword. Nord. J. Comput. 2(2): 87 (1995) - [j10]Joachim Parrow:
Interaction Diagrams. Nord. J. Comput. 2(4): 407-443 (1995) - 1994
- [c17]Joachim Parrow, Peter Sjödin:
The Complete Axiomatization of Cs-congruence. STACS 1994: 557-568 - [e2]Bengt Jonsson, Joachim Parrow:
CONCUR '94, Concurrency Theory, 5th International Conference, Uppsala, Sweden, August 22-25, 1994, Proceedings. Lecture Notes in Computer Science 836, Springer 1994, ISBN 3-540-58329-7 [contents] - 1993
- [j9]Joachim Parrow:
Structural and Behavioural Equivalences of Networks. Inf. Comput. 107(1): 58-90 (1993) - [j8]Bengt Jonsson, Joachim Parrow:
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. Inf. Comput. 107(2): 272-302 (1993) - [j7]Robin Milner, Joachim Parrow, David Walker:
Modal Logics for Mobile Processes. Theor. Comput. Sci. 114(1): 149-171 (1993) - [j6]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): 36-72 (1993) - [c16]Joachim Parrow:
Interaction Diagrams. REX School/Symposium 1993: 477-508 - [c15]Joachim Parrow, Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi. REX School/Symposium 1993: 509-529 - 1992
- [j5]Fredrik Orava, Joachim Parrow:
An Algebraic Verification of a Mobile Network. Formal Aspects Comput. 4(6): 497-543 (1992) - [j4]Robin Milner, Joachim Parrow, David Walker:
A Calculus of Mobile Processes, I. Inf. Comput. 100(1): 1-40 (1992) - [j3]Robin Milner, Joachim Parrow, David Walker:
A Calculus of Mobile Processes, II. Inf. Comput. 100(1): 41-77 (1992) - [c14]Joachim Parrow, Peter Sjödin:
Multiway Synchronization Verified with Coupled Simulation. CONCUR 1992: 518-533 - 1991
- [c13]Robin Milner, Joachim Parrow, David Walker:
Modal Logics for Mobile Processes. CONCUR 1991: 45-60 - [e1]Bengt Jonsson, Joachim Parrow, Björn Pehrson:
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. North-Holland 1991, ISBN 0-444-89210-9 [contents] - 1990
- [j2]Joachim Parrow:
The expressive power of parallelism. Future Gener. Comput. Syst. 6(3): 271-285 (1990) - [c12]Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow:
An Implementation of a Translational Semantics for an Imperative Language. CONCUR 1990: 246-262 - [c11]Joachim Parrow:
Structural and Behavioural Equivalences of Networks. ICALP 1990: 540-552 - [c10]Fredrik Orava, Joachim Parrow:
Algebraic descriptions of mobile networks: An example. PSTV 1990: 275-291
1980 – 1989
- 1989
- [j1]Joachim Parrow:
Submodule Construction as Equation Solving in CCS. Theor. Comput. Sci. 68(2): 175-202 (1989) - [c9]Rance Cleaveland, Joachim Parrow, Bernhard Steffen:
The Concurrency Workbench. Automatic Verification Methods for Finite State Systems 1989: 24-37 - [c8]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: 179-188 - [c7]Joachim Parrow:
The Expressive Power of Simple Parallelism. PARLE (2) 1989: 389-405 - [c6]Rance Cleaveland, Joachim Parrow, Bernhard Steffen:
A Semantics Based Verification Tool for Finite State Systems. PSTV 1989: 287-302 - [c5]Bengt Jonsson, Joachim Parrow:
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. STACS 1989: 421-433 - 1987
- [c4]Joachim Parrow:
Submodule Construction as Equation Solving CCS. FSTTCS 1987: 103-123 - 1984
- [c3]Joachim Parrow, Rune Gustavsson:
Modelling Distributed Systems in an Extension of CCS with Infinite Experiments and Temporal Logic. PSTV 1984: 309-348 - 1983
- [c2]Björn Pehrson, Joachim Parrow:
Caddie - An Interactive Design Environment. ISCA 1983: 24-31 - 1982
- [c1]Rune Gustavsson, Joachim Parrow, Björn Pehrson:
An Integrated Approach to Protocol Design Research. PSTV 1982: 309-310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
