What's decidable about arrays?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3855 LNCS, Issue , 2006, Pages 427-442

  Bradley, Aaron R ^a   Manna, Zohar ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELEMENT THEORIES; EQUALITY WITH UNINTERPRETED FUNCTIONS (EUF); PROGRAM VERIFICATION; QUANTIFIER FREE FORMULAE;

ADAPTIVE ALGORITHMS; DECISION SUPPORT SYSTEMS; INDEXING (OF INFORMATION); PROGRAM COMPILERS; SORTING; SYNTACTICS;

ARRAYS;

EID: 33745653311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (8)

1. ARMANDO, A., RANISE, S., AND RUSINOWITCH, M. Uniform derivation of decision procedures by superposition. In International Workshop on Computer Science Logic (CSL) (2001), Springer-Verlag.
2. BARRETT, C., AND BEREZIN, S. CVC Lite: A new implementation of the cooperating validity checker. In Computer Aided Verification (CAV) (2004), Springer-Verlag.
3. BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Polyranking for polynomial loops. In submission; available at http://theory.stanford.edu/~arbrad.
4. MANNA, Z., AND PNUELI, A. Temporal Verification of Reactive Systems: Safety. Springer, 1995.
5. MCCARTHY, J. Towards a mathematical science of computation. In IFIP Congress 62 (1962).
6. SCHRIJVER, A. Theory of Linear and Integer Programming. Wiley, 1986.
7. STUMP, A., BARRETT, C. W., DILL, D. L., AND LEVITT, J. R. A decision procedure for an extensional theory of arrays. In Logic in Computer Science (LICS) (2001).
8. SUZUKI, N., AND JEFFERSON, D. Verification decidability of Presburger array programs. J. ACM 27, 1 (1980).