A Decision Procedure for an Extensional Theory of Arrays (2001)
Cached
Download Links
- [sprout.stanford.edu]
- [sprout.stanford.edu]
- [www.cs.wustl.edu]
- [sprout.stanford.edu]
- DBLP
Other Repositories/Bibliography
by
Aaron Stump
,
Clark W. Barrett
,
David L. Dill
| Venue: | In 16th IEEE Symposium on Logic in Computer Science |
| Citations: | 62 - 13 self |
BibTeX
@INPROCEEDINGS{Stump01adecision,
author = {Aaron Stump and Clark W. Barrett and David L. Dill},
title = {A Decision Procedure for an Extensional Theory of Arrays},
booktitle = {In 16th IEEE Symposium on Logic in Computer Science},
year = {2001},
pages = {29--37},
publisher = {IEEE Computer Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis, and automated theorem-proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct. 1.
Citations
| 490 | PVS: A prototype verification system - Owre, Rushby, et al. - 1992 |
| 352 | Simplification by cooperating decision procedures - Nelson, Oppen - 1979 |
| 239 | Y.: The Classical Decision Problem - Börger, Grädel, et al. - 1996 |
| 133 | Towards a mathematical science of computation - McCarthy - 1962 |
| 92 | Techniques for program verification - Nelson - 1981 |
| 24 | A.: A framework for cooperating decision procedures - Barrett, Dill, et al. - 2000 |
| 22 | Abstract Congruence Closure and Specializations - Bachmair, Tiwari |
| 16 | Assignment commands with array references - DOWNEY, SETHI - 1978 |
| 15 | Formal Verification Techniques for Digital Systems - Levitt - 1998 |
| 8 | A Theory of Finite Maps - Collins, Syme - 1995 |
| 3 | Some Completeness Results in the Mathematical Theory of Computation - Kaplan - 1968 |
