✦ LIBER ✦

Computation of dynamic program slices for unstructured programs

✍ Scribed by Korel, B.

Book ID: 117872158
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 293 KB
Volume: 23
Category: Article
ISSN: 0098-5589
DOI: 10.1109/32.581327

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic slicing of computer programs

✍ Bogdan Korel; Janusz Laski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

A new algorithm for slicing unstructured

A new algorithm for slicing unstructured programs

✍ Harman, Mark; Danicic, Sebastian 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB 👁 1 views

Program slicing is an automatic program abstraction technique whose many applications include software maintenance, re-engineering and comprehension, all of which rely crucially upon the precision of the slicing algorithm used. When slicing is applied to maintenance problems, the programs to be slic

An efficient method for computing dynami

An efficient method for computing dynamic program slices

✍ D. Goswami; R. Mall 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices usin

Dynamic program slicing

✍ Bogdan Korel; Janusz Laski 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 768 KB

A hybrid dynamic program slicing

✍ Tong Yi; Fangjun Wu 📂 Article 📅 2005 🏛 SP Science Press 🌐 English ⚖ 247 KB

Theoretical foundations of dynamic progr

Theoretical foundations of dynamic program slicing

✍ Dave Binkley; Sebastian Danicic; Tibor Gyimóthy; Mark Harman; Ákos Kiss; Bogdan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 423 KB