Invariant inference with provable complexity from the monotone theory

DOI10.1007/978-3-031-22308-2_10zbMath1524.68187arXiv2208.07451MaRDI QIDQ6164427

Sharon Shoham, Yotam M. Y. Feldman

Publication date: 28 July 2023

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.07451

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From invariant checking to invariant inference using randomized search
• The octagon abstract domain
• A theory of formal synthesis via inductive learning
• Queries and concept learning
• Exact learning Boolean functions via the monotone theory
• On converting CNF to DNF
• Automating Abstract Interpretation
• SAT-Based Model Checking without Unrolling
• A theory of the learnable
• Predicate abstraction for software verification
• Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
• A Data Driven Approach for Algebraic Loop Invariants
• Automatically inferring loop invariants via algorithmic learning
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Invariant inference with provable complexity from the monotone theory