Advanced chopping of sequential and concurrent programs.
Gespeichert in:
| Titel: | Advanced chopping of sequential and concurrent programs. |
|---|---|
| Autoren: | Giffhorn, Dennis |
| Quelle: | Software Quality Journal; Jun2011, Vol. 19 Issue 2, p239-294, 56p |
| Schlagwörter: | COMPUTER software, ALGORITHMS, PRECISION (Information retrieval), JAVA programming language, COMPUTER software quality control |
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Software Quality Journal is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Datenbank: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!