Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 79 matches
- 2021
- 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) - 2019
- Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CoRR abs/1904.02564 (2019) - 2017
- Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson:
Weak Nominal Modal Logic. FORTE 2017: 179-193 - 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 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) - Joachim Parrow, Tjark Weber:
The Largest Respectful Function. Log. Methods Comput. Sci. 12(2) (2016) - Marco Carbone, Thomas T. Hildebrandt, Joachim Parrow, Matthias Weidlich:
Editorial. Formal Aspects Comput. 28(4): 529-530 (2016) - Jesper Bengtson, Joachim Parrow, Tjark Weber:
Psi-Calculi in Isabelle. J. Autom. Reason. 56(1): 1-47 (2016) - Joachim Parrow:
General conditions for full abstraction. Math. Struct. Comput. Sci. 26(4): 655-657 (2016) - Johannes Åman Pohjola, Joachim Parrow:
Bisimulation up-to techniques for psi-calculi. CPP 2016: 142-153 - Johannes Åman Pohjola, Joachim Parrow:
The Expressive Power of Monotonic Parallel Composition. ESOP 2016: 780-803 - 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): 201-216 (2015) - Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, Tjark Weber:
Modal Logics for Nominal Transition Systems. CONCUR 2015: 198-211 - Virginia Grande, Joachim Parrow:
Motivation and Grade Gap Related to Gender in a Programming Course. ITiCSE 2015: 349 - 2014
- Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola:
Higher-order psi-calculi. Math. Struct. Comput. Sci. 24(2) (2014) - Johannes Åman Pohjola, Joachim Parrow:
Priorities Without Priorities: Representing Preemption in Psi-Calculi. EXPRESS/SOS 2014: 2-15 - 2013
- 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
- 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
- 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: 74-89 - 2010
- Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor:
Weak Equivalences in Psi-Calculi. LICS 2010: 322-331 - 2009
- Jesper Bengtson, Joachim Parrow:
Formalising the pi-calculus using nominal logic. Log. Methods Comput. Sci. 5(2) (2009) - Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor:
Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS 2009: 39-48 - Jesper Bengtson, Joachim Parrow:
Psi-calculi in Isabelle. TPHOLs 2009: 99-114 - Magnus Johansson, Björn Victor, Joachim Parrow:
A Fully Abstract Symbolic Semantics for Psi-Calculi. SOS 2009: 17-31 - 2008
- Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson:
Extended pi-Calculi. ICALP (2) 2008: 87-98 - 2007
- Jesper Bengtson, Joachim Parrow:
Formalising the pi-Calculus Using Nominal Logic. FoSSaCS 2007: 63-77 - Jesper Bengtson, Joachim Parrow:
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle. SOS@LICS/ICALP 2007: 61-75 - 2006
- Joachim Parrow:
Expressiveness of Process Algebras. LIX 2006: 173-186 - 2005
- Oskar Wibling, Joachim Parrow, Arnold Neville Pears:
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. FORTE 2005: 128-142
skipping 49 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-13 18:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint