Foundations of software science and computation structures : 27th International Conference, FoSSaCS 2024, held as part of the European Joint Conferences on Theory and Practice of S...

Table of Contents: “…Types and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability.…”
CONNECT
CONNECT

Programming languages and systems : 30th European Symposium on Programming, ESOP 2021, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021...

Table of Contents: “…The Decidability of Verification under PS 2.0 -- Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains -- Types for Complexity of Parallel Computation in Pi-Calculus -- Checking Robustness Between Weak Transactional Consistency Models -- Verified Software Units -- An Automated Deductive Verication Framework for Circuit-building Quantum Programs -- Nested Session Types -- Coupled Relational Symbolic Execution for Differential Privacy -- Graded Hoare Logic and its Categorical Semantics -- Do Judge a Test by its Cover: Combining Combinatorial and Property-Based Testing -- For a Few Dollars More -- Verified Fine-Grained Algorithm Analysis Down to LLVM -- Run-time Complexity Bounds Using Squeezers -- Complete trace models of state and control -- Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols -- Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages -- Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere -- Graded Modal Dependent Type Theory -- Automated Termination Analysis of Polynomial Probabilistic Programs -- Bayesian strategies: probabilistic programs as generalised graphical models -- Temporal Refinements for Guarded Recursive Types -- Query Lifting: Language-integrated query for heterogeneous nested collections -- Reverse AD at Higher Types: Pure, Principled and Denotationally Correct -- Sound and Complete Concolic Testing for Higher-order Functions -- Strong-Separation Logic.…”
CONNECT
CONNECT

Tools and algorithms for the construction and analysis of systems : 29th International Conference, TACAS 2023, held as part of the European Joint Conferences on Theory and Practice...

Table of Contents: “…Tool Demos -- EVA: a Tool for the Compositional Verification of AUTOSAR Models -- WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification -- Multiparty Session Typing in Java, Deductively -- PyLTA: A Verification Tool for Parameterized Distributed Algorithms -- FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format -- Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit -- Combinatorial Optimization/Theorem Proving -- New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization -- Verified reductions for optimization -- Specifying and Verifying Higher-order Rust Iterators -- Extending a High-Performance Prover to Higher-Order Logic -- Tools (Regular Papers) -- The WhyRel Prototype for Relational Verification of Pointer Programs -- Bridging Hardware and Software Analysis with Btor2C: A Word-Level-Circuit-to-C Converter -- CoPTIC: Constraint Programming Translated Into C -- Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability -- Synthesis -- Computing Adequately Permissive Assumptions for Synthesis -- Verification-guided Programmatic Controller Synthesis -- Taming Large Bounds in Synthesis from Bounded-Liveness Specifications -- Lockstep Composition for Unbalanced Loops -- Synthesis of Distributed Agreement-Based Systems with Effciently Decidable Verification -- LTL Reactive Synthesis with a Few Hints -- Timed Automata Verification and Synthesis via Finite Automata Learning -- Graphs/Probabilistic Systems -- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition -- Transforming quantified Boolean formulas using biclique covers -- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration -- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants -- Runtime Monitoring/Program Analysis -- Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote -- Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis -- Explainable Online Monitoring of Metric Temporal Logic -- 12th Competition on Software Verification -- SV-COMP 2023 -- Competition on Software Verification and Witness Validation: SV-COMP 2023 -- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation (Competition Contribution) -- 2LS: Arrays and Loop Unwinding (Competition Contribution) -- Bubaak: Runtime Monitoring of Program Verifiers (Competition Contribution) -- EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs (Competition Contribution) -- Goblint: Autotuning Thread-Modular Abstract Interpretation (Competition Contribution) -- Java Ranger: Supporting String and Array Operations (Competition Contribution) -- Korn-Software Verification with Horn Clauses (Competition Contribution) -- Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution) -- PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution) -- Ultimate Automizer and the CommuHash Normal Form (Competition Contribution) -- Ultimate Taipan and Race Detection in Ultimate (Competition Contribution) -- VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution) -- VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution).…”
CONNECT
CONNECT

Tools and algorithms for the construction and analysis of systems : 27th International Conference, TACAS 2021, held as part of the European Joint Conferences on Theory and Practice...

Table of Contents: “…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).…”
CONNECT
CONNECT