SAT-based invariant inference and its relation to concept learning

DOI10.1007/978-3-031-19135-0_1MaRDI QIDQ6173099zbMATH OpenOpenAlexFDO

Authors Yotam M. Y. Feldman, Sharon Shoham

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

• A data driven approach for algebraic loop invariants
• A learning-based approach to synthesizing invariants for incomplete verification engines
• A theory of formal synthesis via inductive learning
• A theory of the learnable
• Abstractions from proofs
• Analysis of Boolean Functions
• Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
• Exact learning Boolean functions via the monotone theory
• From invariant checking to invariant inference using randomized search
• scientific article; zbMATH DE number 1693447 (Why is no real title available?)
• scientific article; zbMATH DE number 3085175 (Why is no real title available?)
• IC3 -- flipping the E in ICE
• Interpolant-Based Transition Relation Approximation
• Interpolation and SAT-based model checking.
• Intertwined forward-backward reachability analysis using interpolants
• Lazy Abstraction with Interpolants
• On the learnability of disjunctive normal form formulas
• Queries and concept learning
• SAT-Based Model Checking without Unrolling
• Simple learning algorithms using divide and conquer
• Verification, Model Checking, and Abstract Interpretation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173099)