Combining non-stably infinite, non-first order theories

Electronic Notes in Theoretical Computer Science

Volumn 125, Issue 3, 2005, Pages 37-51

  Fontaine, Pascal ^a   Gribomont, Pascal ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Combination; Decision procedure; Non first order; Non stably infinite

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; FUNCTIONS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

COMBINATION; DECISION PROCEDURE; NON FIRST-ORDER; NON STABLY-INFINITE;

DECISION THEORY;

EID: 21644449372     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.06.066     Document Type: Conference Paper

References (11)

1. A. Armando, S. Ranise, and M. Rusinowitch A rewriting approach to satisfiability procedures Information and Computation 183 2 2003 140 164
2. S. Conchon, and S. Krstić Strategies for combining decision procedures P. Narendran M. Rusinowitch Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Warsaw, Poland) Lecture Notes in Computer Science volume 2619 Apr. 2003 Springer-Verlag 537 553
3. P. Fontaine, and E.P. Gribomont Decidability of invariant validation for paramaterized systems Proc. Tools and Algorithms for Construction and Analysis of Systems Lecture Notes in Computer Science volume 2619 2003 Springer-Verlag 97 112
4. H. Ganzinger Shostak light A. Voronkov Automated Deduction - CADE-18 Lecture Notes in Computer Science volume 2392 July 27-30 2002 Springer-Verlag 332 346
5. Z. Manna, and C.G. Zarba Combining decision procedures Formal Methods at the Cross Roads: From Panacea to Foundational Support Lecture Notes in Computer Science volume 2757 2003 Springer 381 422
6. G. Nelson, and D.C. Oppen Simplifications by cooperating decision procedures ACM Transactions on Programming Languages and Systems 1 2 Oct. 1979 245 257
7. D.C. Oppen Reasoning about recursively defined data structures Journal of the ACM 27 3 July 1980 403 411
8. A. Stump, C.W. Barrett, D.L. Dill, and J.R. Levitt A decision procedure for an extensional theory of arrays 16th Annual IEEE Symposium on Logic in Computer Science (LICS '01), Washington - Brussels - Tokyo June 2001 IEEE 29 37
9. C. Tinelli, and C.G. Zarba Combining non-stably infinite theories I. Dahn L. Vigneron Proceedings of the 4th International Workshop on First Order Theorem Proving FTP'03 (Valencia, Spain) Electronic Notes in Theoretical Computer Science 86.1 2003 Elsevier Science Publishers
10. C. Tinelli and C.G. Zarba. Combining decision procedures for theories in sorted logics. Technical Report 04-01, Department of Computer Science, The University of Iowa, Feb. 2004
11. C.G. Zarba Combining sets with elements N. Dershowitz Verification: Theory and Practice Lecture Notes in Computer Science volume 2772 2004 Springer 762 782