A Deductive Approach to Program Synthesis
From MaRDI portal
Cited in
(52)- Automatic programming: A tutorial on formal methodologies
- Top-down synthesis of divide-and-conquer algorithms
- Toward formal development of programs from algebraic specifications: Implementations revisited
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Completely non-clausal theorem proving
- Submodule construction as equation solving in CCS
- Deductive and inductive synthesis of equational programs
- Logical debugging
- A theory of formal synthesis via inductive learning
- Deductive synthesis of sorting programs
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- Superposition with first-class booleans and inprocessing clausification
- Resourceful program synthesis from graded linear types
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}
- Analyzing generalized planning under nondeterminism
- Learning higher-order logic programs
- Algebra-based synthesis of loops and their invariants (invited paper)
- Metaheuristics ``In the large
- Refutation-based synthesis in SMT
- A correctness result for synthesizing plans with loops in stochastic domains
- Model checking and synthesis for branching multi-weighted logics
- An approach to automatic deductive synthesis of functional programs
- Superposition with equivalence reasoning and delayed clause normal form transformation
- SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS
- Automatic theorem proving. II
- Church's Problem Revisited
- Direct deductive computation on discourse representation structures
- Complexity of synthesis of composite service with correctness guarantee
- Synthesis from scenario-based specifications
- The pragmatic proof: hypermedia API composition and execution
- Synthesis of list algorithms by mechanical proving
- COCHIS: stable and coherent implicits
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
- scientific article; zbMATH DE number 7455700 (Why is no real title available?)
- Concise read-only specifications for better synthesis of programs with pointers
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
- Building Theorem Provers
- Synthesis of induction orderings for existence proofs
- Tactic theorem proving with refinement-tree proofs and metavariables
- A higher-order interpretation of deductive tableau
- The McCarthy's recursion induction principle: oldy but goody
- Machine learning and logic: a new frontier in artificial intelligence
- Flexible Correct-by-Construction Programming
- Iterative genetic improvement: scaling stochastic program synthesis
- Program Synthesis in Saturation
- Synthesis benchmarks for automated reasoning
- Meaningfulness and genericity in a subsuming framework (invited talk)
- Linearity and regularity with negation normal form
- Synthesis of recursive programs in saturation
- Synthetic programming
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
- Proofs and programs: A naïve approach to program extraction
This page was built for publication: A Deductive Approach to Program Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922132)
