Game Theory -- A Game for Linear-time - Branching-time Spectroscopy -- On Satisficing in Quantitative Games -- Quasipolynomial Computation of Nested Fixpoints -- SMT Verification -- A Flexible Proof Format for SAT Solver-Elaborator Communication -- Generating Extended Resolution Proofs with a BDD-Based SAT Solver -- Bounded Model Checking for Hyperproperties -- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays -- SAT Solving with GPU Accelerated Inprocessing -- FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions -- Probabilities -- Finding Provably Optimal Markov Chains -- Inductive Synthesis for Probabilistic Programs Reaches New Horizons -- Analysis of Markov Jump Processes under Terminal Constraints -- Multi-objective Optimization of Long-run Average and Total Rewards -- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes -- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests -- Timed Systems -- Timed Automata Relaxation for Reachability -- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata -- Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring -- Neural Networks -- Synthesizing Context-free Grammars from Recurrent Neural Networks -- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models -- Improving Neural Network Verification through Spurious Region Guided Refinement -- Analysis of Network Communication Resilient Capacity-Aware Routing -- Network Traffic Classification by Program Synthesis. .