RAMiCS 2018 featured three invited speakers: Roland Backhouse, Philippa Gardner, and Manuel Bodirsky.

## Roland Backhouse

Roland Backhouse is Emeritus Professor of Computing Science at the University of Nottingham, where he had tenure from 1999-2013. Until 1999 he was full professor of computer science at the Technical University of Eindhoven and the Rijksuniversiteit Groningen. His research covers relational theory of data types, generic programming, applications of regular algebra, syntax analysis, language theory, category theory, and fixed-point calculus.

Backhouse is known for applying algebraic methods in the mathematics of program construction. His books are standard textbooks in many computer science curricula. He is a well-known researcher in the field of relation algebras and has been a major contributor to RAMiCS in its early days. Since his first publication in 1975 on applying regular algebra to path-finding problems, the focus of his research has been on combining precision with concision in the formal calculation of algorithms. Whilst in the Netherlands, he and his group played a prominent role in the STOP (Specification and Transformation of Programs) project.

Three publications:

- Roland Carl Backhouse, Factor theory and the unity of opposites. J. Log. Algebr. Meth. Program. 85(5): 824-846 (2016)
- Roland Carl Backhouse, First-past-the-post games. Sci. Comput. Program. 85: 166-203 (2014)
- Roland Carl Backhouse, Regular algebra applied to language problems. J. Log. Algebr. Program. 66(2): 71-111 (2006)

## Philippa Gardner

Philippa Gardner is a professor in the Department of Computing at Imperial College London and leader of the research group working on Verified Trustworthy Software Specification. Her current research focusses on program verification: in particular, reasoning about Web programs (JavaScript and DOM); and reasoning about concurrent programs.

She completed her PhD thesis, supervised by Professor Gordon Plotkin FRS at Edinburgh in 1992. She moved to Cambridge in 1998 on an EPSRC Advanced Fellowship, hosted by Professor Robin Milner FRS. She obtained a lectureship at Imperial in 2001, and became professor in 2009. She held a Microsoft Research Cambridge/Royal Academy of Engineering Senior Fellowship from 2005 to 2010 at Imperial.

Philippa directs the Research Institute on Verified Trustworthy Software Systems (VeTSS), funded by EPSRC, from 2017 to 2022. She also chairs the BCS awards committee, which decides the Lovelace medal (senior) and Roger Needham award (mid-career) for computer science and engineering.

Professor Gardner will contribute to RAMICS by talking about compositional abstract specifications of concurrent programs. This topic requires formal methods, so we expect a refreshing perspective of her contribution to RAMiCS 2018.

Three publications:

- Thomas Dinsdale-Young, Redro da Rocha Pinto, Philippa Gardner. A Perspective on Specifying and Verifying Concurrent Modules, survey paper, Journal of Logical and Algebraic Methods in Programming, to appear
- Shale Xiong, Pedro da Rocha Pinto, Gian Ntzik, Philippa Gardner, Abstract Specifications for Concurrent Maps, Proceedings of the 26th European Symposium on Programming (ESOP’17), pp. 964–990, Apr 2017
- Pedro da Rocha Pinto, Thomas Dinsdale-Young, Philippa Gardner, Julian Sutherland, Modular Termination Verification for Non-blocking Concurrency, Proceedings of the 25th European Symposium on Programming (ESOP’16), pp. 176–201, Apr 2016

## Manuel Bodirsky

Manuel Bodirsky is professor of Algebra and Discrete Structures at the TU Dresden since August 2014. From 2008 to 2014 he has been a researcher at the French National Center for Scientific Research (CNRS) at the Ecole Polytechnique in Paris.

Bodirsky is known for his work in constraint satisfaction problems. His other interests are universal algebra, finite model theory and enumerative combinatorics.

As a research area, constraint satisfaction problems have a big potential overlap with RAMiCS topics, but this has not been explored so far. For this reason the contribution of Manuel Bodirsky will expand the scope of RAMiCS into this application area.

Three publications:

- Manuel Bodirsky, Peter Jonsson, A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. 58: 339-385 (2017)
- Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker, Distance constraint satisfaction problems. Inf. Comput. 247: 87-105 (2016)
- Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper, Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14(4): 30:1-30:19 (2013)