论文信息 - Data-flow testing of declarative programs

Data-flow testing of declarative programs

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.

Herbert Kuchen | Sebastian Fischer

[1] Peyton Jones,et al. Haskell 98 language and libraries : the revised report , 2003 .

[2] Herbert Kuchen,et al. Systematic generation of glass-box test cases for functional logic programs , 2007, PPDP '07.

[3] Elvira Albert,et al. Verification of Java Bytecode Using Analysis and Transformation of Logic Programs , 2007, PADL.

[4] Herbert Kuchen,et al. A symbolic Java virtual machine for test case generation , 2004, IASTED Conf. on Software Engineering.

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[6] Michael Hanus,et al. Curry: an integrated functional logic language (version 0 , 2003 .

[7] Colin Runciman,et al. Haskell program coverage , 2007, Haskell '07.

[8] Boris Beizer,et al. Black-box testing , 1995 .

[9] Sebastian Fischer,et al. EasyCheck - Test Data for Free , 2008, FLOPS.

[10] Fethi A. Rabhi,et al. Algorithms: A Functional Programming Approach , 1999 .

[11] Colin Runciman,et al. Transforming Haskell for Tracing , 2002, IFL.

[12] Marinus J. Plasmeijer,et al. Gast: Generic Automated Software Testing , 2002, IFL.