Random testing in Isabelle/HOL

Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Volumn , Issue , 2004, Pages 230-239

  Berghofer, Stefan ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ISABELLE/HOL; NON-TRIVIAL FORMALIZATIONS; POLYTYPIC PROGRAMMING; RANDOM TESTING;

COMPUTER PROGRAMMING; DATA ACQUISITION; MATHEMATICAL MODELS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; TESTING;

RANDOM PROCESSES;

EID: 16244421092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2004.1347524     Document Type: Conference Paper

References (14)

1. S. Berghofer and T. Nipkow. Executing higher order logic. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs (TYPES 2000), volume 2277 of Lecture Notes in Computer Science, pages 24-40. Springer-Verlag, 2002.
2. P. E. Black, V. Okun, and Y. Yesha. Mutation Operators for Specifications. In 15th Automated Software Engineering Conference (ASE2000), Grenoble, France (September 2000), pages 81-88. IEEE Computer Society, 2000.
3. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proceed ings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), volume 9 of SIGPLAN Notices, pages 268-279. ACM, September 2000.
4. R.A.DeMillo,R.J.Lipton,andF.G.Sayward. Hintson test data selection: help for the practicing programmer. Computer, 11(4):34-41, Apr. 1978.
5. P. Dybjer, Q. Haiyan, and M. Takeyama. Combining testing and proving in dependent type theory. In D. Basin and B. Wolff, editors, 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), Rome, Italy, volume 2758 of Lecture Notes in Computer Science, pages 188-203. Springer-Verlag, 2003.
6. M. Hanus. The integration of functions into logic programming: From theory to practice. J. Logic Programming, 19&20:583-628, 1994.
7. D. Jackson. Automating first-order relational logic. In Proc. 8th ACM SIGSOFT Int. Symp. Foundations of software engineering, pages 130-139. ACM Press, 2000.
8. J. Jeuring and P. Jansson. Polytypic programming. In J. Launchbury, E. Meijer, and T. Sheard, editors, Advanced Functional Programming, Second International School, volume 1129 of Lecture Notes in Computer Science, pages 68-114. Springer-Verlag, 1996.
9. A. Kimming. Red-black trees of SmlNJ. Studienarbeit, Universita5t Freiburg, January 2004.
10. C. Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, 1993. LIP research report 92-49.
11. J. Slaney. FINDER, finite domain enumerator. In A. Bundy, editor, Automated Deduction (CADE-12), volume 814 of Lecture Notes in Computer Science, pages 798-801. Springer-Verlag, 1994.
12. K. Slind and J. Hurd. Applications of Polytypism in Theorem Proving. In D. Basin and B. Wolff, editors, 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), Rome, Italy, volume 2758 of Lecture Notes in Computer Science, pages 103-119. Springer-Verlag, 2003.
13. T. Weber. Bounded model generation for Isabelle/HOL. In 2nd Int. Joint Conf. Automated Reasoning (IJCAR 2004), Workshop on Disproving - Non-Theorems, Non-Validity, Non-Provability, 2004.
14. J. Zhang and H. Zhang. SEM: a system for enumerating models. In Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI95), pages 298-303, 1995.