Pages that link to "Item:Q5255085"
From MaRDI portal
The following pages link to From program verification to program synthesis (Q5255085):
Displaying 46 items.
- Programmable program synthesis (Q832155) (← links)
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
- Program synthesis using realizability (Q1183580) (← links)
- Program synthesis from formal requirements specifications using APTS (Q1404293) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Program synthesis for interactive-security systems (Q1696589) (← links)
- The matrix reproved (verification pearl) (Q1703015) (← links)
- On the complexity of the quantified bit-vector arithmetic with binary encoding (Q1708270) (← links)
- Deductive synthesis of sorting programs (Q1822927) (← links)
- Synthesis of sorting algorithms using multisets in \textit{Theorema} (Q1996870) (← links)
- Combining model finder and genetic programming into a general purpose automatic program synthesizer (Q2011033) (← links)
- Relational synthesis for pattern matching (Q2038088) (← links)
- \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} (Q2119984) (← links)
- Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
- Defining behaviorizeable relations to enable inference in semi-automatic program synthesis (Q2239281) (← links)
- Refutation-based synthesis in SMT (Q2280222) (← links)
- Preface for the SYNT (Q2303870) (← links)
- Efficiently solving quantified bit-vector formulas (Q2441770) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- ARMed SPHINCS (Q2798787) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Program boosting: program synthesis via crowd-sourcing (Q2819858) (← links)
- Optimizing synthesis with metasketches (Q2828321) (← links)
- Maximal specification synthesis (Q2828322) (← links)
- Example-directed synthesis: a type-theoretic interpretation (Q2828323) (← links)
- (Q3126947) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Counterexample-Guided Model Synthesis (Q3303898) (← links)
- Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation (Q3303900) (← links)
- A Mechanically Checked Generation of Correlating Programs Directed by Structured Syntactic Differences (Q3460547) (← links)
- AutoBayes: a system for generating data analysis programs from statistical models (Q4408678) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- (Q5020588) (← links)
- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers (Q5041091) (← links)
- Rewriting techniques for program synthesis (Q5055734) (← links)
- Synthesizing Imperative Code from Answer Set Programming Specifications (Q5097626) (← links)
- From Verification to Optimizations (Q5172650) (← links)
- Program Development in Computational Logic (Q5712543) (← links)
- Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development (Q5747779) (← links)
- Iterative genetic improvement: scaling stochastic program synthesis (Q6136101) (← links)
- Program semantics and verification technique for AI-centred programs (Q6174548) (← links)
- Abstract execution (Q6535957) (← links)
- Schematic program proofs with abstract execution. Theory and applications (Q6552501) (← links)
- Truncating abstraction of bit-vector operations for BDD-based SMT solvers (Q6589830) (← links)
