Static slicing of threaded programs

Abstract

Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing method for threaded programs which handles interference correctly. We present such a method which also calculates more precise static slices. This paper extends the well known structures of the control flow graph and the program dependence graph for threaded programs with interference. This new technique does not require serialization of threaded programs.

Advanced chopping of sequential and concurrent programs

“…Due to shared-memory communication, concurrent programs exhibit a special kind of data dependence called interference dependence (Krinke 1998): A statement n is interference dependent on statement m, represented in the SDG by an interference edge m ? id n, if n may use a value computed at m, and m and n may execute concurrently.…”

“…cSDGs give rise to a new kind of imprecision, so-called time travel (Krinke 1998). An execution order between two sequentially executing statements is time travel if it contravenes the execution order specified by the program's control flow.…”

“…Slicing on PDNs is performed using simple graph reachability. Krinke (1998Krinke ( , 2003b (ESEC/FSE)) was the first to address the time travel problem for slicing of concurrent programs. Ramesh (2000, 2006) developed an alternative algorithm containing several optimizations that strongly reduce the combinatorial explosion of thread execution state tuples.…”

Computing dynamic slices of concurrent object-oriented programs

“…Static slicing of concurrent object-oriented programs has been addressed by many researchers [25,27,[32][33][34][35][36]. Excellent surveys on static slicing of concurrent object-oriented programs can be found in [37].…”

Software-Sicherheitsprüfung mit VALSOFT

“…Selbst für logische, funktionale oder objekt-orientierte Sprachen läßt sich Slicing ohne große Probleme einsetzen. Allerdings ist dies bei Sprachen für parallele Programmierung nicht der Fall, da dort notwendige Voraussetzungen für die Darstellung von Abhängigkeiten nicht gegeben sind [12].…”