Random testing in Isabelle/HOL
暂无分享,去创建一个
[1] John K. Slaney,et al. FINDER: Finite Domain Enumerator - System Description , 1994, CADE.
[2] Peter Dybjer,et al. Combining Testing and Proving in Dependent Type Theory , 2003, TPHOLs.
[3] Tjark Weber,et al. Bounded Model Generation for Isabelle/HOL , 2005, D/PDPAR@IJCAR.
[4] Christine Paulin-Mohring,et al. Inductive Definitions in the system Coq - Rules and Properties , 1993, TLCA.
[5] Daniel Jackson. Automating first-order relational logic , 2000, SIGSOFT '00/FSE-8.
[6] Michael Hanus,et al. The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..
[7] Koen Claessen,et al. QuickCheck: a lightweight tool for random testing of Haskell programs , 2000, ICFP.
[8] Richard J. Lipton,et al. Hints on Test Data Selection: Help for the Practicing Programmer , 1978, Computer.
[9] Joe Hurd,et al. Applications of Polytypism in Theorem Proving , 2003, TPHOLs.
[10] Vadim Okun,et al. Mutation operators for specifications , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.
[11] Johan Jeuring,et al. Polytypic Programming , 1996, Advanced Functional Programming.
[12] Hantao Zhang,et al. SEM: a System for Enumerating Models , 1995, IJCAI.
[13] Tobias Nipkow,et al. Executing Higher Order Logic , 2000, TYPES.