Search Results for author:
Found 14 papers, 5 papers with code
Genetic Algorithm for Program Synthesis
A deductive program synthesis tool takes a specification as input and derives a program that satisfies the specification.
Definitional Quantifiers Realise Semantic Reasoning for Proof by Induction
Proof assistants offer tactics to apply proof by induction, but these tactics rely on inputs given by human engineers.
Faster Smarter Induction in Isabelle/HOL
Proof by induction plays a critical role in formal verification and mathematics at large.
Towards United Reasoning for Automatic Induction in Isabelle/HOL
Inductive theorem proving is an important long-standing challenge in computer science.
Simple Dataset for Proof Method Recommendation in Isabelle/HOL (Dataset Description)
Recently, a growing number of researchers have applied machine learning to assist users of interactive theorem provers.
Smart Induction for Isabelle/HOL (System Description)
Proof assistants offer tactics to facilitate inductive proofs.
LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL
Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving.
Logic in Computer Science
Towards Evolutionary Theorem Proving for Isabelle/HOL
Mechanized theorem proving is becoming the basis of reliable systems programming and rigorous mathematics.
PaMpeR: Proof Method Recommendation System for Isabelle/HOL
Deciding which sub-tool to use for a given proof state requires expertise specific to each ITP.
Goal-Oriented Conjecturing for Isabelle/HOL
We present PGT, a Proof Goal Transformer for Isabelle/HOL.
Logic in Computer Science
Towards Smart Proof Search for Isabelle
Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation.
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL.
Logic in Computer Science
