Algorithmic analysis of array-accessing programs

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

Volumn 5771 LNCS, Issue , 2009, Pages 86-101

  Alur, Rajeev ^a   Černý, Pavol ^a   Weinstein, Scott ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC ANALYSIS; ALGORITHMIC VERIFICATION; BOOLEAN VARIABLES; DATA DOMAINS; DATA VARIABLES; FINITE DOMAINS; NESTED LOOPS; PROGRAM VERIFICATION; REACHABILITY PROBLEM; SOFTWARE MODEL CHECKING;

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; CRYSTAL LATTICES; MODEL CHECKING;

STRUCTURED PROGRAMMING;

EID: 70350374468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04027-6_9     Document Type: Conference Paper

References (21)

1. Alur, R., Černý, P.,Weinstein, S.: Algorithmic analysis of array-accessing programs. Technical Report MS-CIS-08-35. University of Pennsylvania (2008)
2. Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis by predicate abstraction. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 164-180. Springer, Heidelberg (2005)
3. Ball, T., Rajamani, S.: The SLAM project: debugging system software via static analysis. In: POPL, pp. 1-3 (2002)
4. Björklund, H., Bojańczyk, M.: Shuffle expressions and words with nested data. In: Ku?cera, L., Ku?cera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 750-761. Springer, Heidelberg (2007)
5. Björklund, H., Schwentick, T.: On notions of regularity for data languages. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 88-99. Springer, Heidelberg (2007)
6. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7-16 (2006)
7. Bouajjani, A., Habermehl, P., Jurski, Y., Sighireanu, M.: Rewriting systems with data. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 1-22. Springer, Heidelberg (2007)
8. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427-442. Springer, Heidelberg (2005)
9. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS, pp. 17-26 (2006)
10. Deutsch, A., Hull, R., Patrizi, F., Vianu, V.: Automatic verification of data-centric business processes. In: ICDT, pp. 252-267 (2009)
11. Gischer, J.: Shuffle languages, Petri nets, and context-sensitive grammars. Commun. ACM 24(9), 597-605 (1981)
12. Gopan, D., Reps, T., Sagiv, M.: A framework for numeric analysis of array operations. In: POPL, pp. 338-350 (2008)
13. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: CAV, pp. 72-83 (1997)
14. Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: POPL, pp. 235-246 (2008)
15. Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 474-489. Springer, Heidelberg (2008)
16. Henzinger, T.A., Jhala, R., Majumdar, R., Necula, G.C., Sutre, G., Weimer, W.: Temporal-safety proofs for systems code. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 526-538. Springer, Heidelberg (2002)
17. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134(2), 329-363 (1994)
18. Lazić, R.: Decidability of reachability for polymorphic systems with arrays: A complete classification. ENTCS 138(3), 3-19 (2005)
19. Lipton, R.: The reachability problem requires exponential space. Technical Report Dept. of Computer Science, Research report 62. Yale University (1976)
20. Minski, M.: Recursive unsolvability of Post's problem of 'tag' and other topics in theory of Turing machines. Annals of Mathematics 74, 437-455 (1962)
21. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403-435 (2004)