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
no 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 34 matches
- 2007
- Luca Aceto, Anna Ingólfsdóttir:
The Saga of the Axiomatization of Parallel Composition. CONCUR 2007: 2-16 - S. Akshay, Madhavan Mukund, K. Narayan Kumar:
Checking Coverage for Infinite Collections of Timed Scenarios. CONCUR 2007: 181-196 - Luca de Alfaro, Pritam Roy:
Solving Games Via Three-Valued Abstraction Refinement. CONCUR 2007: 74-89 - Benjamin Aminof, Aniello Murano, Moshe Y. Vardi:
Pushdown Module Checking with Imperfect Information. CONCUR 2007: 460-475 - Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
Temporal Antecedent Failure: Refining Vacuity. CONCUR 2007: 492-506 - Filippo Bonchi, Ugo Montanari:
Coalgebraic Models for Reactive Systems. CONCUR 2007: 364-379 - Gérard Boudol:
Fair Cooperative Multithreading. CONCUR 2007: 272-286 - Laura Bozzelli:
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. CONCUR 2007: 476-491 - Tomás Brázdil, Vojtech Forejt:
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics. CONCUR 2007: 428-444 - Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby:
Timed Concurrent Game Structures. CONCUR 2007: 445-459 - Rohit Chadha, Mahesh Viswanathan:
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. CONCUR 2007: 136-150 - Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
Strategy Logic. CONCUR 2007: 59-73 - Konstantinos Chatzikokolakis, Catuscia Palamidessi:
Making Random Choices Invisible to the Scheduler. CONCUR 2007: 42-58 - Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. C. Willemse:
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. CONCUR 2007: 120-135 - Silvia Crafa, Daniele Varacca, Nobuko Yoshida:
Compositional Event Structure Semantics for the Internal pi -Calculus. CONCUR 2007: 317-332 - Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine:
Rule-Based Modelling of Cellular Signalling. CONCUR 2007: 17-41 - Thomas Ehrhard, Olivier Laurent:
Interpreting a Finitary Pi-calculus in Differential Interaction Nets. CONCUR 2007: 333-348 - Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
Causal Message Sequence Charts. CONCUR 2007: 166-180 - Davide Grohmann, Marino Miculan:
Reactive Systems over Directed Bigraphs. CONCUR 2007: 380-394 - Samuel Hym:
Mobility Control Via Passports. CONCUR 2007: 349-363 - Peter Lammich, Markus Müller-Olm:
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. CONCUR 2007: 287-302 - Cosimo Laneve, Luca Padovani:
The Must Preorder Revisited. CONCUR 2007: 212-225 - Martin Lange:
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104 - Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski:
On Modal Refinement and Consistency. CONCUR 2007: 105-119 - Paul-André Melliès, Samuel Mimram:
Asynchronous Games: Innocence Without Alternation. CONCUR 2007: 395-411 - Michael Mendler, Gerald Lüttgen:
Is Observational Congruence Axiomatisable in Equational Horn Logic? CONCUR 2007: 197-211 - Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson:
Topology-Dependent Abstractions of Broadcast Networks. CONCUR 2007: 226-240 - Martin R. Neuhäußer, Joost-Pieter Katoen:
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. CONCUR 2007: 412-427 - Luigi Santocanale:
A Nice Labelling for Tree-Like Event Structures of Degree 3. CONCUR 2007: 151-165 - Fred B. Schneider:
Mapping the Security Landscape: A Role for Language Techniques. CONCUR 2007: 1
skipping 4 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-12-18 04:34 CET 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