![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 41 matches
- 2023
- Jan Martens, Jan Friso Groote:
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. CONCUR 2023: 32:1-32:17 - Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz:
CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR 2023: 1:1-1:2 - Pascal Baumann
, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche:
Monus Semantics in Vector Addition Systems with States. CONCUR 2023: 10:1-10:18 - Anna Schmitt, Kirstin Peters:
Probabilistic Operational Correspondence. CONCUR 2023: 15:1-15:17 - Yong Li, Sven Schewe
, Moshe Y. Vardi:
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. CONCUR 2023: 37:1-37:17 - Alessandro Abate, Alec Edwards
, Mirco Giacobbe, Hashan Punchihewa, Diptarko Roy:
Quantitative Verification with Neural Networks. CONCUR 2023: 22:1-22:18 - Michal Ajdarów, Antonín Kucera:
Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions. CONCUR 2023: 12:1-12:16 - Ashwani Anand, Georg Zetzsche:
Priority Downward Closures. CONCUR 2023: 39:1-39:18 - Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. CONCUR 2023: 27:1-27:17 - Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. CONCUR 2023: 16:1-16:17 - Ezio Bartocci, Thomas A. Henzinger, Dejan Nickovic
, Ana Oliveira da Costa:
Hypernode Automata. CONCUR 2023: 21:1-21:16 - Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. CONCUR 2023: 33:1-33:17 - Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi
, N. Ege Saraç:
Safety and Liveness of Quantitative Automata. CONCUR 2023: 17:1-17:18 - Sougata Bose, David Purser, Patrick Totzke
:
History-Deterministic Vector Addition Systems. CONCUR 2023: 18:1-18:17 - Ahmed Bouajjani:
On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk). CONCUR 2023: 2:1-2:1 - Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL*}(ℤ) to Decision Procedures. CONCUR 2023: 29:1-29:18 - Jesús Domínguez, Aleksandar Nanevski:
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack. CONCUR 2023: 30:1-30:16 - Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
:
History-Deterministic Parikh Automata. CONCUR 2023: 31:1-31:16 - Alain Finkel, Serge Haddad, Lina Ye:
About Decisiveness of Dynamic Probabilistic Models. CONCUR 2023: 14:1-14:17 - Jan Friso Groote, Tim A. C. Willemse:
Real Equation Systems with Alternating Fixed-Points. CONCUR 2023: 28:1-28:17 - Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CONCUR 2023: 7:1-7:17 - Roland Guttenberg, Mikhail A. Raskin, Javier Esparza:
Geometry of Reachability Sets of Vector Addition Systems. CONCUR 2023: 6:1-6:16 - Christoph Haase, Radoslaw Piórkowski:
Universal Quantification Makes Automatic Structures Hard to Decide. CONCUR 2023: 13:1-13:17 - Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. CONCUR 2023: 20:1-20:20 - Omri Isac, Yoni Zohar, Clark W. Barrett, Guy Katz:
DNN Verification, Reachability, and the Exponential Function Problem. CONCUR 2023: 26:1-26:18 - Petr Jancar, Jérôme Leroux:
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. CONCUR 2023: 36:1-36:17 - Eren Keskin, Roland Meyer:
Separability and Non-Determinizability of WSTS. CONCUR 2023: 8:1-8:17 - Åsmund Aqissiaq Arild Kløvstad
, Eduard Kamburjan
, Einar Broch Johnsen:
Compositional Correctness and Completeness for Symbolic Partial Order Reduction. CONCUR 2023: 9:1-9:16 - Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya:
Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete. CONCUR 2023: 23:1-23:18 - Orna Kupferman, Noam Shenwald:
Games with Trading of Control. CONCUR 2023: 19:1-19:17
skipping 11 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-18 18:47 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