Остановите войну!
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
- 2012
- Fides Aarts, Faranak Heidarian, Frits W. Vaandrager:
A Theory of History Dependent Abstractions for Learning Interface Automata. CONCUR 2012: 240-255 - Guy Avni, Orna Kupferman:
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. CONCUR 2012: 84-99 - Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Turing Meets Milner. CONCUR 2012: 1-20 - Sandie Balaguer, Thomas Chatain:
Avoiding Shared Clocks in Networks of Timed Automata. CONCUR 2012: 100-114 - Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder:
Concurrent Games on VASS with Inhibition. CONCUR 2012: 39-52 - Frank S. de Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro:
Decidability Problems for Actor Systems. CONCUR 2012: 562-577 - Luca Bortolussi, Jane Hillston:
Fluid Model Checking. CONCUR 2012: 333-347 - Romain Brenguier, Stefan Göller, Ocan Sankur:
A Comparison of Succinctly Represented Finite-State Systems. CONCUR 2012: 147-161 - Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-Dimensional Quantitative Objectives. CONCUR 2012: 115-131 - Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi, Michael Ummels:
Playing Stochastic Games Precisely. CONCUR 2012: 348-363 - Tzu-Chun Chen, Kohei Honda:
Specifying Stateful Asynchronous Properties for Distributed Programs. CONCUR 2012: 209-224 - Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar:
MSO Decidability of Multi-Pushdown Systems via Split-Width. CONCUR 2012: 547-561 - Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 - Romain Demangeon, Kohei Honda:
Nested Protocols in Session Types. CONCUR 2012: 272-286 - Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. CONCUR 2012: 132-146 - Luca Fossati, Kohei Honda, Nobuko Yoshida:
Intensional and Extensional Characterisation of Global Progress in the π-Calculus. CONCUR 2012: 287-301 - Matthias Függer, Josef Widder:
Efficient Checking of Link-Reversal-Based Concurrent Systems. CONCUR 2012: 486-499 - Daniel Gebler, Wan J. Fokkink:
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. CONCUR 2012: 395-409 - Alexey Gotsman, Hongseok Yang:
Linearizability with Ownership Transfer. CONCUR 2012: 256-271 - Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Duality and i/o-Types in the π-Calculus. CONCUR 2012: 302-316 - Ryszard Janicki, Xiang Yin, Nadezhda Zubkova:
Modeling Interval Order Structures with Partially Commutative Monoids. CONCUR 2012: 425-439 - Alexander Kaiser, Daniel Kroening, Thomas Wahl:
Efficient Coverability Analysis by Proof Minimization. CONCUR 2012: 500-515 - Henning Kerstan, Barbara König:
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. CONCUR 2012: 410-424 - Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, Frank D. Valencia:
Spatial and Epistemic Modalities in Constraint-Based Process Calculi. CONCUR 2012: 317-332 - Julien Lange, Emilio Tuosto:
Synthesising Choreographies from Local Session Types. CONCUR 2012: 225-239 - Mohsen Lesani, Victor Luchangco, Mark Moir:
A Framework for Formally Verifying Software Transactional Memory Algorithms. CONCUR 2012: 516-530 - Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
Quantified CTL: Expressiveness and Model Checking - (Extended Abstract). CONCUR 2012: 177-192 - Roy Mennicke:
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems. CONCUR 2012: 531-546 - Roland Meyer, Victor Khomenko, Reiner Hüchting:
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. CONCUR 2012: 440-455 - Lukasz Mikulski:
Algebraic Structure of Combined Traces. CONCUR 2012: 456-470
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-06-04 06: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