BCTCS & SMLS Bath 2024: Programme

The event will take place in the Chancellors' Building. Talks will be held in CB 1.12 and CB 4.1, while coffee and lunch will take place in the Level 1 Foyer. Please go back to the main page for general information. A full list of abstracts is also available.

Thursday 4 April (BCTCS)

• 10:30–11:00 (L1 Foyer) Arrival and welcome
• 11:00–11:50 (CB 1.12) Invited talk: Anupam Das (University of Birmingham)
  Proof theoretic approaches for regular languages (and beyond)
• 12:00–12:30 (CB 1.12) Pete Austin, University of Liverpool
  Parity Games on Temporal Graphs
• 12:30–13:00 (CB 1.12) Karl Boddy, Newcastle University
  Bounded clique-width versus well-quasi-orderability by induced subgraphs
• 12:00–12:30 (CB 4.1) Lukas Holter Melgaard, University of Birmingham
  Cyclic proofs for (arithmetical) inductive definitions
• 12:30–13:00 (CB 4.1) Chris Purdy, Royal Holloway, University of London
  A cyclical proof system for higher-order fixed point logic
• 13:00–14:00 (L1 Foyer) Lunch
• 14:00–14:30 (CB 1.12) Tala Eagling-Vose, Durham University
  Graph Homomorphisms, Colouring Games, and Forbidden Subgraphs
• 14:30–15:00 (CB 1.12) Kheeran Naidu, University of Bristol
  Multi-Pass Streaming Lower Bounds for Graph Problems
• 15:00–15:30 (CB 1.12) Tymofii Prokopenko, University of Liverpool
  Capturing an invisible robber on a planar graph
• 14:00–14:30 (CB 4.1) Thomas Karam, University of Oxford
  Fourier analysis modulo p on the Boolean cube
• 14:30–15:00 (CB 4.1) Tansholpan Zhanabekova, University of Liverpool
  Semantic Flowers for Good-for-Games and Deterministic Automata
• 15:00–15:30 (CB 4.1) Ian Price, Swansea University
  Two-Way Reversible Transducers as Functors
• 15:30–16:00 (L1 Foyer) Coffee and discussion
• 16:00–16:50 (CB 1.12) Invited talk: Stuart Matthews (Capgemini)
  Software engineering with formal methods: Quality, Time & Cost
• 17:00–17:30 (CB 1.12) Hollie Baker, University of Bath
  Smooth stratification: an efficient implementation using SACLIB
• 17:30–18:00 (CB 1.12) Nathan Flaherty, University of Liverpool
  Collision-Free Robot Scheduling
• 17:00–17:30 (CB 4.1) Giulio Guerrieri, University of Sussex
  The theory of meaningfulness in the call-by-value lambda-calculus
• 17:30–18:00 (CB 4.1) Riccardo Treglia, Kings College London
  Monadic Intersection Types, Relationally
• 18:00 (CB 4.1) BCTCS annual general meeting
• 19:00 Reservation for dinner at Pearl of India Restaurant

Friday 5 April (BCTCS & SMLS)

• 09:30–10:00 (CB 1.12) Xin Ye, Durham University
  Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
• 10:00–10:30 (CB 1.12) David Kutner, Durham University
  Reconfigurable routing in data center networks
• 09:00–09:30 (CB 4.1) Marc Thatcher, University of Sussex
  Parallel Functional Programming with Interaction Nets
• 09:30–10:00 (CB 4.1) Andrew Ryzhikov, University of Oxford
  Fixed Vector Addition Systems and Bounded Arithmetic
• 10:00–10:30 (CB 4.1) Iris van der Giessen, University of Birmingham
  Intuitionistic Gödel-Löb Logic, à la Simpson: Proof Theory and Birelational Semantics
• 10:30–11:00 (L1 Foyer) Coffee and discussion
• 11:00–11:50 (CB 1.12) Invited talk: Alex Kavvos (University of Bristol)
  Two-dimensional Kripke Semantics
• 12:00–12:30 (CB 1.12) Adithya Diddapur, University of Bristol
  Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting
• 12:30–13:00 (CB 1.12) Cezar-Mihail Alexandru, University of Bristol
  Interval Selection in Sliding Windows
• 12:00–12:30 (CB 4.1) Sean Watters, University of Strathclyde
  Extensional Finite Sets and Multisets in Agda
• 12:30–13:00 (CB 4.1) James Swire, Swansea University
  An empirical evaluation of a quality assurance process: A case study in the railway sector
• 13:00–14:00 (L1 Foyer) Lunch and SMLS arrival
• 14:00–14:50 (CB 1.12) Invited talk: Monika Seisenberger (Swansea University)
  Logic in Railway Verification
• 14:50–15:10 (CB 1.12) Formal close of BCTCS - all participants welcome to stay for SMLS
• 15:10–15:40 (CB 1.12) George Kaye, University of Birmingham
  A Fully Compositional Theory of Sequential Digital Circuits
• 15:40–16:10 (CB 1.12) Alessandro Di Giorgio, University College London
  Diagrammatic Algebra of First-Order Logic
• 16:10–16:40 (CB 1.12) Jingjie Yang, University of Oxford
  Weighted register automata and representation theory
• 16:40–17:10 (L1 Foyer) Coffee and discussion
• 17:10–18:00 (CB 1.12) Davide Barbarossa, University of Bath
  An overview of (Tropical) Quantitative Semantics and Taylor Expansion for lambda-calculus
• 19:00 Informal plans for dinner and socialising (TBC)