SAT-based invariant inference and its relation to concept learning

DOI10.1007/978-3-031-19135-0_1OpenAlexW4312759040MaRDI QIDQ6173099

Sharon Shoham, Yotam M. Y. Feldman

Publication date: 21 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19135-0_1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• From invariant checking to invariant inference using randomized search
• Simple learning algorithms using divide and conquer
• A theory of formal synthesis via inductive learning
• On the learnability of disjunctive normal form formulas
• A learning-based approach to synthesizing invariants for incomplete verification engines
• Queries and concept learning
• Exact learning Boolean functions via the monotone theory
• IC3 - Flipping the E in ICE
• SAT-Based Model Checking without Unrolling
• Abstractions from proofs
• A theory of the learnable
• Analysis of Boolean Functions
• Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
• A Data Driven Approach for Algebraic Loop Invariants
• Intertwined Forward-Backward Reachability Analysis Using Interpolants
• Interpolant-Based Transition Relation Approximation
• Lazy Abstraction with Interpolants
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: SAT-based invariant inference and its relation to concept learning