Остановите войну!
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
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 40 matches
- 2008
- Martín Abadi, Tim Harris, Katherine F. Moore:
A Model of Dynamic Separation for Transactional Memory. CONCUR 2008: 6-20 - Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
R-Automata. CONCUR 2008: 67-81 - Lucia Acciai, Michele Boreale:
Spatial and Behavioral Types in the Pi-Calculus. CONCUR 2008: 372-386 - S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili:
On the Reachability Analysis of Acyclic Networks of Pushdown Systems. CONCUR 2008: 356-371 - Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. van Tilburg:
A Context-Free Process as a Pushdown Automaton. CONCUR 2008: 98-113 - Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König:
Unfolding-Based Diagnosis of Systems with an Evolving Topology. CONCUR 2008: 203-217 - Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje:
Strategy Construction for Parity Games with Imperfect Information. CONCUR 2008: 325-339 - Lorenzo Bettini, Mario Coppo, Loris D'Antoni, Marco De Luca, Mariangiola Dezani-Ciancaglini, Nobuko Yoshida:
Global Progress in Dynamically Interleaved Multiparty Sessions. CONCUR 2008: 418-433 - Lars Birkedal, Søren Debois, Thomas T. Hildebrandt:
On the Construction of Sorted Reactive Systems. CONCUR 2008: 218-232 - Simon Bliudze, Joseph Sifakis:
A Notion of Glue Expressiveness for Component-Based Systems. CONCUR 2008: 508-522 - Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166 - Borzoo Bonakdarpour, Sandeep S. Kulkarni:
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs. CONCUR 2008: 167-171 - Tevfik Bultan:
Service Choreography and Orchestration with Conversations. CONCUR 2008: 2-3 - Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. CONCUR 2008: 114-130 - Marco Carbone, Kohei Honda, Nobuko Yoshida:
Structured Interactional Exceptions in Session Types. CONCUR 2008: 402-417 - Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan:
Least Upper Bounds for Probability Measures and Their Applications to Abstractions. CONCUR 2008: 264-278 - Pierre Chambart, Philippe Schnoebelen:
Mixing Lossy and Perfect Fifo Channels. CONCUR 2008: 340-355 - Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann:
Environment Assumptions for Synthesis. CONCUR 2008: 147-161 - Sjoerd Cranen, Mohammad Reza Mousavi, Michel A. Reniers:
A Rule Format for Associativity. CONCUR 2008: 447-461 - Pepijn Crouzen, Holger Hermanns, Lijun Zhang:
On the Minimisation of Acyclic Models. CONCUR 2008: 295-309 - Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008: 310-324 - Klaus Dräger, Bernd Finkbeiner:
Subsequence Invariants. CONCUR 2008: 172-186 - Daniele Gorla:
Towards a Unified Approach to Encodability and Separation Results for Process Calculi. CONCUR 2008: 492-507 - Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh:
Completeness and Nondeterminism in Model Checking Transactional Memories. CONCUR 2008: 21-35 - Rachid Guerraoui, Marko Vukolic:
A Scalable and Oblivious Atomicity Assertion. CONCUR 2008: 52-66 - Joseph Y. Halpern:
Beyond Nash Equilibrium: Solution Concepts for the 21st Century. CONCUR 2008: 1 - Petr Jancar, Martin Kot, Zdenek Sawa:
Normed BPA vs. Normed BPP Revisited. CONCUR 2008: 434-446 - Harmen Kastenberg, Arend Rensink:
Dynamic Partial Order Reduction Using Probe Sets. CONCUR 2008: 233-247 - Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf:
Abstraction for Stochastic Systems by Erlang's Method of Stages. CONCUR 2008: 279-294
skipping 10 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-08-05 15:10 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