A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present in this paper a formalization of multiset relations in the ACL2 theorem prover , and we show how multisets can be used to mechanically prove non-trivial termination properties. Every relation on a set A induces a relation on finite multisets over A; it can be shown that the multiset relation induced by a well-founded relation is also wellfounded  . We have carried out a mechanical proof of this property in the ACL2 logic. This allows us to provide well-founded multisetdoi:10.1007/3-540-45654-6_47 fatcat:qkpblk2rxjhvlcgeckgceaimra