[giffhorn11sqj] | Dennis Giffhorn, Advanced chopping of sequential and concurrent programs, Software Quality Journal, Vol. 19, (2), pp. 239--294, 2011.
|
Abstract
A chop for a source statement s and a target statement t reveals the
program parts involved in conveying effects from s to t. While precise
chopping algorithms for sequential programs are known, no chopping
algorithm for concurrent programs has been reported at all. This
work introduces six chopping algorithms for concurrent programs,
which offer different degrees of precision, ranging from imprecise
over context-sensitive to time-sensitive. Our evaluation on concurrent
Java programs shows that context-sensitive and time-sensitive chopping
reduces chop sizes significantly. We further present an extensive
evaluation of chopping algorithms for sequential programs and describe
a new, easy to implement chopping technique for sequential programs
that computes fast and almost context-sensitive chops.
Download
Original article available at springerlink.com.
BibTeX
Authors at the institute
Projects