Schedule (preliminary)

RAMiCS 2018 runs from October 29th 2018 to Thursday November 1st. This conference program is preliminary. Please expect minor changes in this schedule.

time Session Topic
Monday, October 29th 2018
9:30 Shuttle leaves from hotel
9:45 Shuttle arrives at venue. Walk-in
10:00 Opening Stef Joosten. Welcome
10:15 Invited Philippa Gardner. Scalable reasoning about concurrent programs
11:15 Break
11:45 Reactive Programming Simon Foster, Kangfeng Ye, Ana Cavalcanti and Jim Woodcock. Calculational verification of reactive programs with reactive relations and Kleene algebra
12:15 Lunch
13:45 Semirings Hans Leiß and Mark Hopkins. C-Dioids and µ-continuous Chomsky algebras
14:15 Semirings Hans Leiß and Mark Hopkins. Coequalizers and tensor products for continuous idempotent semirings
14:45 Break
15:30 Semirings Roland Glück. Distances, norms and error propagation in idempotent semirings
16:00 Semirings Nikolai Krivulin. Algebraic solution of minimax single-facility constrained location problems
16:30 Shuttle leaves at 16.30 from the venue.
16:45 Shuttle arrives at the Hotel. Evening off in Groningen
Tuesday
8:45 Shuttle leaves from Hotel.
9:00 Shuttle arrives at Venue.
09:00 Relation Algebras Michael Winter. T-norm based operations in arrow categories
09:30 Relation Algebras Robin Hirsch. Decidability of equational theories for sub-signatures of relation algebra.
10:00 Relation Algebras Koki Nishizawa and Norihiro Tsumagari. Composition of different-type relations via the Kleisli category for the continuation monad
10:30 Break
11:15 Tutorial Relation algebra in the classroom with Ampersand
12:15 Lunch.
13:30 Social event, bus leaves from the Venue.
Evening Conference dinner.
Wednesday
8:45 Shuttle leaves from hotel.
09:00 Invited Manuel Bodirsky. Finite relation algebras with normal representations
10:00 Applications and Tools Maximiliano Cristia and Gianfranco Rossi. A set solver for finite relation algebra
10:30 Break
11:15 Applications and Tools Lefteris Kirousis, Phokion Kolaitis and John Livieratos. On the computational complexity of non-dictatorial aggregation
11:45 Applications and Tools Wolfram Kahl. Calculational relation-algebraic proofs in the teaching tool CalcCheck
12:15 Lunch.
13:45 Spatial Reasoning Giulia Sindoni, Katsuhiko Sano and John G. Stell. Axiomatizing discrete spatial relations
14:15 Spatial Reasoning Pranab Kumar Ghosh and Michael Winter. A modal and relevance logic for qualitatives spatial reasoning
14:45 Break
15:15 Algebras Sarah Alexander, Peter Jipsen and Nadiya Upegui. On the structure of generalized effect algebras and separation algebras
15:45 Business meeting.
17:30 Scholars meet Software Engineers.
20:00 Shuttle leaves from the venue.
Thursday
8:45 Shuttle leaves from Hotel.
09:00 Invited Roland Backhouse. The importance of factorisation in algorithm design
10:00 Verification Jonathan Huerta Y Munive and Georg Struth. Verifying hybrid systems with modal Kleene algebra
10:30 Break
11:15 Verification Roland Glück, Bernhard Möller and Jessica Ertel. Algebraic derivation of Until rules and application to timer verification
11:45 Verification Peter Höfner and Callum Bannister. False failure: Creating failure models for separation logic
12:15 Lunch.
13:45 Protocols Malvin Gattinger and Jana Wagemaker. Towards an analysis of dynamic gossip in NetKAT
14:15 Protocols Dexter Kozen and Matvey Soloviev. Coalgebraic tools for randomness-conserving protocols
14:45 Break
15:30 Algebras Stefano Bonzio, Michele Pra Baldi and Diego Valota. Counting finite linearly ordered involutive bisemilattices
16:00 Algebras Maria João Gouveia and Luigi Santocanale. MIX star-autonomous quantales and the continuous weak Bruhat order
16:30 Closure.