Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies

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

Volumn 4160 LNAI, Issue , 2006, Pages 177-189

  Ghilardi, Silvio ^a   Nicolini, Enrica ^a   Ranise, Silvio ^a,b   Zucchelli, Daniele ^a,b  

^a UNIVERSITY OF MILAN   (Italy)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; DECISION THEORY; DIGITAL ARITHMETIC; MATHEMATICAL PROGRAMMING;

ADDITIONAL SYMBOLS; INSTANTIATION STRATEGIES; PRESBURGER ARITHMETIC;

ARRAYS;

EID: 33750038568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11853886_16     Document Type: Conference Paper

References (20)

1. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal. In Proc. of 5th Int. Workshop on Frontiers of Combining Systems (FroCoS'05), volume 3717 of LNCS, 2005.
2. A. Armando, S. Ranise, and M. Rusinowitch. A rewriting approach to satisfiability procedures. Information and Computation, 183(2):140-164, 2003.
3. A. R. Bradley, Z. Manna, and H. B. Sipma. What's decidable about arrays? In Proc. of 7th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'06), volume 3855 of LNCS, 2006.
4. P. J. Downey and R. Sethi. Assignment commands with array references. Journal of the ACM, 25(4):652-666, 1978.
5. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York-London, 1972.
6. J. H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row, 1986.
7. H. Ganzinger and K. Korovin. Integrating equational reasoning in instantiationbased theorem proving. In Proc. of Computer Science in Logic (CSL'04), volume 3210 of LNCS, 2004.
8. S. Ghilardi. Model-theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 33(3-4):221-249, 2004.
9. S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli. Deciding extension of the theory of arrays by integrating decision procedures and instantiation strategies. Rapporte Interne DSI 309-06, Università degli Studi di Milano, Milano (Italy), 2006. Available at http://homes.dsi.unimi.it/~zucchell/ publications/techreport/GhiNiRaZu-RI309-06.pdf.
10. J. Jaffar. Presburger arithmetic with array segments. Information Processing Letters, 12(2):79-82, 1981.
11. H. Kirchner, S. Ranise, C. Ringeissen, and D.-K. Tran. On superposition-based satisfiability procedures and their combination. In Proc. of the 2nd Int. Conf. on Theoretical Aspects of Computing (ICTAC'05), volume 3722 of LNCS, 2005.
12. P. Mateti. A decision procedure for the correctness of a class of programs. Journal of the ACM, 28(2):215-232, 1981.
13. J. McCarthy. Towards a mathematical theory of computation. In Proceedings of IFIP Congress, 1962.
14. S. McPeak and G. Necula. Data structures specification via local equality axioms. In Proc. of 17th Int. Conf. on Computer Aided Verification (CAV'05), volume 3576 of LNCS, 2005.
15. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transaction on Programming Languages and Systems, 1(2):245-257, 1979.
16. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. 2001.
17. J. C. Reynolds. Reasoning about arrays. Communications of the ACM, 22(5):290-299, 1979.
18. J. C. Reynolds. Separation logic: a logic for shared mutable data structures, 2002.
19. A. Stump, C. W. Barrett, D. L. Dill, and J. Levitt. A decision procedure for an extensional theory of arrays. In Proc. of the 16th IEEE Symposium on Logic in Computer Science (LICS'01). IEEE Computer Society, 2001.
20. N. Suzuki and D. R. Jefferson. Verification decidability of presburger array programs. Journal of the ACM, 27(1):191-205, 1980.