Automated Deduction – CADE-20
From MaRDI portal
Publication:5394615
DOI10.1007/11532231zbMath1135.03330MaRDI QIDQ5394615
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11532231
03B35: Mechanization of proofs and logical operations
Related Items
On Combinations of Local Theory Extensions, On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving, Locality Results for Certain Extensions of Theories with Bridging Functions, An Efficient Decision Procedure for Imperative Tree Data Structures, Invariant Synthesis for Combined Theories, On Local Reasoning in Verification, Complete instantiation-based interpolation, On Hierarchical Reasoning in Combinations of Theories, Hierarchical Reasoning for the Verification of Parametric Systems, On deciding satisfiability by theorem proving with speculative inferences, Parametrized invariance for infinite state processes, Constraint solving for interpolation, Theory decision by decomposition, Modular instantiation schemes, PTIME parametric verification of safety properties for reasonable linear hybrid automata, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, On invariant synthesis for parametric systems, Modular proof systems for partial functions with Evans equality, On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions, On Interpolation and Symbol Elimination in Theory Extensions, Applications of Hierarchical Reasoning in the Verification of Complex Systems, Automatic Verification of Combined Specifications: An Overview, On First-Order Model-Based Reasoning, Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata, Towards Complete Reasoning about Axiomatic Specifications, Decision Procedures for Automating Termination Proofs, Satisfiability Modulo Theories
Uses Software
