Skip to main content
edited tags
Link
user246
user246
Tweeted twitter.com/#!/StackSQA/status/392267099961569280
Made a title more generic
Link
dzieciou
  • 10.5k
  • 9
  • 48
  • 102

tools Tool to minimize set of testing files while keeping maximumtests number and maximize code coverage when testing an application

Added link to the mentioned tool
Source Link
dzieciou
  • 10.5k
  • 9
  • 48
  • 102

I am currently undergoing black-box testing campaigns for applications that require file input in linux environments. For that I need sets of test files of different formats that can be used to be passed as input to the different applications I am interested in.

To monitor the code coverage for a specific set of testing files, I am using lcov/gcov. The problem is that a set of files that has decent code coverage can become rather large, therefore taking a lot(and I mean a lot) of time to complete the tests using such a set. So I would like to be able to minimize such a set, while keeping the same code coverage (in other words eliminate the redundant test files that stress the same part of an application).

I tried using the minset tool from the peach fuzzing frameworkminset tool from the peach fuzzing framework, which would be exactly what I would need but unfortunately it can be only used on Windows and as far as i have tried cannot be ported on linux-like operating systems.

So, do you guys know any tool that could do what I have described above. Or perhaps have an idea on how I could achieve that. Thanks a lot.

I am currently undergoing black-box testing campaigns for applications that require file input in linux environments. For that I need sets of test files of different formats that can be used to be passed as input to the different applications I am interested in.

To monitor the code coverage for a specific set of testing files, I am using lcov/gcov. The problem is that a set of files that has decent code coverage can become rather large, therefore taking a lot(and I mean a lot) of time to complete the tests using such a set. So I would like to be able to minimize such a set, while keeping the same code coverage (in other words eliminate the redundant test files that stress the same part of an application).

I tried using the minset tool from the peach fuzzing framework, which would be exactly what I would need but unfortunately it can be only used on Windows and as far as i have tried cannot be ported on linux-like operating systems.

So, do you guys know any tool that could do what I have described above. Or perhaps have an idea on how I could achieve that. Thanks a lot.

I am currently undergoing black-box testing campaigns for applications that require file input in linux environments. For that I need sets of test files of different formats that can be used to be passed as input to the different applications I am interested in.

To monitor the code coverage for a specific set of testing files, I am using lcov/gcov. The problem is that a set of files that has decent code coverage can become rather large, therefore taking a lot(and I mean a lot) of time to complete the tests using such a set. So I would like to be able to minimize such a set, while keeping the same code coverage (in other words eliminate the redundant test files that stress the same part of an application).

I tried using the minset tool from the peach fuzzing framework, which would be exactly what I would need but unfortunately it can be only used on Windows and as far as i have tried cannot be ported on linux-like operating systems.

So, do you guys know any tool that could do what I have described above. Or perhaps have an idea on how I could achieve that. Thanks a lot.

Source Link
Loading