Pages that link to "Item:Q4928454"

The following pages link to Automating Inductive Proofs Using Theory Exploration (Q4928454):

Displaying 36 items.

• Proving properties of functional programs by equality saturation (Q300342) (← links)
• Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
• Theory exploration powered by deductive synthesis (Q832255) (← links)
• Automatic inductive theorem proving using Prolog (Q1103415) (← links)
• Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
• Automated theory exploration for interactive theorem proving: an introduction to the Hipster system (Q1687709) (← links)
• Automata-driven automated induction (Q1854445) (← links)
• Integer induction in saturation (Q2055871) (← links)
• Unprovability results for clause set cycles (Q2084942) (← links)
• Induction and Skolemization in saturation theorem proving (Q2084957) (← links)
• Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
• Combining induction and saturation-based theorem proving (Q2303240) (← links)
• Induction in saturation-based proof search (Q2305434) (← links)
• Inductive theorem proving based on tree grammars (Q2344621) (← links)
• Equivalence checking of two functional programs using inductive theorem provers (Q2410575) (← links)
• Automating Induction with an SMT Solver (Q2891425) (← links)
• Automated Certification of Implicit Induction Proofs (Q3100200) (← links)
• An Investigation of Hilbert’s Implicit Reasoning through Proof Discovery in Idle-Time (Q3102743) (← links)
• TIP: Tons of Inductive Problems (Q3453129) (← links)
• Inductive Prover Based on Equality Saturation for a Lazy Functional Language (Q3455064) (← links)
• Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
• (Q4263171) (← links)
• Automatic Learning of Proof Methods in Proof Planning (Q4465166) (← links)
• Automated natural deduction prover and experiments (Q4610323) (← links)
• Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
• (Q5140266) (← links)
• Quick specifications for the busy programmer (Q5371995) (← links)
• Hipster: Integrating Theory Exploration in a Proof Assistant (Q5495917) (← links)
• Logic Based Program Synthesis and Transformation (Q5713934) (← links)
• Focused Inductive Theorem Proving (Q5747767) (← links)
• Alien coding (Q6066843) (← links)
• Into the Infinite - Theory Exploration for Coinduction (Q6108814) (← links)
• Machine Learning for Inductive Theorem Proving (Q6108816) (← links)
• Lemmaless induction in trace logic (Q6160563) (← links)
• Quantifier-free induction for lists (Q6617170) (← links)
• Conjectures, tests and proofs: an overview of theory exploration (Q6646290) (← links)