CONCUR 2024 sessions will be held in the Foothills Ballroom, Best Western Plus Village Park Inn, Calgary.
The detailed programme can be downloaded here.
Workshops - Monday, September 9
Time | EXPRESS/SOS 2024 (Foothills Room) | TRENDS 2024 (Edgemont Room) |
---|---|---|
08:50-09:00 | Opening | |
09:00-10:00 | Elli Anastasia | Elli Anastasia |
10:00-10:30 | Break | |
10:30-11:00 | Functional Array Programming in an Extended Pi-Calculus (Simone Tini) | |
11:00-12:00 | Simone Tini | Simone Tini |
12:00-12:30 | Linear Temporal Monitors for Session Types | |
12:30-14:00 | Lunch | |
14:00-15:00 | Clément Aubert | Clément Aubert |
15:00-15:30 | Synchronisability in Mailbox Communication | |
15:30-16:00 | Break | |
16:00-16:30 | Semantics for Linear-Time Temporal Logic with Finite Observations | |
16:30-17:00 | Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings | |
17:00-17:30 | Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics |
Day 1 - Tuesday, September 10
Time | Session | Details |
---|---|---|
08:50-09:00 | Opening Talk | |
09:00-10:00 | Invited | Azalea Raad |
10:00-10:30 | Break | |
10:30-12:00 | Games I |
1.Regular games with imperfect information are not that regular (L. Doyen et al.) 2.As Soon as Possible but Rationally (V. Bruyère et al.) 3.Bidding Games with Charging (G. Avni et al.) **best paper nominee** 4.Strategic Dominance: A New Preorder Nondeterministic Processes (T. Henzinger et al.) |
12:00-13:30 | Lunch | |
13:30-15:00 | Infinite State Models |
1.Weighted basic parallel processes and combinatorial enumeration (L. Clemente) 2.Bi-reachability in Petri nets with data (Ł. Kamiński et al.) 3.Phase-Bounded Broadcast Networks over Topologies of Communication (L. Guillou et al.) 4.On Continuous Pushdown VASS in one Dimension (S. Rao et al.) |
15:00-15:30 | Break | |
15:30-17:00 | Rance's Memorial | |
17:30-19:30 | Reception |
Day 2 - Wednesday, September 11
Time | Session | Details |
---|---|---|
09:00-10:00 | Invited | Corina Pasareanu |
10:00-10:45 | Break | |
10:45-12:00 | Games II |
1. Faster and Smaller Solutions of Obliging Games (D. Hausmann et al.) 2. Inapproximability in Weighted Timed Games (Q. Guilmant et al.) 3. The Power of Counting Steps in Quantitative Games (S. Bose et al.) **best paper nominee** |
12:00-13:30 | Lunch | |
13:30-15:00 | Categories and Bisimulation |
1. Left-Linear Rewriting in Adhesive Categories (P. Baldan et al.) 2. Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques (K. D'Angelo et al.) 3. A Unifying Categorical View on Nondeterministic Iteration and Tests (S. Goncharov et al.) 4. Minimising the Probabilistic Bisimilarity Distance (S. Kiefer et al.) **best paper nominee** |
15:00-15:30 | Break | |
15:30-17:00 | Test of Time and Business Meeting & Group Photo | |
18:00-20:00 | Indigenous Performance & Dinner |
Day 3 - Thursday, September 12
Time | Session | Details |
---|---|---|
09:00-10:00 | Invited | Thomas Wies |
10:00-10:45 | Break | |
10:45-12:00 | Process Algebra |
1. Effect Semantics for Quantum Process Calculi (L. Ceragioli et al.) 2. Branching Bisimilarity for Processes with Time-outs (G. Reghem et al.) 3. Around Classical and Intuitionistic Linear Processes (J. Jaramillo et al.) 4. Passive Learning of Regular Data Languages in Polynomial Time and Data (M Balachander et al.) |
12:00-13:30 | Lunch | |
13:30-15:00 | Automata and Logic I |
1. Invariants for One-Counter Automata with Disequality Tests (D. Chistikov et al.) 2. An automata-based approach for synchronizable mailbox communication (R. Delpy et al.) **best paper nominee** 3. Nominal Tree Automata With Name Allocation (S. Prucker et al.) 4. Passive Learning of Regular Data Languages in Polynomial Time and Data (M. Balachander et al.) |
15:00-15:30 | Break | |
15:30-17:00 | Probabilistic |
1. A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs (M. Suilen et al.) **best paper nominee** 2. Risk-averse optimization of total rewards in Markovian models using deviation measures (C. Baier et al.) **best paper nominee** 3. A Spectrum of Approximate Probabilistic Bisimulations (T. Spork et al.) 4. Causally Deterministic Markov Decision Processes (S. Akshay et al.) |
Day 4 - Friday, September 13
Time | Session | Details |
---|---|---|
09:00-10:00 | Invited | Arie Gurfinkel |
10:00-10:30 | Break | |
10:30-12:00 | Automata and Logic II |
1. History-Determinism vs Fair Simulation (Udi Boker et al.) 2. Reversible Transducers over Infinite Words (L. Dartois et al.) 3. Validity of Contextual Formulas (J. Esparza et al.) 4. RobTL: Robustness Temporal Logic for CPS (V. Castiglioni et al.) |
12:00-13:30 | Lunch | |
13:30-15:00 | Model Checking |
1. Centralized vs Decentralized Monitors for Hyperproperties (J. Wagemaker et al.) 2. Automating Memory Model Metatheory with Intersections (A. Koutsouridis et al.) 3. Computing Inductive Invariants of Regular Abstraction Frameworks (V. Krasotin et al.) 4. MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm (S. Akshay et al.) |
15:00-15:30 | Break | |
15:30-17:00 | Probabilistic |
1. Progress, Justness and Fairness in Modal mu-Calculus Formulae (M. Spronck et al.) 2. Fairness and Consensus in Opinion Models (S. Betancourt et al.) **best paper nominee** 3. Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions (L. Stoltenow et al.) **best paper nominee** |
17:30-19:30 | Women Networking Night |