Search Results - Higher-Order and Symbolic Computation

A Generalization of Bohr-Mollerup's Theorem for Higher Order Convex Functions by Marichal, Jean-Luc, Zenaïdi, Naïm

Link to Metadata

Foundations of Software Science and Computation Structures 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Sof...

Table of Contents: “…Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata.…”
Link to Metadata

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 o...

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 Verifierfor 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). .…”
Link to Metadata

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 areDifferentiable 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. .…”
Link to Metadata

Tools and Algorithms for the Construction and Analysis of Systems 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice o...

Table of Contents: “…SAT and SMT -- Decomposing Farkas Interpolants -- Parallel SAT Simplification on GPU Architectures -- Encoding Redundancy for Satisfaction-Driven Clause Learning -- WAPS: Weighted and Projected Sampling -- Building Better Bit-Blasting for Floating-Point Problems -- The Axiom Profiler: Understanding and Debugging SMT Quantifier Instantiations -- On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition -- Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework -- SAT Solving and Theorem Proving -- Quantitative Verification of Masked Arithmetic Programs against Side-Channel Attacks -- Incremental Analysis of Evolving Alloy Models -- Extending a Brainiac Prover to Lambda-Free Higher-Order Logic -- Verification and Analysis LCV: A Verification Tool for Linear Controller Software -- Semantic Fault Localization and Suspiciousness Ranking -- Computing Coupled Similarity -- Reachability Analysis for Termination and Confluence of Rewriting -- Model Checking -- VoxLogicA: a Spatial Model Checker for Declarative Image Analysis -- On Reachability in Parameterized Phaser Programs -- Abstract Dependency Graphs and Their Application to Model Checking -- Tool Demo -- nonreach - A Tool for Nonreachability Analysis -- The Quantitative Verification Benchmark Set -- ILAng: A Modeling Platform for SoC Verification using Instruction-Level Abstractions -- MetAcsl: Specification and Verification of High-Level Properties -- ROLL 1.0: !…”
Link to Metadata

Automated Deduction - CADE 29 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings /

Table of Contents: “…Certified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description).…”
Link to Metadata

Elementary Differential Equations with Boundary Value Problems by Trench, William F.

Access online version