in reply to Automated Path Coverage Test Case Generation
I can imagine two ways for this, one easy and one hard:
The easy way would be to write a rudimentary parser that recognizes subroutines, be they methods or plain functions, and within those, recognizes loops and conditionals. For every loop and conditional, it generates mock up code that has possibly to be modified by a human to exercize the boundaries/alternatives.
The hard way is to have a parser for the language to find out what the procedures/methods and conditionals and loops are. Then you can also apply some heuristics to generate from a "known good" test case the negated test case to test for some opposite.
But I would go with the simple approach of automatically generating skeleton tests that reference back to the original code and have these manually fixed by a human.
perl -MHTTP::Daemon -MHTTP::Response -MLWP::Simple -e ' ; # The $d = new HTTP::Daemon and fork and getprint $d->url and exit;#spider ($c = $d->accept())->get_request(); $c->send_response( new #in the HTTP::Response(200,$_,$_,qq(Just another Perl hacker\n))); ' # web
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Re: Automated Path Coverage Test Case Generation
by ChrisS (Monk) on Oct 06, 2003 at 14:05 UTC | |
by Corion (Patriarch) on Oct 06, 2003 at 14:21 UTC |