The colloquium will take place in room TL325 in the Learning and Teaching Building on the University of Strathclyde campus. Parallel tracks will take place in rooms TL325A and TL325B respectively.
| Time (BST) | Monday 14 April | Tuesday 15 April | Wednesday 16 April | |||
|---|---|---|---|---|---|---|
| 9:30–10:00 | Dependent type theory: from propositions and sets to spaces [s] Nicolai Kraus (TL325A) |
How temporal locality can help us solve problems on temporal graphs Jess Enright (TL325A) |
||||
| 10:00–10:30 | Registration and coffee (TL324) |
|||||
| 10:30–11:00 | Homotopy and complexity of graph colouring [s] Jakub Opršal (TL325A) |
Coffee break | Coffee break | |||
| 11:00–11:30 | On hypergraph colouring variants and inapproximability [s] Zephyr Verwimp (TL325A) |
Decorated Para for linear quadratic regulators [s] Riu Rodríguez Sakamoto (TL325B) |
A recipe for the semantics of reversible programming Louis Lemonnier (TL325A) |
Proof translations for structurally different sequent calculi of intuitionistic modal logic Justus Becker (TL325B) |
||
| 11:30–12:00 | Proof Checking for SMT-solving and its application in the Railway Domain [s] Harry Bryant (TL325A) |
Alternating-Time Temporal Logic with Dependent Strategies [s] Jessica Newman (TL325A) |
Quantale Enriched Semantics for Graph Mathematical Morphology [s] Ignacio Bellas Acosta (TL325B) |
A coarse Erdős-Pósa theorem Jungho Ahn (TL325A) |
A declarative approach to specifying distributed algorithms using three-valued modal logic Murdoch Gabbay (TL325B) |
|
| 12:00–13:00 | Lunch | Lunch | Lunch | |||
| 13:00–13:30 | Making the most of large language models for program synthesis (when you want correct answers) [s] Elizabeth Polgreen (TL325A) |
Ensuring Liveness Properties of Distributed Systems with Justness [s] Rob van Glabeek (TL325A) |
Talking Out Of School Conor McBride (TL325A) |
|||
| 13:30–14:00 | ||||||
| 14:00–14:30 | Adapting some basic matrix rank properties to the ranks of tensors Thomas Karam (TL325A) |
An Algebraic Characterization of NC1 [s] Aidan Evans (TL325A) |
From Visualization to Coding: Practicing Graphical Loop Invariants in CAFÉ 2.0 Géraldine Brieven (TL325A) |
|||
| 14:30–15:00 | Coffee break | Coffee break | Coffee break | |||
| 15:00–15:30 | Creating Synthetic Test Data for Rail Design Tools [s] Marek Jezinski (TL325A) |
A data type of intrinsically plane graphs [s] Malin Altenmüller (TL325B) |
Developing user propagators for graph-based SMT reasoning [s] Alec Critten (TL325A) |
Modelling cybersecurity games with compositional game theory [s] Aven Dauz (TL325B) |
Type Directed Programming for Programming Education Alasdair Lambert (TL325A) |
|
| 15:30–16:00 | Fast and Safe Scheduling of Robots [s] Nathan Flaherty (TL325A) |
Temporal Explorability Games [s] Pete Austin (TL325B) |
Algorithmic syntactic causal identification [s] Dhurim Cakiqi (TL325A) |
Coalgebraic Traces by Following Strategies in Two-player Games [s] Benjamin Plummer (TL325B) |
Linking Proof Theory to Game Design Paola Bruscoli (TL325A) |
|
| 10 minute break | ||||||
| 16:00–16:15 | 15 minute break | 15 minute break | Communication of theoretical computer science notions, and mathematics Thomas Karam (TL325A) |
|||
| 16:15–16:30 | Visualising the Hyperbolic Plane Yury Savateev (TL325A) |
Bounded Henkin Quantifiers and the Exponential Time Hierarchy [s] Abhishek De (TL325B) |
Semantic Flowers for Good-for-Games and Deterministic Automata [s] Tansholpan Zhanabekova (TL325A) |
Breaking records: structural subtyping as a language design principle [s] Jakub Bachurski (TL325B) |
||
| 16:30–16:45 | The Art of Teaching Theory Across Diverse Backgrounds Olga Petrovska (TL325A) |
|||||
| 16:45–17:15 | The similar connected partition problem [s] Lewis Dyer (TL325A) |
A shallow arithmetisation of first-order validity [s] Murdoch Gabbay (TL325B) |
Structural Parameters for Dense Temporal Graphs [s] Laura Larios-Jones (TL325A) |
|||
| 17:15–18:15 | BCTCS Annual General Meeting | |||||
| 19:00–... | Colloquium dinner Nonna Said |
|||||