Introduction to algorithms
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Algorithms; A Functional Programming Approach
Algorithms; A Functional Programming Approach
Systematic generation of glass-box test cases for functional logic programs
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
GAST: generic automated software testing
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
Transforming Haskell for tracing
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Verification of java bytecode using analysis and transformation of logic programs
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Fast and sound random generation for automated testing and benchmarking in objective Caml
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Programming with narrowing: A tutorial
Journal of Symbolic Computation
From functional logic programs to purely functional programs preserving laziness
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
| Hi-index | 0.00 |
We propose a novel notion of data-flow coverage for testing declarative programs. Moreover, we extend an automatic test-case generator such that it can achieve data-flow coverage. The coverage information is obtained by instrumenting a program such that it collects coverage information during its execution. Finally, we show the benefits of data-flow based testing for a couple of example applications.