[llvm-commits] CVS: llvm-www/pubs/2005-09-PASTE-GreedySuiteMinimization.html 2005-09-PASTE-GreedySuiteMinimization.pdf index.html

Wed Jun 13 18:42:41 PDT 2007

Changes in directory llvm-www/pubs:

2005-09-PASTE-GreedySuiteMinimization.html added (r1.1)
2005-09-PASTE-GreedySuiteMinimization.pdf added (r1.1)
index.html updated: 1.55 -> 1.56
---
Log message:

new paper


---
Diffs of the changes:  (+59 -1)

 2005-09-PASTE-GreedySuiteMinimization.html |   52 +++++++++++++++++++++++++++++
 2005-09-PASTE-GreedySuiteMinimization.pdf  |    0 
 index.html                                 |    8 +++-
 3 files changed, 59 insertions(+), 1 deletion(-)


Index: llvm-www/pubs/2005-09-PASTE-GreedySuiteMinimization.html
diff -c /dev/null llvm-www/pubs/2005-09-PASTE-GreedySuiteMinimization.html:1.1
*** /dev/null	Wed Jun 13 20:42:29 2007

--- llvm-www/pubs/2005-09-PASTE-GreedySuiteMinimization.html	Wed Jun 13 20:42:19 2007
***************
*** 0 ****
--- 1,52 ----
+ <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+ <html>
+ <head>
+   <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
+   <link rel="stylesheet" href="../llvm.css" type="text/css" media="screen" />
+   <title>A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization</title>
+ </head>
+ 
+ <body>
+ 
+ <div class="pub_title">
+ A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization
+ </div>
+ 
+ <div class="pub_author">
+   Sriraman Tallam and Neelam Gupta
+ </div>
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ Software testing and retesting occurs continuously during the software development lifecycle to detect errors as early as possible and 
+ to ensure that changes to existing software do not break the software. Test suites once developed are reused and updated frequently 
+ as the software evolves. As a result, some test cases in the test suite 
+ may become redundant as the software is modified over time since 
+ the requirements covered by them are also covered by other test 
+ cases. Due to the resource and time constraints for re-executing 
+ large test suites, it is important to develop techniques to minimize 
+ available test suites by removing redundant test cases. In general, 
+ the test suite minimization problem is NP complete. In this paper, 
+ we present a new greedy heuristic algorithm for selecting a minimal 
+ subset of a test suite T that covers all the requirements covered by 
+ T. We show how our algorithm was inspired by the concept analysis framework. We conducted experiments to measure the extent of 
+ test suite reduction obtained by our algorithm and prior heuristics 
+ for test suite minimization. In our experiments, our algorithm always selected same size or smaller size test suite than that selected 
+ by prior heuristics and had comparable time performance. 
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ <blockquote>
+   "A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization</a>"<br>
+ By Sriraman Tallam and Neelam Gupta<br>
+ <i>ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and 
+ Engineering (PASTE 2005)</i>, Lisbon, Portugal, September 5-6, 2005. 
+ </blockquote>
+ 
+ <h2>Download:</h2>
+ <ul>
+   <li><a href="2005-09-PASTE-GreedySuiteMinimization.pdf">A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization</a> (PDF)</li>
+ </ul>
+ 
+ </body>
+ </html>


Index: llvm-www/pubs/2005-09-PASTE-GreedySuiteMinimization.pdf


Index: llvm-www/pubs/index.html
diff -u llvm-www/pubs/index.html:1.55 llvm-www/pubs/index.html:1.56
--- llvm-www/pubs/index.html:1.55	Wed Jun 13 20:24:23 2007
+++ llvm-www/pubs/index.html	Wed Jun 13 20:42:19 2007
@@ -100,7 +100,13 @@
   <i>Proc. of the ACM International Conference on Compilers,
   Architecture, and Synthesis for Embedded Systems (CASES'05)</i>,
   San Francisco, CA, September, 2005</li>
-  
+
+<li>"<a href="2005-09-PASTE-GreedySuiteMinimization.html">
+A Concept Analysis Inspired Greedy Algorithm for Test Suite Minimization</a>"<br>
+By Sriraman Tallam and Neelam Gupta<br>
+<i>ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and 
+Engineering (PASTE 2005)</i>, Lisbon, Portugal, September 5-6, 2005. </li>
+
   
 <li>"<a href="2005-08-EUROPAR-PerformanceLibs.html">Deciding Where to Call
     Performance Libraries</a>"<br>




