Counterexample-guided partial bounding for recursive function synthesis
From MaRDI portal
(Redirected from Publication:832233)
Recommendations
Cites work
- A Methodology for LISP Program Construction from Examples
- A Transformation System for Developing Recursive Programs
- A type-directed abstraction refinement approach to higher-order model checking
- Automatic parallelization of recursive functions using quantifier elimination
- Automatically Introducing Tail Recursion in CakeML
- Bounded quantifier instantiation for checking inductive invariants
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Example-directed synthesis: a type-theoretic interpretation
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Inductive synthesis of functional programs: an explanation based generalization approach
- Synthesis of recursive ADT transformations from reusable templates
- The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
- Types and higher-order recursion schemes for verification of higher-order programs
- Verifying higher-order functional programs with pattern-matching algebraic data types
Cited in
(4)- Synthesis with asymptotic resource bounds
- Preface of the special issue on the conference on computer-aided verification 2020 and 2021
- \textsc{SplitRegex}: efficient regex synthesis by neural example splitting
- Inductive synthesis of structurally recursive functional programs from non-recursive expressions
This page was built for publication: Counterexample-guided partial bounding for recursive function synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832233)
