default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th CONCUR 2024: Calgary, Canada
- Rupak Majumdar
, Alexandra Silva:
35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada. LIPIcs 311, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-339-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Arie Gurfinkel:
Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk). 1:1-1:1 - Azalea Raad:
Principles of Persistent Programming (Invited Talk). 2:1-2:1 - Thomas Wies:
Verifying Concurrent Search Structures (Invited Talk). 3:1-3:1 - Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Daniele Gorla, Jana Wagemaker:
Centralized vs Decentralized Monitors for Hyperproperties. 4:1-4:19 - S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. 5:1-5:19 - S. Akshay, Tobias Meggendorfer, P. S. Thiagarajan:
Causally Deterministic Markov Decision Processes. 6:1-6:22 - Jesús Aranda, Sebastián Betancourt, Juan Francisco Díaz, Frank Valencia:
Fairness and Consensus in an Asynchronous Opinion Model for Social Networks. 7:1-7:17 - Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. 8:1-8:17 - Christel Baier, Jakob Piribauer, Maximilian Starke:
Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures. 9:1-9:20 - Mrudula Balachander, Emmanuel Filiot, Raffaella Gentilini:
Passive Learning of Regular Data Languages in Polynomial Time and Data. 10:1-10:21 - Paolo Baldan, Davide Castelnovo, Andrea Corradini, Fabio Gadducci:
Left-Linear Rewriting in Adhesive Categories. 11:1-11:24 - Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash:
History-Determinism vs Fair Simulation. 12:1-12:16 - Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. 13:1-13:18 - Véronique Bruyère, Christophe Grandmont, Jean-François Raskin:
As Soon as Possible but Rationally. 14:1-14:20 - Valentina Castiglioni, Michele Loreti, Simone Tini:
RobTL: Robustness Temporal Logic for CPS. 15:1-15:23 - Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno, Gabriele Tedeschi:
Effect Semantics for Quantum Process Calculi. 16:1-16:22 - Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger:
Invariants for One-Counter Automata with Disequality Tests. 17:1-17:21 - Lorenzo Clemente:
Weighted Basic Parallel Processes and Combinatorial Enumeration. 18:1-18:22 - Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr:
Computing Inductive Invariants of Regular Abstraction Frameworks. 19:1-19:18 - Keri D'Angelo, Sebastian Gurke, Johanna Maria Kirss, Barbara König, Matina Najafi, Wojciech Rozowski, Paul Wild:
Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques. 20:1-20:19 - Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna:
Reversible Transducers over Infinite Words. 21:1-21:22 - Romain Delpy, Anca Muscholl, Grégoire Sutre:
An Automata-Based Approach for Synchronizable Mailbox Communication. 22:1-22:19 - Laurent Doyen, Thomas Soullard:
Regular Games with Imperfect Information Are Not That Regular. 23:1-23:19 - Javier Esparza, Rubén Rubio:
Validity of Contextual Formulas. 24:1-24:17 - Sergey Goncharov, Tarmo Uustalu:
A Unifying Categorical View of Nondeterministic Iteration and Tests. 25:1-25:22 - Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Phase-Bounded Broadcast Networks over Topologies of Communication. 26:1-26:16 - Quentin Guilmant, Joël Ouaknine:
Inaproximability in Weighted Timed Games. 27:1-27:15 - Daniel Hausmann, Nir Piterman:
Faster and Smaller Solutions of Obliging Games. 28:1-28:19 - Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Strategic Dominance: A New Preorder for Nondeterministic Processes. 29:1-29:20 - Juan C. Jaramillo, Dan Frumin, Jorge A. Pérez:
Around Classical and Intuitionistic Linear Processes. 30:1-30:19 - Lukasz Kaminski, Slawomir Lasota:
Bi-Reachability in Petri Nets with Data. 31:1-31:20 - Stefan Kiefer, Qiyi Tang:
Minimising the Probabilistic Bisimilarity Distance. 32:1-32:18 - Aristotelis Koutsouridis, Michalis Kokologiannakis, Viktor Vafeiadis:
Automating Memory Model Metatheory with Intersections. 33:1-33:16 - Guillermo A. Pérez, Shrisha Rao:
On Continuous Pushdown VASS in One Dimension. 34:1-34:20 - Simon Prucker, Lutz Schröder:
Nominal Tree Automata with Name Allocation. 35:1-35:17 - Gaspard Reghem, Rob J. van Glabbeek:
Branching Bisimilarity for Processes with Time-Outs. 36:1-36:22 - Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, Tim Quatmann:
A Spectrum of Approximate Probabilistic Bisimulations. 37:1-37:19 - Myrthe S. C. Spronck, Bas Luttik, Tim A. C. Willemse:
Progress, Justness and Fairness in Modal μ-Calculus Formulae. 38:1-38:22 - Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, Fernando Orejas:
Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. 39:1-39:20 - Marnix Suilen, Marck van der Vegt, Sebastian Junges:
A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs. 40:1-40:17
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-04-15 21:05 CEST 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:
