Sciweavers

314 search results - page 14 / 63
» The Complexity of Coverage
Sort
View
NFM
2011
335views Formal Methods» more  NFM 2011»
13 years 5 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
ETS
2009
IEEE
98views Hardware» more  ETS 2009»
13 years 8 months ago
Increasing Robustness of SAT-based Delay Test Generation Using Efficient Dynamic Learning Techniques
Due to the increased speed in modern designs, testing for delay faults has become an important issue in the postproduction test of manufactured chips. A high fault coverage is nee...
Stephan Eggersglüß, Rolf Drechsler
SAC
2008
ACM
13 years 10 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
KBSE
1998
IEEE
14 years 3 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
SIGMETRICS
2010
ACM
143views Hardware» more  SIGMETRICS 2010»
14 years 3 months ago
Practical performance models for complex, popular applications
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
Eno Thereska, Bjoern Doebel, Alice X. Zheng, Peter...