Automated Deduction – CADE-20
From MaRDI portal
Publication:5394609
DOI10.1007/11532231zbMath1135.68556arXiv0904.4902OpenAlexW2485416161MaRDI QIDQ5394609
No author found.
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.4902
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Satisfiability Modulo Theories ⋮ Program verification with interacting analysis plugins ⋮ Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language ⋮ Decidable Fragments of Many-Sorted Logic ⋮ Verifying Heap-Manipulating Programs in an SMT Framework ⋮ Abstracting Complex Data Structures by Hyperedge Replacement ⋮ Enforcing Structural Invariants Using Dynamic Frames ⋮ An Efficient Decision Procedure for Imperative Tree Data Structures ⋮ Matching Logic: An Alternative to Hoare/Floyd Logic ⋮ An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
This page was built for publication: Automated Deduction – CADE-20