Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Type-driven defunctionalization
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
A sound type system for secure flow analysis
Journal of Computer Security
Automated theorem proving in software engineering
Automated theorem proving in software engineering
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Random Testing in Isabelle/HOL
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Relational analysis of algebraic datatypes
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Alloy analyzer+PVS in the analysis and verification of alloy specifications
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Finding lexicographic orders for termination proofs in Isabelle/HOL
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Verifying a hotel key card system
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Monotonicity inference for higher-order formulas
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automatic and efficient simulation of operation contracts
GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generating counterexamples for structural inductions by exploiting nonstandard models
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
Integrating an automated theorem prover into agda
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Verifying the modal logic cube is an easy task: for higher-order automated reasoners
Verification, induction termination analysis
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Extensive validation of OCL models by integrating SAT solving into USE
TOOLS'11 Proceedings of the 49th international conference on Objects, models, components, patterns
Satisfiability modulo recursive programs
SAS'11 Proceedings of the 18th international conference on Static analysis
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Monotonicity Inference for Higher-Order Formulas
Journal of Automated Reasoning
Automated specification analysis using an interactive theorem prover
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
Monotonicity inference for higher-order formulas
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Smart testing of functional programs in isabelle
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The CADE-23 Automated Theorem Proving System Competition - CASC-23
AI Communications
Strengthening SAT-based validation of UML/OCL models by representing collections as relations
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
From UML and OCL to relational logic and back
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
The new quickcheck for isabelle: random, exhaustive and symbolic testing under one roof
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Featherweight OCL: a study for the consistent semantics of OCL 2.3 in HOL
Proceedings of the 12th Workshop on OCL and Textual Modelling
The poor man's proof assistant: using prolog to develop formal language theoretic proofs
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity
The poor man's proof assistant: using prolog to develop formal language theoretic proofs
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity
Automating quantified conditional logics in HOL
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Dynamite: A tool for the verification of alloy models based on PVS
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
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. As case studies, we consider a security type system and a hotel key card system. 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.