Invariant Inference with Provable Complexity from the Monotone Theory
Abstract elided by the publisher.
Related papers
- Learning the boundary of inductive invariants POPL 2021
- Property-directed reachability as abstract interpretation in the monotone theory POPL 2022
- Invariant Synthesis for Incomplete Verification Engines TACAS 2018
- Complexity and information in invariant inference POPL 2020
- An Order Theory Framework of Recurrence Equations for Static Cost Analysis - Dynamic Inference of Non-Linear Inequality Invariants SAS 2024
- Theory Exploration Powered by Deductive Synthesis CAV 2021
- Statically Inferring Complex Heap, Array, and Numeric Invariants SAS 2010
- Induction duality: primal-dual search for invariants POPL 2022