ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Systems and Software
Volume 42, Issue 2, August 1998, Pages 153-164
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (216 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0164-1212(98)10006-7    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1998 Elsevier Science B.V. All rights reserved.

An integrated environment for reuse reengineering C code

Gerardo Canforaa, *, Andrea De Luciaa and Malcolm Munro1, b

a Department of 'Ingegneria dell'Informazione ed Ingegneria Elettrica', University of Salerno, Faculty of Engineering at Benevento, Palazzo Bosco Lucarelli, Piazza Roma, 82100 Benevento, Italy b Centre for Software Maintenance, University of Durham, Durham DH1 3LE, UK

Received 10 December 1996;
revised 10 November 1997.
Available online 30 November 1998.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The paper presents an integrated environment implemented in Prolog for reuse reengineering existing C systems. Different tools developed in the RE2 project are integrated in the environment through sharing a fine-grained representation for C programs, the Combined C Graph (CCG). Different views of a system can be abstracted and visualised from the data-base of Prolog facts implementing its CCG representation. Software metric tools evaluate the reengineering costs, while reengineering operations are expressed as transformation rules and a symbolic executor allows the production of the reusable module's specification.

Article Outline

1. Introduction
2. Related work
3. Candidature criteria
4. An integrated reuse reengineering environment
4.1. The combined C graph
5. Integrating the candidature tools
5.1. An example of summary relations
6. Integrating the election and qualification tools
7. Concluding remarks
Appendix A: CCG prolog facts
A.1. Declarations
A.2. Abstract syntax tree
A.3. Control flow graph
A.4. Interprocedural edges
A.5. Program dependencies
References
Vitae




 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.