Search Results - Formula Opel~

  1. 661
  2. 662
  3. 663
  4. 664
  5. 665
  6. 666
  7. 667
  8. 668
  9. 669
  10. 670
  11. 671
  12. 672
  13. 673
  14. 674
  15. 675
  16. 676
  17. 677
  18. 678

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

    Published 2023
    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
    Electronic eBook
  19. 679

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

    Published 2022
    Table of Contents: “…Synthesis -- HOLL: Program Synthesis for Higher Order Logic Locking -- The Complexity of LTL Rational Synthesis -- Synthesis of Compact Strategies for Coordination Programs -- ZDD Boolean Synthesis -- Verification -- Comparative Verification of the Digital Library of Mathematical -- Functions and Computer Algebra Systems -- Verifying Fortran Programs with CIVL -- NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems -- Efficient Neural Network Analysis with Sum-of-Infeasibilities -- Blockchain -- Formal Verification of the Ethereum 2.0 Beacon Chain -- Fast and Reliable Formal Verification of Smart Contracts with the Move Prover -- A Max-SMT Superoptimizer for EVM handling Memory and Storage -- Grammatical Inference -- A New Approach for Active Automata Learning Based on Apartness -- Learning Realtime One-Counter Automata -- Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic -- and Daniel NeiderLearning Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processes -- Verification Inference -- Inferring Interval-Valued Floating-Point Preconditions -- NeuReach: Learning Reachability Functions from Simulations -- Quantifier Alternations: Taming the Search Space Explosion -- LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions -- Short papers -- Kmclib: Automated Inference and Verification of Session Types from OCaml Programs -- Automated Translation of Natural Language Requirements to Runtime Monitors -- MaskD: A Tool for Measuring Masking Fault-Tolerance -- Better Counterexamples for Dafny -- Constraint Solving -- cvc5: A Versatile and Industrial-Strength SMT Solver -- Clausal Proofs for Pseudo-Boolean Reasoning -- Moving Definition Variables in Quantified Boolean Formulas -- A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic -- Model checking and verification -- Property Directed Reachability for Generalized Petri Nets -- Transition Power Abstractions for Deep Counterexample Detection -- Searching for Ribbon-Shaped Paths in Fair Transition Systems -- CoVeriTeam: On-Demand Composition of Cooperative Verification Systems.…”
    Link to Metadata
    Electronic eBook
  20. 680