Sciweavers

54 search results - page 7 / 11

» ACL2

102

Voted

TPHOL
2005
IEEE

100views Automated Reasoning» more TPHOL 2005»

Meta Reasoning in ACL2

15 years 11 months ago

Meta Reasoning in ACL2

Download userweb.cs.utexas.edu

Warren A. Hunt Jr., Matt Kaufmann, Robert Bellarmi...

claim paper

Read More »

111

TPHOL
2005
IEEE

91views Automated Reasoning» more TPHOL 2005»

Proof Pearl: A Formal Proof of Higman's Lemma in ACL2

15 years 11 months ago

Proof Pearl: A Formal Proof of Higman's Lemma in ACL2

Download www.cs.us.es

Francisco-Jesús Martín-Mateos, Jos&e...

claim paper

Read More »

136

AISC
2000
Springer

84views Artificial Intelligence» more AISC 2000»

Formalizing Rewriting in the ACL2 Theorem Prover

15 years 10 months ago

Formalizing Rewriting in the ACL2 Theorem Prover

Download www.cs.us.es

José-Luis Ruiz-Reina, José-Antonio A...

claim paper

Read More »

146

ACL2
2006
ACM

258views Computational Linguistics» more ACL2 2006»

A robust machine code proof framework for highly secure applications

15 years 12 months ago

A robust machine code proof framework for highly secure applications

Download www.ccs.neu.edu

David S. Hardin, Eric W. Smith, William D. Young

claim paper

Read More »

171

CADE
2003
Springer

188views Logical Reasoning» more CADE 2003»

Algorithms for Ordinal Arithmetic

16 years 6 months ago

Algorithms for Ordinal Arithmetic

Download www.cs.utexas.edu

Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...

Panagiotis Manolios, Daron Vroon

claim paper

Read More »

« Prev « First page 7 / 11 Last » Next »