A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies

Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary information, and call graph views. If the source program changes, the derived information needs to be updated. We present a simple framework for maintaining intermodule dependencies, embodying different tradeoffs in terms of space usage, speed of processing, and selectivity of invalidation, that eases the implementation of incremental update of derived information. Our framework augments a directed acyclic graph representation of dependencies with factoring nodes (to save space) and filtering nodes (to increase selectivity), and it includes an algorithm for efficient invalidation processing. We show how several schemes for selective recompilation, such as smart recompilation, filter sets for interprocedural summary information, and dependencies for whole-program optimization of object-oriented languages, map natur...

• Type: Conference
• Year: 1995
• Where: ICSE
• Authors: Craig Chambers, Jeffrey Dean, David Grove
• Keywords: Directed Acyclic Graph, ICSE 1995, Interprocedural Summary Information, Software Engineering, Source Code