Mechanized metatheory model-checking
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Automated Test Generation and Verified Software
Verified Software: Theories, Tools, Experiments
The Importance of Non-theorems and Counterexamples in Program Verification
Verified Software: Theories, Tools, Experiments
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Proof Pearl: Mechanizing the Textbook Proof of Huffman's Algorithm
Journal of Automated Reasoning
Formal Proof: Reconciling Correctness and Understanding
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Formalising FinFuns --- Generating Code for Functions as Data from Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Testing and proving distributed algorithms in constructive type theory
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Finding counter examples in induction proofs
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Functional testing in the focal environment
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Testing data types implementations from algebraic specifications
Formal methods and testing
Testing first-order logic axioms in program verification
TAP'10 Proceedings of the 4th international conference on Tests and proofs
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Scheme-based synthesis of inductive theories
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
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
Conjecture Synthesis for Inductive Theories
Journal of Automated Reasoning
Scheme-based theorem discovery and concept invention
Expert Systems with Applications: An International Journal
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Verifying a hotel key card system
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Automated specification analysis using an interactive theorem prover
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Smart testing of functional programs in isabelle
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
A framework for testing first-order logic axioms in program verification
Software Quality Control
Testing noninterference, quickly
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Experience report: applying random testing to a base type environment
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Light-Weight containers for isabelle: efficient, extensible, nestable
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
When developing non-trivial formalizations in a theorem prover, a considerable amount of time is devoted to "debugging" specifications and conjectures by failed proof attempts.To detect such problems early in the proof and save development time, we have extended the Isabelle theorem prover with a tool for testing specifications by evaluating propositions under an assignment of random values to free variables.Distribution of the test data is optimized via mutation testing.The technical contributions are an extension of earlier work with inductive definitions and a generic method for randomly generating elements of recursive datatypes.