A suite of hard ACL2 theorems arising in refinement-based processor verification (2004)
Cached
Download Links
| Venue: | Fifth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2004), November 2004. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2004 |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Manolios04asuite,
author = {Panagiotis Manolios and Sudarshan K. Srinivasan},
title = {A suite of hard ACL2 theorems arising in refinement-based processor verification},
booktitle = {Fifth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2004), November 2004. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2004},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We have been using ACL2 to verify pipelined machine models for several years and have compiled a suite of 18 problems that arose in the theorem proving process. We believe that this suite will be useful for the future development of ACL2 because it consists of difficult problems that arise in practice, and furthermore, these problems can be handled efficiently by other methods. For example, ACL2 was able to prove the simplest problem in the suite after 15 1 2 days, but UCLID was able to prove the same theorem in seconds. 1
