Programming in MODULA-2 (3rd corrected ed.)
Programming in MODULA-2 (3rd corrected ed.)
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Efficient computation of flow insensitive interprocedural summary information
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A portable optimizing compiler for Modula-2
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Data Structures and Algorithms
Data Structures and Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Integration mechanisms in Cedar
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Rigi: a model for software system construction, integration, and evolution based on module interface specifications
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
Rigi-A system for programming-in-the-large
ICSE '88 Proceedings of the 10th international conference on Software engineering
Minimizing ripple recompilation in a persistent software environment
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Management decision support through reverse engineering technology
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Identifying Failure Causes in Java Programs: An Application of Change Impact Analysis
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
This paper presents global interface analysis algorithms that analyze and limit the effects of an editing change to a basic interface of a software system. The algorithms improve on the deficiencies of the traditional compilation rule found in strongly-typed, separately-compiled programming languages, which often forces the recompilation of modules that are not at all affected by a change to a basic interface. The algorithms assume a software development environment that provides efficient access to the compilation dependencies and the module interfaces of the components being implemented. The algorithms are designed to operate on recursive compilation dependencies since separate compilation of recursive inter-module dependencies can easily be implemented in such an environment.