Abstract
Formulas are often monotonic in the sense that satisfiability for a given domain of discourse entails satisfiability for all larger domains. Monotonicity is undecidable in general, but we devised three calculi that infer it in many cases for higher-order logic. The third calculus has been implemented in Isabelle’s model finder Nitpick, where it is used both to prune the search space and to soundly interpret infinite types with finite sets, leading to dramatic speed and precision improvements.
Similar content being viewed by others
References
Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Applied Logic, vol. 27. Springer (2002)
Berghofer, S., Wenzel, M.: Inductive datatypes in HOL—lessons learned in formal-logic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs ’99. LNCS, vol. 1690, pp. 19–36 (1999)
Blanchette, J.C., Krauss, A.: Monotonicity inference for higher-order formulas. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNAI, vol. 6173, pp. 91–106. Springer (2010)
Blanchette, J.C., Nipkow, T.: Nitpick: a counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L. (eds.) ITP 2010. LNCS, vol. 6172, pp. 131–146. Springer (2010)
Claessen, K., Lillieström, A., Smallbone, N.: Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE-23. LNAI, vol. 6803, pp. 207–221. Springer (2011). http://www.springerlink.com/content/177877773h421x26/
Claessen, K., Sörensson, N.: New techniques that improve MACE-style model finding. In: MODEL (2003)
Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press (1993)
Harrison, J.: HOL Light: a tutorial introduction. In: FMCAD 1996. LNCS, vol. 1166, pp. 265–269. Springer (1996)
Jackson, D.: Software Abstractions: Logic, Language, and Analysis. MIT Press (2006)
Jackson, D., Shlyakhter, I., Sridharan, M.: A micromodularity mechanism. In: ESEC/FSE 2001, pp. 62–73 (2001)
Kuncak, V., Jackson, D.: Relational analysis of algebraic datatypes. In: Gall, H.C. (ed.) ESEC/FSE 2005 (2005)
McCune, W.: A Davis–Putnam program and its application to finite first-order model search: quasigroup existence problems. Technical report, ANL (1994)
Mitchell, J.C.: Foundations for Programming Languages. MIT Press (1996)
Momtahan, L.: Towards a small model theorem for data independent systems in Alloy. ENTCS 128(6), 37–52 (2005)
Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Sys. 1(2), 245–257 (1979)
Nipkow, T.: Verifying a hotel key card system. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds.), ICTAC 2006, LNCS, vol. 4281, pp. 1–14. Springer (2006)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic, LNCS, vol. 2283. Springer (2002)
Pnueli, A., Rodeh, Y., Strichman, O., Siegel, M.: The small model property: how small can it be? Inf. Comput. 178(1), 279–293 (2002)
Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Mu noz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28–32 (2008)
Tinelli, C., Zarba, C.: Combining decision procedures for sorted theories. In: Alferes, J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 641–653. Springer (2004)
Torlak, E., Jackson, D.: Kodkod: A relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632–647. Springer (2007)
Walker, D.: Substructural type systems. In: Pierce B. (ed.) Advanced Topics in Types and Programming Languages, pp. 3–44. MIT Press (2005)
Weber, T.: SAT-based finite model generation for higher-order logic. Ph.D. thesis, Dept. of Informatics, T.U. München (2008)
Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: Mellish, C.S. (ed.) IJCAI-95, vol. 1, pp. 298–303. Morgan Kaufmann (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by the Deutsche Forschungsgemeinschaft (grants Ni 491/11-1 and Ni 491/11-2).
Rights and permissions
About this article
Cite this article
Blanchette, J.C., Krauss, A. Monotonicity Inference for Higher-Order Formulas. J Autom Reasoning 47, 369–398 (2011). https://doi.org/10.1007/s10817-011-9234-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-011-9234-1