Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod (System Description)∗
نویسندگان
چکیده
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indicate that Nitpick generates more counterexamples than other model finders for higher-order logic, without restrictions on the form of the formulas to falsify.
منابع مشابه
Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indic...
متن کاملNitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Anecdotal evidence suggests that most “theorems” initially given to an interactive theorem prover do not hold, typically because of a typo or a missing assumption, but sometimes because of a deep flaw. Modern proof assistants for higher-order logic (HOL) provide counterexample generators that can be run on putative theorems or on specific subgoals in a proof to spare users the Sisyphean task of...
متن کاملAutomatic Proof and Disproof in Isabelle/HOL
Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is performed by external tools: The metaprover Sledgehammer relies on resolution provers and SMT solvers for its proof search, the counterexample generator Quickcheck uses the ML compiler as a fast evaluator for ground formulas, ...
متن کاملAutomatic proofs and refutations for higher-order logic
This thesis describes work on two components of the interactive theorem prover Isabelle/HOL that generate proofs and counterexamples for higher-order conjectures by harnessing external first-order reasoners. Our primary contribution is the development of Nitpick, a counterexample generator that builds on a first-order relational model finder based on a Boolean satisfiability (SAT) solver. Nitpi...
متن کاملGenerating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induction step. (Counter)model finders are useful for detecting non-theorems, but they will not find any counterexamples for noninductive theorems. We explain how to apply a well-known concept from first-order logic, nonst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013