Formula normalizations in verification
From MaRDI portal
Publication:6535699
Recommendations
Cites work
- scientific article; zbMATH DE number 3889596 (Why is no real title available?)
- scientific article; zbMATH DE number 758787 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- A Brief Overview of Mizar
- A completion algorithm for lattice tree automata
- A note on orthomodular lattices
- Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers
- Binary decision diagrams
- Boolean Rings for Intersection-Based Satisfiability
- Contract-based resource verification for higher-order functions with memoization
- Decision procedures. An algorithmic point of view
- Equivalence checking for orthocomplemented bisemilattices in log-linear time
- Finitely Presented Lattices
- Free Ortholattices
- Free lattices.
- Function summarization modulo theories
- HOL Light: An Overview
- Implementing Superposition in iProver (System Description)
- Making higher-order superposition work
- Satisfiability Checking of Non-clausal Formulas Using General Matings
- System description: E 1.8
- Term rewrite systems for lattice theory
- The Isabelle Framework
This page was built for publication: Formula normalizations in verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535699)