The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Refactoring: improving the design of existing code
Refactoring: improving the design of existing code
Alto: a link-time optimizer for the Compaq alpha
Software—Practice & Experience
Partitioning and Labeling of Loops by Unimodular Transformations
IEEE Transactions on Parallel and Distributed Systems
Structural Manipulations of Software Architecture Using Tarski Relational Algebra
WCRE '98 Proceedings of the Working Conference on Reverse Engineering (WCRE'98)
E/R Schema for the Datrix C/C++/Java Exchange Format
WCRE '00 Proceedings of the Seventh Working Conference on Reverse Engineering (WCRE'00)
GXL: Toward a Standard Exchange Format
WCRE '00 Proceedings of the Seventh Working Conference on Reverse Engineering (WCRE'00)
Partitioning Loops with Variable Dependence Distances
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Quality-based software release management
Quality-based software release management
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Identifying refactoring opportunities by identifying dependency cycles
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Optimizing header file include directives
Journal of Software Maintenance and Evolution: Research and Practice
Improving the build architecture of legacy c/c++ software systems
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
The development of large software systems involves a continual lengthy build process that may include preprocessing, compilation and linking of tens of thousands of source code files. In many cases, much of this build time is wasted because of false dependencies between implementation files and their respective header files. We present a graph algorithm and a programming tool that discovers and removes false dependencies among files. We show experimentally that the resulting preprocessed code is more compact, thereby contributing to faster build processes.