Combining data structures with nonstably infinite theories using many-sorted logic

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

Volumn 3717 LNAI, Issue , 2005, Pages 48-64

  Ranise, Silvio ^a   Ringeissen, Christophe ^a   Zarba, Calogero G ^b  

^a INRIA   (France)

^b UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NELSON-OPPEN METHOD; POLITE THEORIES; SHINY THEORIES;

COMPUTER PROGRAMMING; DATA STORAGE EQUIPMENT; FORMAL LOGIC; MATHEMATICAL MODELS; STEADY FLOW;

DATA STRUCTURES;

EID: 33646199405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_3     Document Type: Conference Paper

References (15)

1. Franz Baader and Silvio Ghilardi. Connecting many-sorted structures and theories through adjoint functions. In Bernhard Gramlich, editor, Frontiers of Combining Systems, Lecture Notes in Computer Science. Springer, 2005.
2. Franz Baader and Silvio Ghilardi. Connecting many-sorted theories. In Robert Nieuwenhuis, editor, Automated Deduction - CADE-20, volume 3632 of Lecture Notes in Computer Science. Springer, 2005.
3. Michel Bidoit and Rolf Hennicker. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, 165(1):3-55, 1996.
4. Jean-François Couchot, David Déharbe, Alain Giorgetti, and Silvio Ranise. Scalable automated proving and debugging of set-based specifications. Journal of the Brazilian Computer Society, 9(2):17-36, 2004.
5. David Déharbe and Silvio Ranise. Light-weight theorem proving for debugging and verifying units of code. In Software Engineering and Formal Methods, pages 220-228. IEEE Computer Society, 2003.
6. Pascal Fontaine and Pascal Gribomont. Combining non-stably infinite, non-first order theories. In Silvio Ranise and Cesare Tinelli, editors, Pragmatics of Decision Procedures in Automated Reasoning, 2004.
7. Pascal Fontaine, Silvio Ranise, and Calogero G. Zarba. Combining lists with nonstably infinite theories. In Franz Baader and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 51-66. Springer, 2005.
8. Vijay Ganesh, Sergey Berezin, and David L. Dill. A decision procedure for fixed-width bit-vectors. Unpublished, 2005.
9. Harald Ganzinger. Shostak light. In Andrei Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 332-346. Springer, 2002.
10. Silvio Ranise, Christophe Ringeissen, and Calogero G. Zarba. Combining data structures with nonstably infinite theories using many-sorted logic. Technical report, INRIA, 2005. Also published as Technical Report at Department of Computer Science, University of New Mexico. Electronically available at http://www.inria.fr/rrrt/index.en.html or http://www.cs.unm.edu/research/.
11. Viorica Sofronie-Stokkermans. Hierarchic reasoning in local theory extensions. In Robert Nieuwenhuis, editor, Automated Deduction - CADE-&0, volume 3632 of Lecture Notes in Computer Science. Springer, 2005.
12. Cesare Tinelli and Calogero G. Zarba. Combining decision procedures for sorted theories. In José Júlio Alferes and João Alexandre Leite, editors, Logics in Artificial Intelligence, volume 3229 of Lecture Notes in Computer Science, pages 641-653. Springer, 2004.
13. Cesare Tinelli and Calogero G. Zarba. Combining nonstably infinite theories. Journal of Automated Reasoning, 2005. To appear.
14. Calogero G. Zarba. Combining multisets with integers. In Andrei Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 363-376. Springer, 2002.
15. Calogero G. Zarba. Combining sets with elements. In Nachum Dershowitz, editor, Verification: Theory and Practice, volume 2772 of Lecture Notes in Computer Science, pages 762-782. Springer, 2004.