Tabla de Contenidos: “…Theorem Proving -- Unification with Abstraction and Theory Instantiation in Saturation-based Reasoning -- Efficient verification of imperative programs using auto2 -- Frame Inference for Inductive Entailment Proofs in Separation Logic -- Verified Model Checking of Timed Automata -- SAT and SMT I -- Chain Reduction for Binary and Zero-Suppressed Decision Diagrams -- CDCLSym: Introducing E_ective Symmetry Breaking in SAT Solving -- Automatic Generation of Precise and Useful Commutativity Conditions -- Bit-Vector Model Counting using Statistical Estimation -- Deductive Verification -- Hoare Logics for Time Bounds -- A Verified Implementation of the Bounded List Container -- Automating Deductive Verification for Weak-Memory Programs -- Software Verification and Optimisation -- Property Checking Array Programs Using Loop Shrinking -- Invariant Synthesis for Incomplete Verification Engines -- Accelerating Syntax-Guided Invariant Synthesis -- Daisy - Framework for Analysis and Optimization of Numerical Programs -- Model Checking -- Oink: an Implementation and Evaluation of Modern Parity Game Solvers -- More Scalable LTL Model Checking via Discovering Design-Space Dependencies (D^3) -- Generation of Minimum Tree-like Witnesses for Existential CTL -- From Natural Projection to Partial Model Checking and Back -- Machine Learning -- ICE-based Refinement Type Discovery for Higher-Order Functional Programs -- Strategy Representation by Decision Trees in Reactive Synthesis -- Feature-Guided Black-Box Safety Testing of Deep Neural Networks. …”

Tabla de Contenidos: “…Verification Techniques (not SMT) -- Directed Reachability for Infinite-State Systems -- Bridging Arrays and ADTs in Recursive Proofs -- A Two-Phase Approach for Conditional Floating-Point Verification -- Symbolic Coloured SCC Decomposition -- Case Studies -- Local Search with a SAT Oracle for Combinatorial Optimization -- Analyzing Infrastructure as Code to Prevent Intra-update Sniping Vulnerabilities -- Proof Generation/Validation -- Certifying Proofs in the First-Order Theory of Rewriting -- Syntax-Guided Quantifier Instantiation -- Making Theory Reasoning Simpler -- Deductive Stability Proofs for Ordinary Differential Equations -- Tool Papers -- An SMT-Based Approach for Verifying Binarized Neural Networks -- cake lpr: Verified Propagation Redundancy Checking in CakeML -- Deductive Veri cation of Floating-Point Java Programs in KeY -- Helmholtz: A Verifier for Tezos Smart Contracts Based on Refinement Types -- SyReNN: A Tool for Analyzing Deep Neural Networks -- MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers -- dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts -- Tool Demo Papers -- HLola: a Very Functional Tool for Extensible Stream Runtime Verification -- AMulet 2.0 for Verifying Multiplier Circuits -- RTLola on Board: Testing Real Driving Emissions on your Phone -- Replicating Restart with Prolonged Retrials: An Experimental Report -- A Web Interface for Petri Nets with Transits and Petri Games -- Momba: JANI Meets Python -- SV-Comp Tool Competition Papers -- Software Veri cation: 10th Comparative Evaluation (SV-COMP 2021) -- CPALockator: Thread-Modular Approach with Projections (Competition Contribution) -- Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution) -- Gazer-Theta: LLVM-based Veri er Portfolio with BMC/CEGAR (Competition Contribution) -- Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints (Competition Contribution) -- Towards String Support in JayHorn (Competition Contribution) -- JDart: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution) -- Symbiotic 8: Beyond Symbolic Execution (Competition Contribution) -- VeriAbs: A Tool for Scalable Verification by Abstraction (Competition Contribution)…”

Tabla de Contenidos:

Tabla de Contenidos: “…3 At-Least-K Conjunctive Normal Form (KNF) -- 4 Cardinality Constraint Extraction and Analysis -- 4.1 Extraction -- 4.2 Analysis with BDDs -- 4.3 PySAT Encodings Experimental Evaluation -- 5 Cardinality Conflict-Driven Clause Learning -- 5.1 Implementation Details -- 5.2 Inprocessing Techniques -- 6 Proof Checking -- 6.1 Satisfying Assignments -- 6.2 Clausal Proofs -- 6.3 Starting with KNF Input -- 7 Experimental Evaluation -- 7.1 SAT Competition Benchmarks -- 7.2 Magic Squares and Max Squares -- 8 Conclusion and Future Work -- References -- CaDiCaL 2.0 -- 1 Introduction -- 2 Architecture -- 3 External Propagator -- 4 Proofs -- 5 Tracer Interface -- 6 Constraints and Flipping -- 7 Interpolation -- 8 Testing and Debugging -- 9 Experiments -- 10 Conclusion -- References -- Formally Certified Approximate Model Counting -- 1 Introduction -- 2 Related Work -- 3 Background -- 3.1 Approximate Model Counting -- 3.2 Formalization in Isabelle/HOL -- 4 Approximate Model Counting in Isabelle/HOL -- 4.1 Abstract Specification and Probabilistic Analysis -- 4.2 Concretization to a Certificate Checker -- 4.3 Extending ApproxMC to ApproxMCCert -- 4.4 CNF-XOR Unsatisfiability Checking -- 5 Experimental Evaluation -- 6 Conclusion and Future Work -- References -- Scalable Bit-Blasting with Abstractions -- 1 Introduction -- 2 Preliminaries -- 3 Abstraction-Refinement Framework -- 4 Refinement Schemes -- 4.1 Hand-Crafted Lemmas -- 4.2 Lemma Scoring Scheme -- 4.3 Synthesizing Lemmas via Abduction -- 4.4 Lemma Verification -- 5 Integration -- 6 Evaluation -- 7 Conclusion -- References -- Hardware Model Checking -- The MoXI Model Exchange Tool Suite -- 1 Overview -- 2 Intermediate Language -- 3 Tool Suite -- 3.1 Translators -- 3.2 Utilities -- 4 Tool Suite Validation -- 5 Benchmarks -- 6 Conclusion and Future Work -- References -- SMLP: Symbolic Machine Learning Prover…”

Tabla de Contenidos: “…Sorting Data Using Merge Sort and Quick Sort -- Understanding why sorting data is important -- Employing better sort techniques -- Using Search Trees and the Heap -- Considering the need to search effectively -- Building a binary search tree -- Performing specialized searches using a binary heap -- Relying on Hashing -- Putting everything into buckets -- Avoiding collisions -- Creating your own hash function -- Part 3 Exploring the World of Graphs -- Chapter 8 Understanding Graph Basics -- Explaining the Importance of Networks -- Considering the essence of a graph -- Finding graphs everywhere -- Showing the social side of graphs -- Understanding subgraphs -- Defining How to Draw a Graph -- Distinguishing the key attributes -- Drawing the graph -- Measuring Graph Functionality -- Counting edges and vertexes -- Computing centrality -- Putting a Graph in Numeric Format -- Adding a graph to a matrix -- Using sparse representations -- Using a list to hold a graph -- Chapter 9 Reconnecting the Dots -- Traversing a Graph Efficiently -- Creating the graph -- Applying breadth-first search -- Applying depth-first search -- Determining which application to use -- Sorting the Graph Elements -- Working on Directed Acyclic Graphs (DAGs) -- Relying on topological sorting -- Reducing to a Minimum Spanning Tree -- Getting the minimum spanning tree historical context -- Working with unweighted versus weighted graphs -- Creating a minimum spanning tree example -- Discovering the correct algorithms to use -- Introducing priority queues -- Leveraging Prim's algorithm -- Testing Kruskal's algorithm -- Determining which algorithm works best -- Finding the Shortest Route -- Defining what it means to find the shortest path -- Adding a negative edge -- Explaining Dijkstra's algorithm -- Explaining the Bellman-Ford algorithm -- Explaining the Floyd-Warshall algorithm…”