Combining lists with non-stably infinite theories

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

Volumn 3452 LNAI, Issue , 2005, Pages 51-66

  Fontaine, Pascal ^a   Ranise, Silvio ^a   Zarba, Calogero G ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; LOGIC PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; REQUIREMENTS ENGINEERING;

GENERIC THEORY; NELSON-OPPEN METHODS; PROGRAM VERIFICATION; STABLE-INFINITENESS REQUIREMENT;

THEOREM PROVING;

EID: 26844462738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_4     Document Type: Conference Paper

References (25)

1. A. Armando, S. Ranise, and M. Rusinowitch. A rewriting approach to satisfiability procedures. Information and Computation, 183(2):140-164, 2003.
2. S. Berezin, V. Ganesh, and D. L. Dill. An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic. In Proceedings of TACAS'03, volume 2619 of LNCS, Warshaw, Poland, April 2003.
3. N. S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Stanford University, 1998.
4. R. S. Boyer and J. S. Moore. A Computational Logic. ACM Monograph SERIES, 1979.
5. L. de Moura, H. Rueß, and N. Shankar. Justifying equality. In PDPAR, 2004.
6. D. Déharbe and S. Ranise. Light-Weight Theorem Proving for Debugging and Verifying Units of Code. In Proc. of the International Conference on Software Engineering and Formal Methods (SEFM03), IEEE Computer Society Press, 2003.
7. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification (CAV), volume 2102 of LNCS, pages 246-249. Springer-Verlag, 2001.
8. P. Fontaine and P. Gribomont. Combining non-stably infinite, non-first order theories. In S. Ranise and C. Tinelli, editors, Pragmatics of Decision Procedures in Automated Reasoning, 2004.
9. H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of LNCS, pages 332-346. Springer, 2002.
10. th Inl. Symp. Methodologies for Intelligent Systems, pages 57-70, 1994.
11. T. F. Melham. Automating Recursive Type Definitions in Higher Order Logic. In Current Trends in Hardware Verification and Theorem Proving, LNCS, pages 341-386. Sprigner-Verlag, 1989.
12. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, Oct. 1979.
13. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-364, 1980.
14. D. C. Oppen. Reasoning about recursively defined data structures. Journal of the ACM, 27(3):403-411, 1980.
15. S. Owre and N. Shankar. Abstract Datatypes in PVS. Technical Report CSL-93-9R, SRI International, 1997.
16. L. C. Paulson. A fixedpoint approach to implementing (co)inductive definitions. In A. Bundy, editor, Automated Deduction - CADE-12, LNAI 814, pages 148-161. Springer, 1994. 12th international conference.
17. W. Pugh. The omega test: a fast integer programming algorithm for dependence analysis. Supercomputing, pages 4-13, 1991.
18. R. E. Shostak. Deciding combination of theories. Journal of the Association for Computing Machinery, 31(1):1-12, 1984.
19. A. Stump, C. W. Barrett, and D. L. Dill. CVC: a cooperating validity checker. In E. Brinksma and K. G. Larsen, editors, Computer Aided Verification (CAV), volume 2404 of LNCS, pages 500-504. Springer, 2002.
20. C. Tinelli and C. G. Zarba. Combining non-stably infinite theories. Journal of Automated Reasoning, 2004. To appear.
21. P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In S. Graf and M. I. Schwartzbach, editors, TACAS, volume 1785 of LNCS, pages 1-19, Berlin, Mar. 2000. Springer-Verlag.
22. C. G. Zarba. Combining multisets with integers. In A. Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of LNCS, pages 363-376. Springer, 2002.
23. C. G. Zarba. Combining sets with integers, In A. Armando, editor, Frontiers of Combining Systems, volume 2309 of LNCS, pages 103-116. Springer, 2002.
24. C. G. Zarba. Combining sets with elements. In N. Dershowitz, editor, Verification: Theory and Practice, volume 2772 of LNCS, pages 762-782. Springer, 2004.
25. T. Zhang, H. B. Sipma, and Z. Manna. Decision procedures for recursive data structures with integer constraints, In D. A. Basin and M. Rusinowitch, editors, Automated Reasoning, volume 3097 of LNCS, pages 152-167. Springer, 2004.