Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod

6 pages•Published: March 25, 2013

Abstract

Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order 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.

Keyphrases: counterexample generation, higher order logic, interactive theorem proving, model finding

In: Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors). LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning., vol 13, pages 20-25.

Links:	https://easychair.org/publications/paper/zXQs
	https://doi.org/10.29007/6shf

BibTeX entry

@inproceedings{LPAR-17-short:Nitpick_Counterexample_Generator_Isabelle/HOL,
  author    = {Jasmin Christian Blanchette},
  title     = {Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod},
  booktitle = {LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.},
  editor    = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Fermüller},
  series    = {EPiC Series in Computing},
  volume    = {13},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/zXQs},
  doi       = {10.29007/6shf},
  pages     = {20-25},
  year      = {2013}}

Download PDF Open PDF in browser