Verification column

Given the extensive applications of logics with concrete domains in verification and related areas, the shortage of an accessible survey on the topic is quite surprising. This article does much more than fill the gap, providing also useful and inspiring pointers for future work.

Concrete domains in logics

In this short survey, we present logical formalisms in which reasoning about concrete domains is embedded in formulae at the atomic level. These include temporal logics with concrete domains, description logics with concrete domains as well as variant formalisms. We discuss several proof techniques to solve logical decision problems for such formalisms, including those based on constrained automata or on translation into decidable second-order logics. We also present recent results mainly related to decidability and complexity as well as a selection of open problems.

Verification column

This quarter's article expertly leads us from foundations to state-of-the-art in multiplayer turn-based infinite-duration games for synthesis of reactive systems. Providing examples throughout and an extensive coverage of related work, I expect it will quickly become a standard reference in the field.

Synthesis of equilibria in infinite-duration

In this survey, we propose a comprehensive introduction to game theory applied to computer-aided synthesis. We study multi-player turn-based infinite-duration games played on a finite directed graph such that each player aims at maximizing a payoff function. We present the well-known notions of Nash equilibrium and subgame perfect equilibrium, as well as interesting strategy profiles of players as response to the strategy announced by a specific player. We provide classical and recent results about the related threshold synthesis problem.

The 2021 Alonzo Church award for outstanding contributions to logic and computation

An annual award, called the Alonzo Church Award for Outstanding Contributions to Logic and Computation, was established in 2015 by the ACM Special Interest Group for Logic and Computation (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Gödel Society (KGS). The award is for an outstanding contribution represented by a paper or by a small group of papers published within the past 25 years. This time span allows the lasting impact and depth of the contribution to have been established. The award can be given to an individual, or to a group of individuals who have collaborated on the research. For the rules governing this award, see https://siglog.org/alonzo-church-award/, https://www.eatcs.org/index.php/church-award/, and https://eacsl.org/. The 2020 Alonzo Church Award was given jointly to Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa, and Wang Chiew Tan for their ground-breaking work on laying the logical foundations for data exchange. Lists containing this and all previous winners can be found through the links above.