{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T15:28:21Z","timestamp":1766503701922},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_47","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"602-617","source":"Crossref","is-referenced-by-count":15,"title":["Combined Satisfiability Modulo Parametric Theories"],"prefix":"10.1007","author":[{"given":"Sava","family":"Krsti\u0107","sequence":"first","affiliation":[]},{"given":"Amit","family":"Goel","sequence":"additional","affiliation":[]},{"given":"Jim","family":"Grundy","sequence":"additional","affiliation":[]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Ayache, N., Filli\u00e2tre, J.-C.: Combining the Coq proof assistant with first-order decision procedures (unpublished) (2006)"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/978-3-540-27813-9_49","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2004","unstructured":"Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 515\u2013518. Springer, Heidelberg (2004)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, C., Shikanian, I., Tinelli, C.: An abstract decision procedure for satisfiability in the theory of recursive data types. In: Pragmatics of Decision Procedures in Automated Deduction (PDPAR) (2006)","DOI":"10.1016\/j.entcs.2006.11.037"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Fontaine, P., Gribomont, E.P.: Combining non-stably infinite, non-first order theories. In: Pragmatics of Decision Procedures in Automated Deduction (2004)","DOI":"10.1016\/j.entcs.2004.06.066"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11691372_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Fontaine","year":"2006","unstructured":"Fontaine, P., et al.: Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.\u00a03920, pp. 167\u2013181. Springer, Heidelberg (2006)"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Ghilardi, S., Nicolini, E., Zucchelli, D.: A comprehensive combination framework. ACM Transactions on Computational Logic (to appear) (2007)","DOI":"10.1145\/1342991.1342992"},{"volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","year":"1993","key":"47_CR7","unstructured":"Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"issue":"2","key":"47_CR8","first-page":"15","volume":"144","author":"J. Grundy","year":"2006","unstructured":"Grundy, J., et al.: Tool building requirements for an API to first-order solvers. ENTCS\u00a0144(2), 15\u201326 (2006)","journal-title":"ENTCS"},{"key":"47_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_17","volume-title":"Automated Reasoning","author":"J. Harrison","year":"2006","unstructured":"Harrison, J.: Towards self-verification in HOL Light. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, Springer, Heidelberg (2006)"},{"key":"47_CR10","unstructured":"Krsti\u0107, S., et al.: Combined satisfiability modulo parametric theories. Tech. report (Oct. 2006), ftp:\/\/ftp.cs.uiowa.edu\/pub\/tinelli\/papers\/KrsGGT-RR-06.pdf"},{"issue":"2","key":"47_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-540-39813-4_5","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Nieuwenhuis","year":"2003","unstructured":"Nieuwenhuis, R., Oliveras, A.: Congruence closure with integer offsets. In: Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 78\u201390. Springer, Heidelberg (2003)"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM (to appear) (2006)","DOI":"10.1145\/1217856.1217859"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"47_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11559306_3","volume-title":"Frontiers of Combining Systems","author":"S. Ranise","year":"2005","unstructured":"Ranise, S., Ringeissen, C., Zarba, C.G.: Combining data structures with nonstably infinite theories using many-sorted logic. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 48\u201364. Springer, Heidelberg (2005)"},{"key":"47_CR16","unstructured":"Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2. Technical report."},{"key":"47_CR17","first-page":"513","volume-title":"Information Processing: 9th World Computer Congress","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing: 9th World Computer Congress, pp. 513\u2013523. North-Holland, Amsterdam (1983)"},{"key":"47_CR18","series-title":"Applied Logic","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-94-009-0349-4_6","volume-title":"Frontiers of Combining Systems (FroCoS)","author":"C. Ringeissen","year":"1996","unstructured":"Ringeissen, C.: Cooperation of decision procedures for the satisfiability problem. In: Frontiers of Combining Systems (FroCoS). Applied Logic, vol.\u00a03, pp. 121\u2013140. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"47_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-44755-5_3","volume-title":"Theorem Proving in Higher Order Logics","author":"N. Shankar","year":"2001","unstructured":"Shankar, N.: Using decision procedures with a higher-order logic. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 5\u201326. Springer, Heidelberg (2001)"},{"key":"47_CR20","series-title":"Applied Logic","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems (FroCoS)","author":"C. Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Frontiers of Combining Systems (FroCoS). Applied Logic, vol.\u00a03, pp. 103\u2013120. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"47_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/978-3-540-30227-8_53","volume-title":"Logics in Artificial Intelligence","author":"C. Tinelli","year":"2004","unstructured":"Tinelli, C., Zarba, C.: Combining decision procedures for sorted theories. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 641\u2013653. Springer, Heidelberg (2004)"},{"issue":"3","key":"47_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10817-005-5204-9","volume":"34","author":"C. Tinelli","year":"2005","unstructured":"Tinelli, C., Zarba, C.: Combining nonstably infinite theories. Journal of Automated Reasoning\u00a034(3), 209\u2013238 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"47_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"Functional Programming Languages and Computer Architecture (FPCA)","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free? In: Functional Programming Languages and Computer Architecture (FPCA), pp. 347\u2013359. ACM Press, New York (1989)"},{"key":"47_CR24","series-title":"Lecture Notes in Computer Science","first-page":"762","volume-title":"Verification: Theory and Practice","author":"C.G. Zarba","year":"2004","unstructured":"Zarba, C.G.: Combining sets with elements. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 762\u2013782. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T21:21:04Z","timestamp":1683926464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_47","relation":{},"subject":[]}}