A decision procedure for an extensional theory of arrays (2001) [34 citations — 11 self]
Download:
|
|
by Aaron Stump, Clark W. Barrett, David L. Dill
In 16th IEEE Symposium on Logic in Computer Science
http://sprout.stanford.edu/PAPERS/LICS-SBDL-2001.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@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
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
| 394 | PVS: a Prototype Verification System – Owre, Rushby, et al. - 1992 |
| 272 | Simplification by cooperating decision procedures – Nelson, Oppen - 1979 |
| 176 | The Classical Decision Problem – Börger, Grädel, et al. - 1997 |
| 94 | Towards a mathematical science of computation – McCarthy - 1962 |
| 88 | Techniques for Program Verification – Nelson - 1981 |
| 22 | Abstract congruence closure and specializations – Bachmair, Tiwari - 2000 |
| 22 | A framework for cooperating decision procedures – Barrett, Dill, et al. - 2000 |
| 17 | Formal Verification Techniques for Digital Systems – Levitt - 1998 |
| 15 | Assignment commands with array references – DOWNEY, SETHI - 1978 |
| 8 | A theory of finite maps – Collins, Syme - 1995 |
| 4 | Some Completeness Results in the Mathematical Theory of Computation – Kaplan - 1968 |
