Formal Reasoning About Efficient Data Structures: A Case Study in ACL2 (2004)
| Venue: | In Logic Based Program Synthesis and Transformation, LNCS 3018 |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Ruiz-reina04formalreasoning,
author = {J. -l. Ruiz-reina and J. -a. Alonso and M. -j. Hidalgo and F. -j. Martín-mateos},
title = {Formal Reasoning About Efficient Data Structures: A Case Study in ACL2},
booktitle = {In Logic Based Program Synthesis and Transformation, LNCS 3018},
year = {2004},
publisher = {Springer–Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We describe in this paper the formal verification, using the ACL2 system, of a syntactic unification algorithm where terms are represented as directed acyclic graphs (dags) and these graphs are stored in a single-threaded object (stobj). The use of stobjs allows destructive operations on data (thus improving the performance of the algorithm), while maintaining the applicative semantics of ACL2. We intend to show how ACL2 provides an environment where execution of algorithms with efficient data structures and formal reasoning about them can be carried out. 1
Citations
| 823 | T.Nipkow : Term Rewriting and All That - Baader - 1998 |
| 227 | Computer-Aided Reasoning: An Approach - Kaufmann, Manolios, et al. - 2000 |
| 181 | 2001. Unification theory - Baader, Snyder |
| 59 | Proving pointer programs in higherorder logic - Mehta, Nipkow - 2005 |
| 21 | Verifying the unification algorithm - Paulson - 1985 |
| 12 | Développement de l’algorithme d’unification dans le calcul des constructions - Rouyer - 1992 |
| 9 | Single-threaded objects in ACL2 - Boyer, Moore - 2002 |
| 1 | Programming in Martin-Lf Type Theory: Unification - A non-trivial Example - Bove - 1999 |
| 1 | A theory about first–order terms - Ruiz–Reina, Alonso, et al. - 2002 |
| 1 | A verified dag unification algorithm in ACL2, 2002. Available at http://www.cs.us.es/~jruiz/unificacion-dag - Ruiz–Reina, Alonso, et al. |
