3 search results - page 1 / 1 » Proof Pearl: A Formal Proof of Higman's Lemma in ACL2 |
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
TYPES
2000
Springer
13 years 8 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
ACL2
2006
ACM
13 years 11 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...