ACM Home Page
Please provide us with feedback. Feedback
An iterative, multi-level, and scalable approach to comparing execution traces
Full text PdfPdf (59 KB)
Source Foundations of Software Engineering archive
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers table of contents
Dubrovnik, Croatia
POSTER SESSION: ESEC/FSE'07 posters table of contents
Pages: 537 - 540  
Year of Publication: 2007
ISBN:978-1-59593-812-1
Authors
A. V. Miranskyy  University of Western Ontario, London, ON, Canada
N. H. Madhavji  University of Western Ontario, London, ON, Canada
M. S. Gittens  IBM Canada Ltd., Markham, ON, Canada
M. Davison  University of Western Ontario, London, ON, Canada
M. Wilding  IBM Canada Ltd., Markham, ON, Canada
D. Godwin  IBM Canada Ltd., Markham, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
CEPIS : The Council of European Professional Informatics Societies
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1295014.1295035
What is a DOI?

ABSTRACT

In this paper, we overview a new approach to comparing execution traces. Such comparison can be useful for purposes such as improving test coverage and profiling system's users. In our approach, traces are compressed into different levels of compaction and are then compared iteratively from highest to lowest levels, rejecting dissimilar traces in the process and eventually leaving residual, similar traces. These residual traces form an important feedback for improvement or analysis goals. The preliminary results show that the approach is scalable for industrial use.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Avvari, M. V., Chin, P. A., Nandigama, M. K. and Dhanikonda, U. S., Software application test coverage analyzer. In U.S. Patent # 6,978,401, (2005), Sun Microsystems, Inc.
 
2
 
3
 
4
Fremuth-Paeger, C. and Jungnickel, D. Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O{√|V||E|log(|V2|/|E|)/log(|V|)} bound for the nonbipartite cardinality matching problem. Networks, 41, 3 (2003), 137--142.
 
5
6
7
 
8
ILOG CPLEX http://www.ilog.com/products/cplex/.
 
9
Intel. Code-Coverage Tool http://www.intel.com/cd/software/products/asmo-na/eng/compilers/219794.htm.
 
10
 
11
Miranskyy, A. V., Madhavji, N. H., Gittens, M. S., Davison, M., Wilding, M. and Godwin, D. An Iterative, Multi-Level, and Scalable Approach to Comparing Execution Traces, TR-74.209, IBM Center for Advanced Studies (CAS), Toronto, 2007 (https://www.ibm.com/ibm/cas/publications/index.shtml). Also available as Technical Report #686, Department of Computer Science, University of Western Ontario, Canada.
 
12
Offutt, A. J., Pan, J. and Voas, J. M., Procedures for Reducing the Size of Coverage-Based Test Sets. In Proc. 12th International Conference on Testing Computer Software, (1995), 111--123.
 
13
 
14
15
16
 
17
 
18
Telcordia. xSUDS http://xsuds.argreenhouse.com/.
 
19
TestWorks TCAT http://www.soft.com/TestWorks/Products/Coverage/.
 
20
21

Collaborative Colleagues:
A. V. Miranskyy: colleagues
N. H. Madhavji: colleagues
M. S. Gittens: colleagues
M. Davison: colleagues
M. Wilding: colleagues
D. Godwin: colleagues