Name Venue Year Citations
About VeriFun. CADE 2003 18
Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. CADE 1988 18
Patching Proofs for Reuse (Extended Abstract). ECML/PKDD 1995 2
A Machine-Verified Code Generator. LPAR 2003 4
The Karlsruhe Induction Theorem Proving System. CADE 1986 31
Proving theorems by reuse. Artificial Intelligence 2000 6
Termination of Theorem Proving by Reuse. CADE 1996 6
Unification in Many-Sorted Theories. ECAI 1984 9
On Proving the Termination of Algorithms by Machine. Artificial Intelligence 1994 68
A Classification of Many-Sorted Unification Problems. CADE 1986 1
Combining Induction Axioms by Machine. IJCAI 1993 16
Reasoning About Incompletely Defined Programs. LPAR 2005 12
The Markgraf Karl Refutation Procedure. IJCAI 1981 34
Second-Order Matching modulo Evaluation: A Technique for Reusing Proofs. IJCAI 1995 21
A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. AAAI 1984 66
Reusing Proofs. ECAI 1994 36
Computing Induction Axioms. LPAR 1992 22
Automated Termination Analysis for Incompletely Defined Programs. LPAR 2004 10
A Many-Sorted Calculus Based on Resolution and Paramodulation. IJCAI 1983 0
A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. Artificial Intelligence 1985 0
Copyright ©2019 Universit├Ąt W├╝rzburg
Website created in context of the REGIO Project
Impressum | Privacy | FAQ