default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th CONCUR 2023: Antwerp, Belgium
- Guillermo A. Pérez
, Jean-François Raskin:
34th International Conference on Concurrency Theory, CONCUR 2023, Antwerp, Belgium, September 18-23, 2023. LIPIcs 279, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-299-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz:
CONCUR Test-Of-Time Award 2023 (Invited Paper). 1:1-1:2 - Ahmed Bouajjani:
On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk). 2:1-2:1 - Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix. 3:1-3:16 - P. H. M. van Spaendonck, Tim A. C. Willemse:
The Best of Both Worlds: Model-Driven Engineering Meets Model-Based Testing. 4:1-4:16 - Myrthe S. C. Spronck, Bas Luttik:
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers. 5:1-5:17 - Roland Guttenberg, Mikhail A. Raskin, Javier Esparza:
Geometry of Reachability Sets of Vector Addition Systems. 6:1-6:16 - Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. 7:1-7:17 - Eren Keskin, Roland Meyer:
Separability and Non-Determinizability of WSTS. 8:1-8:17 - Åsmund Aqissiaq Arild Kløvstad, Eduard Kamburjan, Einar Broch Johnsen:
Compositional Correctness and Completeness for Symbolic Partial Order Reduction. 9:1-9:16 - Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche:
Monus Semantics in Vector Addition Systems with States. 10:1-10:18 - Gil Silva, Andreia Mordido, Vasco T. Vasconcelos:
Subtyping Context-Free Session Types. 11:1-11:19 - Michal Ajdarów, Antonín Kucera:
Asymptotic Complexity Estimates for Probabilistic Programs and Their VASS Abstractions. 12:1-12:16 - Christoph Haase, Radoslaw Piórkowski:
Universal Quantification Makes Automatic Structures Hard to Decide. 13:1-13:17 - Alain Finkel, Serge Haddad, Lina Ye:
About Decisiveness of Dynamic Probabilistic Models. 14:1-14:17 - Anna Schmitt, Kirstin Peters:
Probabilistic Operational Correspondence. 15:1-15:17 - Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. 16:1-16:17 - Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Safety and Liveness of Quantitative Automata. 17:1-17:18 - Sougata Bose, David Purser, Patrick Totzke:
History-Deterministic Vector Addition Systems. 18:1-18:17 - Orna Kupferman, Noam Shenwald:
Games with Trading of Control. 19:1-19:17 - Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. 20:1-20:20 - Ezio Bartocci, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa:
Hypernode Automata. 21:1-21:16 - Alessandro Abate, Alec Edwards, Mirco Giacobbe, Hashan Punchihewa, Diptarko Roy:
Quantitative Verification with Neural Networks. 22:1-22:18 - Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya:
Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete. 23:1-23:18 - Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. 24:1-24:17 - Azalea Raad, Julien Vanegue, Josh Berdine, Peter W. O'Hearn:
A General Approach to Under-Approximate Reasoning About Concurrent Programs. 25:1-25:17 - Omri Isac, Yoni Zohar, Clark W. Barrett, Guy Katz:
DNN Verification, Reachability, and the Exponential Function Problem. 26:1-26:18 - Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. 27:1-27:17 - Jan Friso Groote, Tim A. C. Willemse:
Real Equation Systems with Alternating Fixed-Points. 28:1-28:17 - Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. 29:1-29:18 - Jesús Domínguez, Aleksandar Nanevski:
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack. 30:1-30:16 - Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-Deterministic Parikh Automata. 31:1-31:16 - Jan Martens, Jan Friso Groote:
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. 32:1-32:17 - Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. 33:1-33:17 - Tiange Liu, Alwen Tiu, Jim de Groot:
Modal Logics for Mobile Processes Revisited. 34:1-34:17 - Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova:
Deciding What Is Good-For-MDPs. 35:1-35:16 - Petr Jancar, Jérôme Leroux:
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. 36:1-36:17 - Yong Li, Sven Schewe, Moshe Y. Vardi:
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. 37:1-37:17 - Ugo Dal Lago, Maurizio Murgia:
Contextual Behavioural Metrics. 38:1-38:17 - Ashwani Anand, Georg Zetzsche:
Priority Downward Closures. 39:1-39:18
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.
last updated on 2025-12-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
