↓ Skip to main content

Automated Deduction – CADE 26

Overview of attention for book
Automated Deduction – CADE 26
Springer, Cham

Table of Contents

  1. Book Overview
  2. Chapter 1 Reasoning About Concurrency in High-Assurance, High-Performance Software Systems
  3. Chapter 2 Towards Logic-Based Verification of JavaScript Programs
  4. Chapter 3 Formal Verification of Financial Algorithms
  5. Chapter 4 Satisfiability Modulo Theories and Assignments
  6. Chapter 5 Notions of Knowledge in Combinations of Theories Sharing Constructors
  7. Chapter 6 On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic
  8. Chapter 7 Satisfiability Modulo Transcendental Functions via Incremental Linearization
  9. Chapter 8 Satisfiability Modulo Bounded Checking
  10. Chapter 9 Short Proofs Without New Variables
  11. Chapter 10 Relational Constraint Solving in SMT
  12. Chapter 11 Decision Procedures for Theories of Sets with Measures
  13. Chapter 12 A Decision Procedure for Restricted Intensional Sets
  14. Chapter 13 Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints
  15. Chapter 14 Efficient Certified RAT Verification
  16. Chapter 15 Efficient Verified (UN)SAT Certificate Checking
  17. Chapter 16 Translating Between Implicit and Explicit Versions of Proof
  18. Chapter 17 A Unifying Principle for Clause Elimination in First-Order Logic
  19. Chapter 18 Splitting Proofs for Interpolation
  20. Chapter 19 Detecting Inconsistencies in Large First-Order Knowledge Bases
  21. Chapter 20 Theorem Proving for Metric Temporal Logic over the Naturals
  22. Chapter 21 Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
  23. Chapter 22 WorkflowFM: A Logic-Based Framework for Formal Process Specification and Composition
  24. Chapter 23 DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
  25. Chapter 24 CSI: New Evidence – A Progress Report
  26. Chapter 25 Scalable Fine-Grained Proofs for Formula Processing
  27. Chapter 26 Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems
  28. Chapter 27 A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms
  29. Chapter 28 Certifying Safety and Termination Proofs for Integer Transition Systems
  30. Chapter 29 Biabduction (and Related Problems) in Array Separation Logic
  31. Chapter 30 Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof
  32. Chapter 31 Satisfiability of Compositional Separation Logic with Tree Predicates and Data Constraints
  33. Chapter 32 A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
  34. Chapter 33 The Binomial Pricing Model in Finance: A Formalization in Isabelle
  35. Chapter 34 Monte Carlo Tableau Proof Search
Attention for Chapter 10: Relational Constraint Solving in SMT

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
13 Mendeley