Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes?

Martin Jonáš and Jan Strejček

Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing

Benjamin Farinier, Robin David, Sébastien Bardin and Matthieu Lemerre

Graphs Path Orderings

Nachum Dershowitz and Jean-Pierre Jouannaud

When Are Two Gossips the Same?

Krzysztof Apt, Davide Grossi and Wiebe van der Hoek

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Alexander Svozil

Towards Smarter MACE-style Model Finders

Mikolas Janota and Martin Suda

Loop Analysis by Quantification over Iterations

Simon Robillard, Bernhard Gleiss and Laura Kovács

Wayeb: a Tool for Complex Event Forecasting

Elias Alevizos, Alexander Artikis and Georgios Paliouras

Decidable Inequalities over Infinite Trees

Sabine Bauer, Steffen Jost and Martin Hofmann

In Memory of Martin Hofmann

Steffen Jost

Completeness of Left Handed Kleene algebra via Cyclic Proofs

Anupam Das, Amina Doumane and Damien Pous

Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse

Chuan Jiang and Gianfranco Ciardo

Why These Automata Types?

Udi Boker

Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets

Jaroslav Bendík and Ivana Cerna

Rewriting Environment for Arithmetic Circuit Verification

Cunxi Yu, Atif Yasin, Tiankai Su, Alan Mishchenko and Maciej Ciesielski

Function Summarization Modulo Theories

Sepideh Asadi, Martin Blicha, Grigory Fedyukovich, Antti Hyvärinen, Karine Even-Mendoza, Natasha Sharygina and Hana Chockler

Polymorphic success types for Erlang

Francisco J. López-Fraguas, Manuel Montenegro and Gorka Suárez-García

Alternating Reachability Games with Behavioral and Revenue Objectives

Orna Kupferman and Tami Tamir

HoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography

Paventhan Vivekanandan

A Verified Efficient Implementation of the LLL Basis Reduction Algorithm

Ralph Bottesch, Max W. Haslbeck and René Thiemann

A Theory of Satisfiability-Preserving Proofs in SAT Solving

Adrián Rebola Pardo and Martin Suda