W. F. Tichy and M. C. Baker, `Smart recompilation', Proc Twelfth POPL, 1985, pp. 236--244.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....whenever (1) its own implementation changes, or (2) an interface changes upon which the program unit depends. Modifying a comment or adding extra specifications to an interface cause unnecessary recompilation. A more relaxed version of the preceding method is called smart recompilation [Tic86] A program unit must be recompiled whenever (1) its own implementation changes, or (2) if it references an identifier whose specification has changed. Frameworks for separate compilation that allow a program unit to be compiled based on interfaces, provided by the programmer, for those ....

Walter Tichy. Smart recompilation. In ACM Transactions on Programming Languages and Systems, pages 273--291, July 1986.

....components of a program, the actions required to build the program, and the dependences among the components. Modification to a component is enough to force rebuilding of components that depend upon it. Tichy and Baker considered a finer granularity for establishing dependences among components [TB85] Their method determines the portions of a component that are shared by other components: definitions, declarations and constants. This is basically the interface to the outside. Then modification of a component can only force recompilation of other components if the interface changes. ....

W. F. Tichy and M. C. Baker. Smart recompilation. In Conference Record of the Twelfth Annual Symposium on Principles of Programming Languages. ACM, January 1985.

....our approach involves first computing the abstract semantics for different modules and then composing these abstract semantics. The problem of program analysis across module boundaries for imperative languages has been considered by a number of researchers: Cooper et al. 13] and Tichy et al. [32] are concerned primarily with low level details of maintaining information to allow a compiler to determine whether a change to one program unit necessitates the recompilation of another, separately compiled, unit, while Santhanam and Odnert [31] consider register allocation across module ....

W.F. Tichy and M.C. Baker. Smart Recompilation. In Proc. of Twelfth ACM Symp. on Principles of Programming Languages, pages 236--244. ACM, 1985. 14

....that the interfaces with the instantiated components are correct. Even though a change in a design unit influences only a small portion of the design, the situation that the whole design has to be re analyzed can occur. Tichy tried to resolve the same problem in programming language compilers[2]. His compilers look into programs, and find the compilation units semantically affected by incremental changes. In programming languages, it is sufficient to look at only the context to determine whether a compilation unit must be re compiled or not. For example, in C language, if a header file ....

....or transitively using the directive #include. However, the dependency between design units in VHDL is more complex. Package, entity, architecture, and configuration depend on each other in VHDL. Not only declarations but also the design hierarchy make the dependency. To apply the idea in [2] to VHDL, an extension of the algorithm is needed to treat this dependency. The next section presents the basic idea and an example. In Section 3, several definitions used in the algorithm are given. The incremental analysis algorithm is described in Section 4. The experimental results are ....

Walter F. Tichy, "Smart Recompilation," ACM Transactions on Programming Languages and Systems, Vol. 8, No. 3, pp. 273-291, July 1986.

....update for guarantee of safety. Our approach is that the specifications of implementation modules may be manually or automatically derived from the modules in order to ensure their consistency. The separate compilation is done in three steps: automatic specification generation, change analysis [25], and compilation or recompilation. The automatic specification generation approach eliminates the writing of specification modules which are required to provide interface information. The modification of implementation modules causes the compiler to generate their specifications. After the ....

....of a large system because the number of states of numerical Petri Net can increase rapidly due to incremental integration of SDL specification. However, it is helpful in the early time of the design phase for checking interactions among blocks. Although Tichy s separate compilation scheme [25] minimizes recompilations by incremental change analysis, it causes the difficult problem to determine the sequence of the recompilations for resolving semantic and its cyclic dependency. Our separate compilation scheme also minimizes recompilation. Moreover, our separate compilation scheme does ....

Walter F. Tichy, "Smart recompilation," ACM TransactionsonProgrammingLanguagesand Systems, vol. 8, no. 3, 1986, pp. 273-291.

....have changed: the abstract semantics computed for the other modules can be reused without any problems, and the new abstract semantics for the program computed simply by composing them with the (new) abstract semantics computed for the modules that have changed. Contrast this to the work of [10, 24], where it is necessary to reanalyze not only the modules that have changed, but (potentially) also any module that depends on a changed module. In this section, we illustrate this reuse of abstract semantics with an example. Example 13 Consider again the program of Example 1: suppose the module ....

....formal treatment of abstract interpretation based on such semantics would require considerably more machinery than that given here. The problem of program analysis across module boundaries for imperative languages has been considered by a number of researchers: Cooper et al. 10] and Tichy et al. [24] are concerned primarily with low level details of maintaining information to allow a compiler to determine whether a change to one program unit necessitates the recompilation of another, separatelycompiled, unit, while Santhanam and Odnert [23] consider register allocation across module ....

W.F. Tichy and M.C. Baker. Smart Recompilation. In Proc. Twelfth ACM Symp. on Principles of Programming Languages, pp. 236--244. ACM, 1985.

....implementation of Infuse has been completed, and is being used in its own further development. Infuse is implemented in C and runs on MicroVax, Sun and HP workstations. The prototype includes a hierarchical clustering algorithm [13] a simple object repository implemented using IDL [25] and RCS [27], a simple graphical browsing interface constructed using X windows, and a hierarchical reserve deposit model that enforces syntactic consistency (using the Unix lint utility) before permitting deposit into the next higher level of the hierarchy. 1. A module is any separately ....

Walter F. Tichy, "Smart Recompilation", ACM Transactions on Programming Languages and Systems, 8, 3, July, 1986, pp273-291.

....rest of the interface, we should also avoid recompilation. If changes are made to certain routines but not to others, we should recompile only those processes whose behavior would otherwise be incorrect. It is possible to build a compiler that incorporates a formal notion of upward compatibility [33]. Such a compiler could implement run time checking of name equivalence for types, but its construction would not be easy (even in the absence of multiple sites) and its checking would likely be costly. Lynx sidesteps these problems by using structural type equivalence: no central database of ....

W. F. Tichy, "Smart Recompilation," ACM Transactions on Programming Languages and Systems 8:3 (July 1986), pp. 273-291. Relevant correspondence appears in Volume 10, Nunber 4.

....[12] The software environments that have been built around the thesauri focus on change management and include tools that display structures and dependencies and provide impact analysis. In the persistent case, automatic build management is supported, including installation, smart recompilation [15] and re execution according to a persistent programming methodology. To prevent deteriorating structure and improve maintainability, a set of application independent constraints have been defined [14] The programming environment automatically verifies these constraints. The present tools focus on ....

W. Tichy. "Smart Recompilation". ACM Transactions on Programming Languages and Systems, Vol. 8, No. 3, pp. 273--291, July 1986.

....should be noted that an inline dependency never exists alone, but is always combined with a body dependency. The detection of the affected program units consists of two phases. In the first phase the edit changes are analysed and a change set is computed in a similar way as in Tichy s algorithm [Tichy 86] In the second phase the changes are propagated using the compilation dependencies and the set of affected program units is computed. The edit change analysis is given two sets of parse trees T current and T old . They are, for example, the results of parsing the old contents of and an editor ....

....ADA because only dependencies that are introduced via WITH clauses may be cut. The main difference between Rain s algorithm and ours is that Rain s algorithm does not separate the detection of affected program units from the actual recompilation. Also the grain size of recompilation is different. Tichy 86] presents a smart recompilation algorithm that solves a slightly different problem: Given a compilation unit M 0 (e.g. a program file) and a set of contexts (e.g. definition files) M 1 ; Mn , assume that the configuration fM 0 ; Mn g is legal and was compiled successfully. If ....

Tichy, W. F., Smart Recompilation, ACM TOPLAS, Vol. 8, No. 3, July 1986, pp. 273291.

....this model to build the relationships between objects in a program. While most compilers use the generic form of the interconnection model in order to provide there semantic analysis, Lint requires a richer model in order to determine such things as unreachable code, unset variables, etc. Tichy [28] uses the syntactic model to determine the effects of changes within a module and the necessity of recompilation. As in the unit model, the relations of change, addition and deletion are added to the relations of the syntactic model and used to determine whether a particular change necessitates ....

Walter F. Tichy. "Smart Recompilation", ACM Transactions on Programming Languages and Systems, 8:3 (July 1986), pp.273-291.

....have changed: the abstract semantics computed for the other modules can be reused without any problems, and the new abstract semantics for the program computed simply by composing them with the (new) abstract semantics computed for the modules that have changed. Contrast this to the work of [10,24], where it is necessary to reanalyze not only the modules that have changed, but (potentially) also any module that depends on a changed module. In this section, we illustrate this reuse of abstract semantics with an example. Example 13 Consider again the program of Example 1: suppose the module ....

....formal treatment of abstract interpretation based on such semantics would require considerably more machinery than that given here. The problem of program analysis across module boundaries for imperative languages has been considered by a number of researchers: Cooper et al. 10] and Tichy et al. [24] are concerned primarily with low level details of maintaining information to allow a compiler to determine whether a change to one program unit necessitates the recompilation of another, separatelycompiled, unit, while Santhanam and Odnert [23] consider register allocation across module ....

W.F. Tichy and M.C. Baker. Smart Recompilation. In Proc. Twelfth ACM Symp. on Principles of Programming Languages, pp. 236--244. ACM, 1985.

No context found.

W. F. Tichy and M. C. Baker, `Smart recompilation', Proc Twelfth POPL, 1985, pp. 236--244.

No context found.

W. Tichy, `Smart recompilation', ACM Transactions on Programming Languages and Systems, 8, (3), 273--291 (1986).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC