Остановите войну!
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 39 matches
- 2016
- Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Diagnosis in Infinite-State Probabilistic Systems. CONCUR 2016: 37:1-37:15 - Giovanni Bernardi, Alexey Gotsman:
Robustness against Consistency Models with Atomic Visibility. CONCUR 2016: 7:1-7:15 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo:
The Benefits of Duality in Verifying Concurrent Programs under TSO. CONCUR 2016: 5:1-5:15 - S. Akshay, Paul Gastin, Shankara Narayanan Krishna:
Analyzing Timed Systems Using Tree Automata. CONCUR 2016: 27:1-27:14 - Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR 2016: 9:1-9:15 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
Complete Axiomatization for the Bisimilarity Distance on Markov Chains. CONCUR 2016: 21:1-21:14 - Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR 2016: 16:1-16:15 - Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný:
Stability in Graphs and Games. CONCUR 2016: 10:1-10:14 - Tomasz Brengos, Marco Peressotti:
A Uniform Framework for Timed Automata. CONCUR 2016: 26:1-26:15 - Romain Brenguier:
Optimal Assumptions for Synthesis. CONCUR 2016: 8:1-8:15 - Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the Complexity of Heterogeneous Multidimensional Games. CONCUR 2016: 11:1-11:15 - Marco Carbone, Sam Lindley, Fabrizio Montesi, Carsten Schürmann, Philip Wadler:
Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types. CONCUR 2016: 33:1-33:15 - Simon Castellan, Pierre Clairambault:
Causality vs. Interleavings in Concurrent Game Semantics. CONCUR 2016: 32:1-32:14 - Valentina Castiglioni, Daniel Gebler, Simone Tini:
Modal Decomposition on Nondeterministic Probabilistic Processes. CONCUR 2016: 36:1-36:15 - Konstantinos Chatzikokolakis, Catuscia Palamidessi, Valeria Vignudelli:
Up-To Techniques for Generalized Bisimulation Metrics. CONCUR 2016: 35:1-35:14 - Przemyslaw Daca, Thomas A. Henzinger, Jan Kretínský, Tatjana Petrov:
Linear Distances between Markov Chains. CONCUR 2016: 20:1-20:15 - Fredrik Dahlqvist, Vincent Danos, Ilias Garnier:
Robustly Parameterised Higher-Order Probabilistic Models. CONCUR 2016: 23:1-23:15 - Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Ohad Kammar:
Bayesian Inversion by ω-Complete Cone Duality. CONCUR 2016: 1:1-1:15 - Amélie David, François Laroussinie, Nicolas Markey:
On the Expressiveness of QCTL. CONCUR 2016: 28:1-28:15 - Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Bisimulations and Unfolding in P-Accessible Categorical Models. CONCUR 2016: 25:1-25:14 - Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - Bernd Finkbeiner, Christopher Hahn:
Deciding Hyperproperties. CONCUR 2016: 13:1-13:14 - Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith:
Local Linearizability for Concurrent Container-Type Data Structures. CONCUR 2016: 6:1-6:15 - Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CONCUR 2016: 34:1-34:15 - Ross Horne, Alwen Tiu, Bogdan Aman, Gabriel Ciobanu:
Private Names in Non-Commutative Logic. CONCUR 2016: 31:1-31:16 - Loïg Jezequel, Didier Lime:
Lazy Reachability Analysis in Distributed Systems. CONCUR 2016: 17:1-17:14 - Igor V. Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis:
Parameterized Systems in BIP: Design and Model Checking. CONCUR 2016: 30:1-30:16 - Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR 2016: 29:1-29:14 - Roly Perera, Deepak Garg, James Cheney:
Causally Consistent Dynamic Slicing. CONCUR 2016: 18:1-18:15 - Christina Rickmann, Christoph Wagner, Uwe Nestmann, Stefan Schmid:
Topological Self-Stabilization with Name-Passing Process Calculi. CONCUR 2016: 19:1-19:15
skipping 9 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-11 12:22 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