Multiset Relations: a Tool for Proving Termination (2000)
by
J. -l. Ruiz-reina
,
J. -a. Alonso
,
M.-J. Hidalgo
,
F.-J. Martín
| Venue: | In ACL2 Workshop |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Ruiz-reina00multisetrelations:,
author = {J. -l. Ruiz-reina and J. -a. Alonso and M.-J. Hidalgo and F.-J. Martín},
title = {Multiset Relations: a Tool for Proving Termination},
booktitle = {In ACL2 Workshop},
year = {2000}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present in this paper a formalization of multiset relations in ACL2, and we show how multisets can be used to prove non-trivial termination properties in ACL2. Intuitively, multisets are sets that admit multiple occurrences of elements.
Citations
| 822 | Term rewriting and All That - Baader, Nipkow - 1998 |
| 550 | Term rewriting systems - Klop - 1992 |
| 227 | Computer-Aided Reasoning: An Approach - Kaufmann, Manolios, et al. - 2000 |
| 172 | Proving termination with multiset orderings - Dershowitz, Manna - 1979 |
| 5 | Formalizing rewriting in the ACL2 theorem prover - Ruiz-Reina, Alonso, et al. - 2001 |
| 4 | defstructure for ACL2 version 2.0 - Brock - 1997 |
| 2 | Knuth's generalization of McCarthy's 91 function - Cowles - 2000 |
| 1 | Formalizing equational reasoning in the ACL2 theorem prover - Ruiz-Reina, Alonso, et al. - 2000 |
