Filters








37 Hits in 0.51 sec

Smartest recompilation

Zhong Shao, Andrew W. Appel
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
The smartest recompilation technique should also be ap- plicable to languages in the Algol family.  ...  that ia, can we achieve the following smartest recompilation rule: A compila- tion unit never needs to be recompiled unless its own imple- mentation (source code) changes?  ... 
doi:10.1145/158511.158702 dblp:conf/popl/ShaoA93 fatcat:6gnanwlt5zgnrlio7qclyayh7q

The cost of selective recompilation and environment processing

Rolf Adams, Walter Tichy, Annette Weinert
1994 ACM Transactions on Software Engineering and Methodology  
The table contains columns for cascading recompilation, surface change, cutoff recompilation, smart recompilation, and smartest recompilation.  ...  Smartest recompilation compiles the theoretical minimum: only the changed compilation units.  ... 
doi:10.1145/174634.174637 fatcat:mrukxdqc2zgatjgiiglnqy5zo4

What are principal typings and what are they good for?

Trevor Jim
1996 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96  
Its principal typing property provides elegant support for separate compilation, including smartest recompilation" and incremental type inference, and for accurate type error messages.  ...  This property w as dubbed smartest recompilation by Shao and Appel 18 . They achieved smartest recompilation for ML by relating ML to a restriction of P 2 with principal typings.  ...  Shao and Appel identi ed the following problem with smartest recompilation.  ... 
doi:10.1145/237721.237728 dblp:conf/popl/Jim96 fatcat:4t2xh6ntarb75d5l355dhwokm4

Stronger Typings for Separate Compilation of Java-like Languages

Davide Ancona, Giovanni Lagorio
2004 Journal of Object Technology  
Finally, we show that the algorithm can actually speed up the overall recompilation process, since checking for recompilation is always strictly less expensive than recompiling the same fragment.  ...  The algorithm is smarter in the sense that it never forces useless recompilations, that is, recompilations which would generate the same binary fragment obtained from the previous compilation of the same  ...  According to the classification given in [1] , [9] adopts for ML an approach which involves both cut-off elimination and smart recompilation, while [16] investigates smartest recompilation, by employing  ... 
doi:10.5381/jot.2004.3.6.a1 fatcat:k7kosj3unjcxxendvsm5af4mw4

Reducing build time through precompilations for evolving large software

Y. Yu, H. Dayani-Fard, J. Mylopoulos, P. Andritsos
2005 21st IEEE International Conference on Software Maintenance (ICSM'05)  
The cascading recompilation triggers recompilation whenever a change to the make target happens; the surface recompilation does not trigger a cascading recompilation when changes are made to comments;  ...  the cutoff recompilation triggers a cascading recompilation only when changes are made to preprocessed images.  ... 
doi:10.1109/icsm.2005.73 dblp:conf/icsm/YuDMA05 fatcat:uowhrudcq5fsvcsxitfn3ptkxq

Nu

Robert Dyer, Harish Narayanappa, Hridesh Rajan
2006 Software engineering notes  
Techniques such as Smartest Recompilation [11] have shown improvement to incremental compilation times; however, these techniques are not always applicable to the AO paradigm.  ... 
doi:10.1145/1218776.1218802 fatcat:uewlqxzlfbekdlchkvpwmig3d4

Abstracting dependencies between software configuration items

Carl A. Gunter
1996 Software engineering notes  
The idea has inspired several subsequent studies, including one on 'smarter' recompilation [13] for C programs and 'smartest' recompilation for SML [14] . (my.c) //.  ...  Time saved avoiding recompilations quickly repays the overhead of calculating the fingerprints in typical SML programming projects.  ... 
doi:10.1145/250707.239129 fatcat:otzqcqy3nrg7nao7rrtzbwn3xu

Abstracting dependencies between software configuration items

Carl A. Gunter
1996 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '96  
The idea has inspired several subsequent studies, including one on 'smarter' recompilation [13] for C programs and 'smartest' recompilation for SML [14] . (my.c) //.  ...  Time saved avoiding recompilations quickly repays the overhead of calculating the fingerprints in typical SML programming projects.  ... 
doi:10.1145/239098.239129 dblp:conf/sigsoft/Gunter96 fatcat:rrsujv6ywrbaledeobrha54iqu

Abstracting dependencies between software configuration items

Carl A. Gunter
2000 ACM Transactions on Software Engineering and Methodology  
The idea has inspired several subsequent studies, including one on 'smarter' recompilation [13] for C programs and 'smartest' recompilation for SML [14] . (my.c) //.  ...  Time saved avoiding recompilations quickly repays the overhead of calculating the fingerprints in typical SML programming projects.  ... 
doi:10.1145/332740.332743 fatcat:rzp4tbcegzd2xbdjwakk5wu7by

Program fragments, linking, and modularization

Luca Cardelli
1997 Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97  
. • Some mechanisms (Modula-3's revelations [18] , Standard ML's smartest recompilation [21] , Eiffel's proposed link-time safety analysis) delay some type checks until link time: the user may discover  ...  Therefore, a new user program P' Usr can be regenerated without recompilation by linking L' Lib with L Usr .  ... 
doi:10.1145/263699.263735 dblp:conf/popl/Cardelli97 fatcat:23mk7l5jufduloc67kmviwknce

Model-Based Security Testing

Ina Schieferdecker, Juergen Grossmann, Martin Schneider
2012 Electronic Proceedings in Theoretical Computer Science  
Finally, the instrumented code is recompiled and executed using randomly generated test cases.  ...  Another approach covering specification, deployment, testing and monitoring of security policies has been proposed in the Politess project (Grenoble INP, IT, Smartesting) [DFGMR06, MBC08, LR07].  ... 
doi:10.4204/eptcs.80.1 fatcat:xbgolp2zlzflnast5eg5wqktwe

Let-polymorphism and eager type schemes [chapter]

Chuck Liang
1997 Lecture Notes in Computer Science  
Because of this complexity, Appel and Shao themselves favored a customization of Kaes' algorithm \D " 11] for their purpose of smartest recompilation.  ... 
doi:10.1007/bfb0030621 fatcat:e7pjhczv4bbydlnnn5u5i2wvde

Intersection Type Systems and Explicit Substitutions Calculi [chapter]

Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine
2010 Lecture Notes in Computer Science  
The PT property allows one to include features in a type system which include separate compilation, data abstraction and smartest recompilation [Jim96] .  ... 
doi:10.1007/978-3-642-13824-9_19 fatcat:54q5wjrprbb5pgzsviuku2njj4

Explicitly heterogeneous metaprogramming with MetaHaskell

Geoffrey Mainland
2012 Proceedings of the 17th ACM SIGPLAN international conference on Functional programming - ICFP '12  
Shao and Appel [33] partly addressed the issue of typing open terms in solving the smartest compilation problem.  ...  Jim [16] connects smartest compilation to the typing problem and gives a more explicit presentation of a typing inference algorithm.  ... 
doi:10.1145/2364527.2364572 dblp:conf/icfp/Mainland12 fatcat:hg5zz6rmejb5vi64rfe3arzsqi

Explicitly heterogeneous metaprogramming with MetaHaskell

Geoffrey Mainland
2012 SIGPLAN notices  
Shao and Appel [33] partly addressed the issue of typing open terms in solving the smartest compilation problem.  ...  Jim [16] connects smartest compilation to the typing problem and gives a more explicit presentation of a typing inference algorithm.  ... 
doi:10.1145/2398856.2364572 fatcat:r6j7bizikfexdpmlvtq652jlga
« Previous Showing results 1 — 15 out of 37 results