Counterexample guided inductive synthesis modulo theories
From MaRDI portal
Recommendations
Cited in
(39)- Automatic synthesis of logical models for order-sorted first-order theories
- A theory of formal synthesis via inductive learning
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Automatic synthesis of constraints from examples using mixed integer linear programming
- Counterexample-guided inductive synthesis for probabilistic systems
- Inductive synthesis for probabilistic programs reaches new horizons
- Automated and formal synthesis of neural barrier certificates for dynamical models
- Satisfiability and synthesis modulo oracles
- Look for the proof to find the program: decorated-component-based program synthesis
- Program synthesis using deduction-guided reinforcement learning
- Defining behaviorizeable relations to enable inference in semi-automatic program synthesis
- Refutation-based synthesis in SMT
- Program synthesis with equivalence reduction
- Efficient program synthesis using constraint satisfaction in inductive logic programming
- Modular synthesis of sketches using models
- Synthesis of recursive ADT transformations from reusable templates
- Counterexample-Guided Model Synthesis
- Connecting program synthesis and reachability: automatic program repair using test-input generation
- Scaling enumerative program synthesis via divide and conquer
- scientific article; zbMATH DE number 1926611 (Why is no real title available?)
- Solving program sketches with large integer values
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
- Synthesizing imperative programs from examples guided by static analysis
- Component-based synthesis for complex APIs
- Beyond the verification approach: the synthesis approach
- Machine learning and logic: a new frontier in artificial intelligence
- \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches
- Learning programs with magic values
- Synthesising programs with non-trivial constants
- Bootstrapping library-based synthesis
- Overfitting in synthesis: theory and practice
- Constraint-based debugging in probabilistic model checking
- Program synthesis with best-first bottom-up search
- Counterexample-driven synthesis for probabilistic program sketches
- Experiments on infinite model finding in SMT solving
- Unsafe probabilities and risk contours for stochastic processes using convex optimization
- One is all you need: associative second-order unification without first-order variables
- Designing neural controllers with optimality and stability guarantees by learning input-output dissipativity
- Counterexample-guided partial bounding for recursive function synthesis
This page was built for publication: Counterexample guided inductive synthesis modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045008)
