Faragó Csaba and Gergely Tamás: Handling pointers and unstructured statements in the forward computed dynamic slice algorithm. In: Acta cybernetica, (15) 4. pp. 489-508. (2002)
Preview |
Cikk, tanulmány, mű
cybernetica_015_numb_004_489-508.pdf Download (1MB) | Preview |
Abstract
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing type. In applications such as debugging the computation of dynamic slices is more preferable since it can produce more precise results. In a recent paper [5] a new so-called "forward computed dynamic slice" algorithm was introduced. It has the great advantage compared to other dynamic slice algorithms that the memory requirements of this algorithm are proportional to the number of different memory locations used by the program, which in most cases is much smaller than the size of the execution history. The execution time of the algorithm is linear in the size of the execution history. In this paper we introduce the handling of pointers and the jump statements (goto, break, continue) in the C language.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2002 |
| Volume: | 15 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 489-508 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | Finno-Ugoric Symposium on Programming Languages and Software Tools (7.) (2001) (Szeged) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38514/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 507-508. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 14. 13:40 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12692 |
Actions (login required)
 |
View Item |
