132 citations found. Retrieving documents...
Consel, C. and No el, F. 1996. A general approach for run-time specialization and its application to C. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96) (Jan. 1996), pp. 145--156.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Accomplishments and Research Challenges in Meta-Programming - Sheard (2000)   (16 citations)  (Correct)

....A sophisticated run time register allocation scheme is used [65] to increase the performance of the generated code. Tempo. Tempo [17] is a large project investigating the use of partial evalu ation strategies on C code. One aspect of the Tempo is dynamic code gener ation via specialization [18, 55]. This capability is relies on the binding time analysis of the C partial evaluator. Given the static parameters as input, the dynamic code generation partitions the C code into two stages. The static stages are compiled in the normal fashion, and the dynamic stages are reduced to code templates. ....

C. Consel and F. Noel. A general approach for run-time specialization and its application to C. In Conference Record of POPL '96: The 23 rd ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, pages 145-156, St. Petersburg Beach, Florida, 21-24 Jan. 1996.


Online Profiling And Feedback-Directed Optimization Of Java - Arnold (2002)   (1 citation)  (Correct)

....values; because such values are not statically determinable, these systems provide optimization opportunities not available with static compilation. Some systems include DyC and Tempo [59] based on C) and Fabius [58] based on ML) Calder et al. s work [26] as well as Consel and Noel s work [37] which takes a partial evaluation approach. The tcc system [67] provides a mechanism to specify and compose arbitrary expressions and statements at runtime. However, none of these systems were fully automatic; they all relied 100 on programmer directives to identify regions of code to be ....

Charles Consel and Francois Noel. A general approach for run-time specialization and its application to C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 145--156, January 1996.


Run-time Bytecode Specialization: A Portable Approach To.. - Masuhara, Yonezawa (2001)   (Correct)

....depend on the target machine architecture. A typical RTS system includes its own compiler from source code (usually in a high level language) to native machine code. Several techniques have been proposed to overcome the problem. For example, Tempo uses standard C compilers for creating templates[8, 22]. C, which is a language with dynamic code generation mechanisms, generates specialized code in retargetable virtual machine languages called vcode and icode[24] 3 Run time Bytecode Specialization Our proposed run time bytecode specialization (BCS) technique uses a virtual machine (bytecode) ....

C. Consel and F. Noel. A general approach for run-time specialization and its application to C. In POPL'96, pp.145--170, 1996.


Runtime Code Generation with JVM And CLR - Sestoft (2002)   (Correct)

....a system for runtime code generation in Standard ML, implemented in the SML NJ system [27] It is no longer maintained. The Tempo specializer from Consel s group is a partial evaluator for C that can generate specialized programs at runtime, generating machine code using so called code templates [12]. Bytecode generation tools for Java include gnu.bytecode [5] developed for the Kawa implementation of Scheme, and the Bytecode Engineering Library (BCEL) 1] formerly called JavaClass, which is used in several projects. Oiwa, Masuhara and Yonezawa [31] present a Java based typed two level ....

C. Consel and F. Nol. A general approach for run-time specialization and its application to C. In POPL'96: 23rd Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996.


Dynamic Native Optimization of Interpreters - Sullivan, Bruening, Baron.. (2003)   (3 citations)  (Correct)

....profiling information that is used to trigger reoptimization of frequently executed code at higher levels. Self [19] uses a similar adaptive optimization scheme. Staged dynamic compilers postpone a portion of compilation until runtime, when code can be specialized based on runtime values [11, 17, 24, 25, 16]. These systems usually focus on spending as little time as possible in the dynamic compiler, performing extensive offline pre computations to avoid needing any intermediate representation at runtime. API less dynamic optimization systems include Dynamo [4] for PA RISC; Wiggins Redstone [12] ....

C. Consel and F. N oel. A general approach for run-time specialization and its application to C. In ACM Symposium on Principles of Programming Languages (POPL '96), Jan. 1996.


Automating Selective Dynamic Compilation - Mock (2002)   (Correct)

....by code specialization for specific run time values of variables or data structures. These systems require the programmer either to explicitly specify how and what code should be generated at run time (e.g. C [EHK96] or to control the run time specialization by source code annotations (Tempo [CN96, CHM 98] DyC [GMP 00b] and Fabius [LL96] Common to all run time specialization systems is that they achieve their speedups by replacing a generic version of a procedure (or subsection thereof, in case of the DyC system) with a specialized version by partially evaluating the procedure. ....

....the improvements obtained from run time specialization translate almost directly into considerable whole program performance improvements. However, even for m88ksim or viewperf, the dynamic region speedups were substantial: 1.2 for viewperf and 3.7 for m88ksim. 2.1. 5 The Tempo System Tempo [CN96, CHM 98] is another example of an annotation driven specializer for the C programming language. Both systems are quite similar and require the user to declare where and for which variables code should be specialized. Unlike DyC, Tempo performs interprocedural analysis including a pointer and ....

[Article contains additional citation context not shown here]

Charles Consel and Francois No el. A general approach for run-time specialization and its application to C. In Conference Record of POPL '96: 23rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 145--156, St. Petersburg, FL, USA, January 1996.


An Infrastructure for Adaptive Dynamic Optimization - Bruening, Garnett, Amarasinghe (2003)   (17 citations)  (Correct)

....profiling information that is used to trigger reoptimization of frequently executed code at higher levels. Self [21] uses a similar adaptive optimization scheme. Staged dynamic compilers postpone a portion of compilation until runtime, when code can be specialized based on runtime values [11, 19, 27, 28, 18]. These systems usually focus on spending as little time as possible in the dynamic compiler, performing extensive offline pre computations to avoid needing any intermediate representation at runtime. Dynamic instrumentation can be used to build runtime code analyzers and, to some degree, runtime ....

C. Consel and F. N oel. A general approach for run-time specialization and its application to C. In ACM Symposium on Principles of Programming Languages (POPL '96), Jan. 1996.


Integrating Partial Evaluators into Interpreters - Asai (2001)   (Correct)

....any ways to indicate mutable data structures (in contrast to ML where only references are mutable) we have to maintain a set of all the data structures referenced during specialization to judge invalidation, which can be very large. This situation is in contrast to the run time specialization [9, 21] where whole the program is given beforehand and an analysis can estimate which data structures are mutable. To keep the set small, we feel that some kind of user assistance is required our future work. 2.5 Direct Reference to Heap Objects The presence of pre allocated heap objects has ....

....We hope to introduce such mechanisms on top of the current framework in the future. Although the original motivation of this work was to use partial evaluation in the interactive environment, it seems that the technique proposed here can be regarded as a foundation of run time specialization [9, 21]. What we did in the ray tracing experiment was the specialization of a part of the program at run time. Although our specializer is very heavy compared to the existing runtime specialization systems, it addresses one of the important characteristics of run time specialization, namely, sharing of ....

Consel, C., and F. Noel "A General Approach for Run-Time Specialization and its Application to C," Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, pp. 145--156 (January 1996).


Dynamic specialization in the Fabius system - Mark Leone And (1998)   (14 citations)  Self-citation (No)   (Correct)

No context found.

Consel, C. and No# el, F. 1996. A general approach for run-time specialization and its application to C. In ConferenceRecord of POPL '96: The 23


Dynamic specialization in the Fabius system - Mark Leone And (1998)   (14 citations)  Self-citation (No)   (Correct)

No context found.

Consel, C. and No# el, F. 1996. A general approach for run-time specialization and its application to C. In ConferenceRecord of POPL '96: The 23


The Abstraction and Instantiation of String-Matching.. - Amtoft, Consel.. (2001)   (2 citations)  Self-citation (Consel)   (Correct)

No context found.

Charles Consel and Francois Noel. A general approach for run-time specialization and its application to C. In Guy L. Steele Jr., editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 145-156, St. Petersburg Beach, Florida, January 1996. ACM Press.


A Programmable Client-Server Model: Robust.. - Consel..   Self-citation (Consel)   (Correct)

No context found.

C. Consel and F. Nol. A general approach for run-time specialization and its application to C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 145--156, St. Petersburg Beach, FL, USA, Jan. 1996.


A Tour of Tempo: A Program Specializer for the C Language - Consel, Lawall, Le Meur (2003)   (1 citation)  Self-citation (Consel)   (Correct)

....Jones seminal paper on program specialization [6] researchers actively explored this technique in a number of directions without challenging its compile time and source to source nature. More than 10 years later, an approach to specializing programs at run time was proposed by Consel and No el [7]. This new capability opened a number of new opportunities for specialization in applications where the values of con guration parameters are only available at run time. Another extension to program specialization is to specialize a program in multiple stages, i.e. incrementally [8,9] It was ....

....to the placement of the dynamic code in the source program. The result of the run time specializer is a pointer to the specialized function. If the corresponding source function returns a static result, this value is returned in a global variable, here xdrmem putlong return. Consel and No el [7] and No el et al. 29] present more details about the runtime specializer in Tempo, from both a theoretical and a practical perspective. Re nements of this approach allow inlining of specialized functions within the specialized de nition [30] 3.2.3 Data specialization Data specialization ....

C. Consel, F. Noel, A general approach for run-time specialization and its application to C, in: Conference Record of the 23 rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, FL, USA, 1996, pp. 145-156.


A Programmable Client-Server Model: Robust.. - Consel..   Self-citation (Consel)   (Correct)

....cases, as advocated by Thibault et al. 25] This approach relies on program specialization to remove the overhead incurred by the use of an interpreter [16] The idea is to customize the interpreter for a given DSL program. Interestingly, specialization can occur at both compile time and run time [7]. The latter case is useful in application domains where services need to be changed frequently, calling for the use of an interpreter, at the expense of performance. This conflict between flexibility and performance can be solved by using some sort of just in time (JIT) compilers. Thibault et al. ....

C. Consel and F. Nol. A general approach for run-time specialization and its application to C. In Conference Record of the 23 rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 145--156, St. Petersburg Beach, FL, USA, January 1996.


The Abstraction and Instantiation of String-Matching.. - Amtoft, Consel.. (2001)   (2 citations)  Self-citation (Consel)   (Correct)

....points, and of a main function computing the length of the text, checking whether it is large enough, and calling a specialized version of loop pt. The body of each auxiliary function is constructed out of instances of the dynamic parts of the programs, i.e. it fits one of the templates above [21, 42]. We have written the holes in the templates between brackets. The name of each residual function results from concatenating loop pc and loop pt to a fresh index. Each residual function is closed, i.e. it has no free variables. Overall, the shape of a residual program is as follows. define ....

Charles Consel and Francois Noel. A general approach for run-time specialization and its application to C. In Guy L. Steele Jr., editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 145--156, St. Petersburg Beach, Florida, January 1996. ACM Press.


A Modal Analysis of Staged Computation - Rowan Davies And (1996)   (124 citations)  (Correct)

No context found.

Consel, C. and No el, F. 1996. A general approach for run-time specialization and its application to C. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96) (Jan. 1996), pp. 145--156.


Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, ..   (Correct)

No context found.

Consel, C., and No el, F. A general approach for run-time specialization and its application to C. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, 1996), pp. 145--156.


Efficient Data Driven Run-Time Code Generation - Brifault, Charles   (Correct)

No context found.

Consel, C., and Nol, F. A general approach for run-time specialization and its application to c. In Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (January 1996), ACM Press, pp. 145--156.


Efficient Data Driven Run-Time Code Generation for.. - Brifault, Charles   (Correct)

No context found.

CONSEL, C., AND NOL, F. A general approach for run-time specialization and its application to c. In Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (January 1996), ACM Press, pp. 145--156.


On Stage Ordering in Staged Computation - Wang, Muntz   (Correct)

No context found.

C. Consel and F. Noel. A general approach for run-time specialization and its application to C. In Proc. of the 23th ACM Symposium on Principles of Programming Languages, pages 145--156, 1996.


Techniques for Transparent Program Specialization in Dynamic.. - Sastry   (Correct)

No context found.

C. Consel and F. Noel. A General Approach for Run-Time Specialization and its Application to C. In Conference Record of POPL '96: The 6.8Z\[ ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 145--156, St. Petersburg Beach, Florida, 21--24 Jan. 1996.


Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, ..   (Correct)

No context found.

Consel, C., and No el, F. A general approach for run-time specialization and its application to C. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, 1996), pp. 145--156.


Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, ..   (Correct)

No context found.

Consel, C., and No el, F. A general approach for run-time specialization and its application to C. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, 1996), pp. 145--156.


Y-Branches: When You Come to a Fork in the Road, Take It - Nicholas Wang Michael (2003)   (Correct)

No context found.

C. Consel and F. Noel. A general approach for run-time specialization and its application to c. In Proceedings of the 23rd ACM SIGPLAN/SIGACT Symposium on the Principles of Programming Languages, 1996.


Design and Implementation of a Dynamic - Matthai Philipose University   (Correct)

No context found.

C. Consel and F. Nol. A general approach for run-time specialization and its application to C. In Symposium on Principles of Programming Languages, January 1996.

First 50 documents  Next 50

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