Data Reverse Engineering using System Dependency Graphs
Authors:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 157-166
Abstract
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 projectsKeywords
This publication has 15 references indexed in Scilit:
- Slicing programs with arbitrary control-flow2005
- Program slicing in the presence of database state2004
- Term rewriting with traversal functionsACM Transactions on Software Engineering and Methodology, 2003
- Program and interface slicing for reverse engineering2002
- Scaffolding for software renovation2002
- Semi‐automatic grammar recoverySoftware: Practice and Experience, 2001
- Correct program slicing of database operationsIEEE Software, 1998
- A new model of program dependences for reverse engineering1994
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- Program SlicingIEEE Transactions on Software Engineering, 1984