Algorithmic analysis of array-accessing programs

ACM Transactions on Computational Logic

Volumn 13, Issue 3, 2012, Pages

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Algorithmic software verification; Arrays; Automata

Indexed keywords

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

AUTOMATA THEORY; MODEL CHECKING;

ALGORITHMS;

EID: 84865985736     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/2287718.2287727     Document Type: Article

References (23)

1. BALABAN, I., PNUELI, A., AND ZUCK, L. 2005. Shape analysis by predicate abstraction. In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation. 164-180. (Pubitemid 41231360)
2. BALL, T. AND RAJAMANI, S. 2002. The SLAM project: debugging system software via static analysis. In Proceedings of the ACM Symposium on Principles of Programming Languages. 1-3. (Pubitemid 35009025)
3. BJÖRKLUND, H. AND BOJAŃCZYK, M. 2007. Shuffle expressions and words with nested data. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science. 750-761.
4. BJÖRKLUND, H. AND SCHWENTICK, T. 2007. On notions of regularity for data languages. In Proceedings of the International Symposium on Foundations of Computation Theory. 88-99.
5. BOJAŃCZYK, M., MUSCHOLL, A., SCHWENTICK, T., SEGOUFIN, L., AND DAVID, C. 2006. Two-variable logic on words with data. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science. 7-16. (Pubitemid 47130347)
6. BOUAJJANI, A.,HABERMEHL, P., JURSKI, Y., AND SIGHIREANU,M. 2007. Rewriting systems with data. In Proceedings of the International Symposium on Foundations of Computation Theory. 1-22.
7. BRADLEY, A.,MANNA, Z., AND SIPMA,H. 2006. What's decidable about arrays? In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation. 427-442. (Pubitemid 43973682)
8. DEMRI, S. AND LAZIĆ, R. 2006. LTL with the freeze quanti er and register automata. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science. 17-26. (Pubitemid 47130348)
9. DEUTSCH, A.,HULL, R.,PATRIZI, F., AND VIANU, V. 2009. Automatic verification of data-centric business processes. In Proceedings of the International Conference on Database Theory. 252-267.
10. GISCHER, J. 1981. Shuffle languages, Petri nets, and context-sensitive grammars. Comm. ACM24, 9, 597-605. (Pubitemid 12466163)
11. GOPAN, D.,REPS, T., AND SAGIV,M. 2008. A framework for numeric analysis of array operations. In Proceedings of the ACM Symposium on Principles of Programming Languages. 338-350.
12. GRAF, S. AND SAÏDI,H. 1997. Construction of abstract state graphswith PVS. In Proceedings of the International Conference on Computer-Aided Verification. 72-83. (Pubitemid 127088966)
13. GULAVANI, B.,HENZINGER, T.,KANNAN, Y.,NORI, A., AND RAJAMANI, S. 2006. Synergy: a new algorithm for property checking. In Proceedings of the Conference on Foundations of Software Engineering. 117-127. (Pubitemid 47129390)
14. GULWANI, S.,MCCLOSKEY, B., AND TIWARI, A. 2008. Lifting abstract interpreters to quantified logical domains. In Proceedings of the ACM Symposium on Principles of Programming Languages. 235-246.
15. HABERMEHL, P., IOSIF, R., AND VOJNǍR, T. 2008. What else is decidable about integer arrays? In Proceedings of the International Conference on Foundations of Software Science and Computation Structures. 474-489.
16. HENZINGER, T., JHALA, R.,MAJUMDAR, R.,NECULA, G.,SUTRE, G., ANDWEIMER,W. 2002. Temporal-safety proofs for systems code. In Proceedings of the International Conference on Computer-Aided Verification. 526-538.
17. KAMINSKI, M. AND FRANCEZ, N. 1994. Finite-memory automata. Theor. Comput. Sci. 134, 2, 329-363.
18. LAMBEK, J. 1961. How to program an infinite abacus. Can. Math. Bull. 4, 295-302.
19. LAZIĆ, R. 2005. Decidability of reachability for polymorphic systems with arrays: A complete classification. Electron. Notes Theor. Comput. Sci. 138, 3, 3-19. (Pubitemid 41808217)
20. LIPTON, R. 1976. The reachability problem requires exponential space. Tech. rep. 62, Department of Computer Science, Yale University.
21. MINSKI, M. 1962. Recursive unsolvability of Post's problem of 'tag' and other topics in theory of Turing machines. Ann. Math. 74, 437-455.
22. NEVEN, F., SCHWENTICK, T., AND VIANU, V. 2004. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5, 3, 403-435.
23. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley Publishing, Reading, MA.