Abstract
We give a fresh theoretical foundation for designing comprehensive SMT solvers, generalizing in a practically motivated direction. We define parametric theories that most appropriately express the “logic” of common data types. Our main result is a combination theorem for decision procedures for disjoint theories of this kind. Virtually all of the deeply nested data structures (lists of arrays of sets of ...) that arise in verification work are covered.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ayache, N., Filliâtre, J.-C.: Combining the Coq proof assistant with first-order decision procedures (unpublished) (2006)
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. 3114, pp. 515–518. Springer, Heidelberg (2004)
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)
Fontaine, P., Gribomont, E.P.: Combining non-stably infinite, non-first order theories. In: Pragmatics of Decision Procedures in Automated Deduction (2004)
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. 3920, pp. 167–181. Springer, Heidelberg (2006)
Ghilardi, S., Nicolini, E., Zucchelli, D.: A comprehensive combination framework. ACM Transactions on Computational Logic (to appear) (2007)
Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)
Grundy, J., et al.: Tool building requirements for an API to first-order solvers. ENTCS 144(2), 15–26 (2006)
Harrison, J.: Towards self-verification in HOL Light. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)
Krstić, S., et al.: Combined satisfiability modulo parametric theories. Tech. report (Oct. 2006), ftp://ftp.cs.uiowa.edu/pub/tinelli/papers/KrsGGT-RR-06.pdf
Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)
Nieuwenhuis, R., Oliveras, A.: Congruence closure with integer offsets. In: Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 78–90. Springer, Heidelberg (2003)
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)
Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
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. 3717, pp. 48–64. Springer, Heidelberg (2005)
Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2. Technical report.
Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing: 9th World Computer Congress, pp. 513–523. North-Holland, Amsterdam (1983)
Ringeissen, C.: Cooperation of decision procedures for the satisfiability problem. In: Frontiers of Combining Systems (FroCoS). Applied Logic, vol. 3, pp. 121–140. Kluwer Academic Publishers, Dordrecht (1996)
Shankar, N.: Using decision procedures with a higher-order logic. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 5–26. Springer, Heidelberg (2001)
Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Frontiers of Combining Systems (FroCoS). Applied Logic, vol. 3, pp. 103–120. Kluwer Academic Publishers, Dordrecht (1996)
Tinelli, C., Zarba, C.: Combining decision procedures for sorted theories. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 641–653. Springer, Heidelberg (2004)
Tinelli, C., Zarba, C.: Combining nonstably infinite theories. Journal of Automated Reasoning 34(3), 209–238 (2005)
Wadler, P.: Theorems for free? In: Functional Programming Languages and Computer Architecture (FPCA), pp. 347–359. ACM Press, New York (1989)
Zarba, C.G.: Combining sets with elements. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 762–782. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Krstić, S., Goel, A., Grundy, J., Tinelli, C. (2007). Combined Satisfiability Modulo Parametric Theories. In: Grumberg, O., Huth, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2007. Lecture Notes in Computer Science, vol 4424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71209-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-71209-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71208-4
Online ISBN: 978-3-540-71209-1
eBook Packages: Computer ScienceComputer Science (R0)