SAT and SMT Solving.- DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories.- Z3-Noodler: An Automata-based String Solver.- TaSSAT: Transfer and Share SAT.- Speculative SAT modulo SAT.- Happy Ending: An Empty Hexagon in Every Set of 30 Points.- Synthesis.- Fully Generalized Reactivity(1) Synthesis.

- Knor: reactive synthesis using Oink.- On Dependent Variables in Reactive Synthesis.- CESAR: Control Envelope Synthesis via Angelic Refinements.- Logic and Decidability.- Answering Temporal Conjunctive Queries over Description Logic Ontologies for Situation Recognition in Complex Operational Domains.- Deciding Boolean Separation Logic via Small Models.- Asynchronous Subtyping by Trace Relaxation.- Program Analysis and Proofs.

- SootUp: A Redesign of the Soot Static Analysis Framework.- Formally verified asymptotic consensus in robust networks.- Formally Verifying an Efficient Sorter.- Explainable Online Monitoring of Metric First-Order Temporal Logic.- Proof Checking.- IsaRare: Automatic Veri cation of SMT Rewrites in Isabelle/HOL.- Automate where Automation Fails: Proof Strategies for Frama-C/WP.- VeSCMul: Verified Implementation of S-C-Rewriting for Multiplier Verification.

- A Logical Treatment of Finite Automata.- A State-of-the-Art Karp-Miller Algorithm Certified in Coq.