Data Reverse Engineering using System Dependency Graphs
Data reverse engineering (DRE) is a complex and costly process that requires a deep understanding of large data-intensive software systems. This process can be made easier with the use of program understanding methods and tools. In this paper, we focus on the program slicing technique and we show ho...
| Main Authors: | , , |
|---|---|
| Other Authors: | , , |
| Format: | Other Non-Article Part of Journal/Newspaper |
| Language: | English |
| Published: |
IEEE Computer society
2006
|
| Subjects: | |
| Online Access: | https://researchportal.unamur.be/en/publications/data-reverse-engineering-using-system-dependency-graphs(a445d7d8-af51-4a70-a402-54c1c0aed743).html |
| Summary: | Data reverse engineering (DRE) is a complex and costly process that requires a deep understanding of large data-intensive software systems. This process can be made easier with the use of program understanding methods and tools. In this paper, we focus on the program slicing technique and we show how it can be adapted to support DRE. We present a DML-independent SDG construction approach involving the analysis of database operations as a first stage. We describe a tool based upon this approach and we report on two industrial DRE projects. Data reverse engineering (DRE) is a complex and costly process that requires a deep understanding of large data-intensive software systems. This process can be made easier with the use of program understanding methods and tools. In this paper, we focus on the program slicing technique and we show how it can be adapted to support DRE. We present a DML-independent SDG construction approach involving the analysis of database operations as a first stage. We describe a tool based upon this approach and we report on two industrial DRE projects. |
|---|