메뉴 건너뛰기




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

Combining non-stably infinite, non-first order theories

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;

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

References (11)
  • 2
    • 35248846029 scopus 로고    scopus 로고
    • 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), Springer-Verlag, Apr.
    • 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
    • (2003) Lecture Notes in Computer Science , vol.2619 , pp. 537-553
    • Conchon, S.1    Krstić, S.2
  • 3
    • 21644482598 scopus 로고    scopus 로고
    • Decidability of invariant validation for paramaterized systems
    • Proc. Tools and Algorithms for Construction and Analysis of Systems, Springer-Verlag
    • 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
    • (2003) Lecture Notes in Computer Science , vol.2619 , pp. 97-112
    • Fontaine, P.1    Gribomont, E.P.2
  • 4
    • 84948985982 scopus 로고    scopus 로고
    • Shostak light
    • A. Voronkov, Automated Deduction - CADE-18, July 27-30, Springer-Verlag
    • 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
    • (2002) Lecture Notes in Computer Science , vol.2392 , pp. 332-346
    • Ganzinger, H.1
  • 5
    • 20144378549 scopus 로고    scopus 로고
    • Combining decision procedures
    • Formal Methods at the Cross Roads: From Panacea to Foundational Support, Springer
    • 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
    • (2003) Lecture Notes in Computer Science , vol.2757 , pp. 381-422
    • Manna, Z.1    Zarba, C.G.2
  • 7
    • 84976820065 scopus 로고
    • Reasoning about recursively defined data structures
    • D.C. Oppen Reasoning about recursively defined data structures Journal of the ACM 27 3 July 1980 403 411
    • (1980) Journal of the ACM , vol.27 , Issue.3 , pp. 403-411
    • Oppen, D.C.1
  • 9
    • 9444237490 scopus 로고    scopus 로고
    • Combining non-stably infinite theories
    • I. Dahn L. Vigneron, Proceedings of the 4th International Workshop on First Order Theorem Proving, FTP'03 (Valencia, Spain), volume 86.1
    • 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
    • (2003) Electronic Notes in Theoretical Computer Science
    • Tinelli, C.1    Zarba, C.G.2
  • 10
    • 22944441190 scopus 로고    scopus 로고
    • Combining decision procedures for theories in sorted logics
    • Department of Computer Science, The University of Iowa, Feb.
    • 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
    • (2004) Technical Report , vol.4 , Issue.1
    • Tinelli, C.1    Zarba, C.G.2
  • 11
    • 35248857971 scopus 로고    scopus 로고
    • Combining sets with elements
    • N. Dershowitz, Verification: Theory and Practice, Springer
    • C.G. Zarba Combining sets with elements N. Dershowitz Verification: Theory and Practice Lecture Notes in Computer Science volume 2772 2004 Springer 762 782
    • (2004) Lecture Notes in Computer Science , vol.2772 , pp. 762-782
    • Zarba, C.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.