HDL defines dynamic theories with lifting and combination operations, proves soundness and relative completeness in Isabelle, and demonstrates the approach on a Java controller steering a differential dynamic logic plant model.
Satisfiability modulo theories
2 Pith papers cite this work, alongside 316 external citations. Polarity classification is still indexing.
2
Pith papers citing it
316
external citations · Crossref
fields
cs.LO 2representative citing papers
A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.
citing papers explorer
-
Heterogeneous Dynamic Logic: Provability Modulo Program Theories
HDL defines dynamic theories with lifting and combination operations, proves soundness and relative completeness in Isabelle, and demonstrates the approach on a Java controller steering a differential dynamic logic plant model.
-
Automating Bitvector and Finite Field Equivalence Proofs in Lean
A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.