A logic of singly indexed arrays

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

Volumn 5330 LNAI, Issue , 2008, Pages 558-573

  Habermehl, Peter ^a,b   Iosif, Radu ^c   Vojnar, Tomáš ^d  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c VERIMAG   (France)

^d BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); RECURSIVE FUNCTIONS; TERMINOLOGY; TRANSLATION (LANGUAGES);

ARRAY ELEMENTS; CONTROL STATES; COUNTER AUTOMATONS; REACH ABILITIES; SATISFIABILITY PROBLEMS; TRANSITION RULES;

COMPUTABILITY AND DECIDABILITY;

EID: 58149099469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89439-1_39     Document Type: Conference Paper

References (17)

1. Armando, A., Ranise, S., Rusinowitch, M,: Uniform derivation of decision procedures by superposition. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 513. Springer, Heidelberg (2001)
2. Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.: Parameterized verification with automatically computed inductive assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102. Springer, Heidelberg (2001)
3. Bouajjani, A., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of infinite-state processes. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424. Springer, Heidelberg (2007)
4. Bozga, M., Iosif, R., Lakhnech, Y.: Flat parametric counter automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052. Springer, Heidelberg (2006)
5. 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. Springer, Heidelberg (2006)
6. Comon, H., Jurski, Y.: Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In: Vardi, M.Y. (ed.) CAV 1998. LNCS. vol. 1427. Springer, Heidelberg (1998)
7. The FLATA Toolset, http://www-verimag.imag.fr/~async/FLATA/flata.html
8. Ghilardi, S., Nicolini. E., Ranise, S., Zucchelli, D.: Decision Procedures for Extensions of the Theory of Arrays. Annals of Mathematics and Artificial Intelligence, 50 (2007)
9. Habermehl, P., Iosif, R., Vojnar, T.: A Logic of Singly Indexed Arrays. Technical Report TR-2008-9, Verimag (2008)
10. Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962. Springer, Heidelberg (2008)
11. Jaffar, J.: Presburger Arithmetic with Array Segments. Inform. Processing Letters, 12 (1981)
12. King, J.: A Program Verifier. PhD thesis, Carnegie Mellon University (1969)
13. Mateti, P.: A Decision Proc. for the Correctness of a Class of Programs. Journal of the ACM, 28(2) (1980)
14. Matiyasevich, Y: Enumerable Sets are Diophantine. Journal of Sovietic Mathematics 11, 354-358 (1970)
15. McCarthy, J.: Towards a Mathematical Science of Computation. In: IFIP Congress (1962)
16. Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A Decision Procedure for an Extensional Theory of Arrays. In: Proc. of LICS 2001 (2001)
17. Suzuki, N., Jefferson, D.: Verification Decidability of Presburger Array Programs. Journal of the ACM 27(1) (1980)