Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Parallel Relative Debugging with Dynamic Data Structures David Abramson , Raphael Finkel , Donny Kurniawan , Victor Kowalenko , Greg Watson
 

Summary: Parallel Relative Debugging with Dynamic Data Structures
David Abramson , Raphael Finkel , Donny Kurniawan , Victor Kowalenko , Greg Watson
School of Computer Science Department of Computer Science Advanced Computing Lab
& Software Engineering, University of Kentucky Los Alamos National Laboratory,
Monash University, Clayton Lexington, Kentucky Los Alamos, NM, 87545,
Australia, 3800 U.S.A. U.S.A.
davida@csse.monash.edu.au raphael@cs.uky.edu gwatson@lanl.gov
Abstract
This paper discusses the use of "relative debugging" as a
technique for locating errors in a program that has been
ported or developed using evolutionary software
engineering techniques. It works on the premise that it is
possible to find errors by comparing the contents of key
data structures at run time between a "working" version
and the new code. Previously, our reference
implementation of relative debugging, called Guard, only
supported comparison of regular data structures like
scalars, simple structures and arrays. Recently, we
augmented Guard enabling it to compare dynamically
allocated structures like linked lists. Such comparisons

  

Source: Abramson, David - Caulfield School of Information Technology, Monash University

 

Collections: Computer Technologies and Information Sciences