KIT | KIT-Bibliothek | Impressum | Datenschutz

Chopping Concurrent Programs

Giffhorn, Dennis

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 five 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 can reduce chop sizes significantly.


Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2009
Sprache Englisch
Identifikator ISBN: 978-0-7695-3793-1
KITopen-ID: 1000017606
Erschienen in SCAM '09 - Ninth IEEE International Working Conference on Source Code Analysis and Manipulation, 20-21 September 2009, Edmonton, AB
Verlag Institute of Electrical and Electronics Engineers (IEEE)
Seiten 13 - 22
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page