Academic Journal
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas
| العنوان: | Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas |
|---|---|
| المؤلفون: | Danicic, Sebastian, Fox, Chris, Harman, Mark, Hierons, Rob, Howroyd, John, Laurence, Michael R. |
| بيانات النشر: | Oxford University Press |
| سنة النشر: | 2005 |
| المجموعة: | HighWire Press (Stanford University) |
| مصطلحات موضوعية: | Computer Languages |
| الوصف: | Program slicing is an automated source code extraction technique that has been applied to a number of problems including testing, debugging, maintenance, reverse engineering, program comprehension, reuse and program integration. In all these applications the size of the slice is crucial; the smaller the better. It is known that statement minimal slices are not computable, but the question of dataflow minimal slicing has remained open since Weiser posed it in 1979. This paper proves that static slicing algorithms produce dataflow minimal end slices for programs which can be represented as schemas which are free and liberal. |
| نوع الوثيقة: | text |
| وصف الملف: | text/html |
| اللغة: | English |
| Relation: | http://comjnl.oxfordjournals.org/cgi/content/short/48/6/737; http://dx.doi.org/10.1093/comjnl/bxh121 |
| DOI: | 10.1093/comjnl/bxh121 |
| الاتاحة: | http://comjnl.oxfordjournals.org/cgi/content/short/48/6/737 https://doi.org/10.1093/comjnl/bxh121 |
| Rights: | Copyright (C) 2005, British Computer Society |
| رقم الانضمام: | edsbas.B44C5F8F |
| قاعدة البيانات: | BASE |
| DOI: | 10.1093/comjnl/bxh121 |
|---|