Filters








183,326 Hits in 3.5 sec

Compiling with code-size constraints

Mayur Naik, Jens Palsberg
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint.  ...  Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code.  ...  code-size-aware compiler.  ... 
doi:10.1145/513848.513851 fatcat:22ay6aex3fcwfot4tv5g4httrm

Compiling with code-size constraints

Mayur Naik, Jens Palsberg
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint.  ...  Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code.  ...  code-size-aware compiler.  ... 
doi:10.1145/513829.513851 dblp:conf/lctrts/NaikP02 fatcat:si4iconqnbhjdgzkqo3gh4pv7q

Compiling with code-size constraints

Mayur Naik, Jens Palsberg
2004 ACM Transactions on Embedded Computing Systems  
We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint.  ...  Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code.  ...  code-size-aware compiler.  ... 
doi:10.1145/972627.972635 fatcat:doog5jv4y5dn3arubc3ewokeaa

Compiling with code-size constraints

Mayur Naik, Jens Palsberg
2002 SIGPLAN notices  
We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint.  ...  Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code.  ...  code-size-aware compiler.  ... 
doi:10.1145/566225.513851 fatcat:r6lxm5fva5dptfuxxajbryju2e

Loop Optimization With Tradeoff Between Cycle Count And Code Size For Dsp Applications

Bogong Su, Jian Wang, Rafi Rabipour, Erh-Wen Hu, Joseph Manzano
2004 Zenodo  
Figure 1 shows the result of the dot-product code generated by TMS320C62 compiler with various code size reduction options.  ...  The sequential code is generated by the compiler with the software pipelining feature turned off.  ...  From the definition of pd and Theorem 4.1, it is clear that we can change the code size of software-pipelined loop by choosing different value of initiation interval II.  ... 
doi:10.5281/zenodo.38525 fatcat:gtkd2rhg6zbnblesdtmfrem2ty

Slice-Hoisting for Array-Size Inference in MATLAB [chapter]

Arun Chauhan, Ken Kennedy
2004 Lecture Notes in Computer Science  
Experimental evaluation shows that slice-hoisting, along with the constraints-based static algorithm, can result in a very high level of precision in inferring MATLAB array sizes.  ...  This paper presents a new approach to inferring array-sizes, called slice-hoisting. The approach is based on simple code transformations and is easy to implement in a practical compiler.  ...  collaboration with the telescoping languages effort.  ... 
doi:10.1007/978-3-540-24644-2_32 fatcat:fye232kbmffbbcswwrxuprwcm4

Compilation for Real-Time Systems a Decade After Predator [chapter]

Heiko Falk, Shashank Jadhav, Arno Luppold, Kateryna Muts, Dominic Oehlert, Nina Piontek, Mikko Roth
2020 A Journey of Embedded and Cyber-Physical Systems  
Another common additional optimization goal is to meet code size requirements. Code compression might be used to meet code size constraints in embedded systems.  ...  Benchmark Relative WCETs and Code Sizes Final WCET Final Code Size Code Size of DecompressorFig. 10.7 Evaluation of compiler-based WCET-aware code compression for MediaBench threshold C limit .  ... 
doi:10.1007/978-3-030-47487-4_10 fatcat:hryz7d6ynvb6dbtreek56scyjm

A Systematic Approach to Model-Guided Empirical Search for Memory Hierarchy Optimization [chapter]

Chun Chen, Jacqueline Chame, Mary Hall, Kristina Lerman
2006 Lecture Notes in Computer Science  
Our approach combines compiler models and heuristics with guided empirical search to take advantage of their complementary strengths.  ...  The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy.  ...  and communication in parallel codes.  ... 
doi:10.1007/978-3-540-69330-7_30 fatcat:6akstbukbvbf3n6jgbrcp52tqy

Strato: A Retargetable Framework for Low-Level Inlined-Reference Monitors

Bin Zeng, Gang Tan, Úlfar Erlingsson
2013 USENIX Security Symposium  
Furthermore, an independent verifier is implemented to validate the security of low-level code.  ...  We propose a constraint language to encode the assumptions and check whether they still hold after the backend transformations and optimizations.  ...  Acknowledgments We thank Cliff Biffle for providing us with his initial development, useful documents, and suggestions.  ... 
dblp:conf/uss/0004TE13 fatcat:udm3pvjw2bcbjiity57hljpzku

Combining Worst-Case Timing Models, Loop Unrolling, and Static Loop Analysis for WCET Minimization

Paul Lokuciejewski, Peter Marwedel
2009 2009 21st Euromicro Conference on Real-Time Systems  
Compilers aim at their aggressive transformation to achieve large improvements of the program performance.  ...  In addition, our heuristics avoid adverse effects of unrolling which result from instruction cache overflows and the generation of additional spill code.  ...  strict code size constraints.  ... 
doi:10.1109/ecrts.2009.9 dblp:conf/ecrts/LokuciejewskiM09 fatcat:ed5c7ckgg5bnzebs3ke5fyvtsm

GNU Prolog: Beyond Compiling Prolog to C [chapter]

Daniel Diaz, Philippe Codognet
1999 Lecture Notes in Computer Science  
In particular, GNU-Prolog is based on a low-level miniassembly platform-independent language that makes it possible to avoid the phase of compiling C code, and thus speeds up drastically compilation time  ...  The overall system is efficient and comparable in performances with commercial systems.  ...  Conclusion GNU Prolog is a free Prolog compiler with constraint solving over finite domains.  ... 
doi:10.1007/3-540-46584-7_6 fatcat:t36xheqyvzfbbncxof7u4m2dpi

Comfusy: A Tool for Complete Functional Synthesis [chapter]

Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, Philippe Suter
2010 Lecture Notes in Computer Science  
We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesis over unbounded domains.  ...  Comfusy accepts expressions with input and output variables specifying relations on integers and sets.  ...  The generated code constructs two sets a1 and a2 such that they form a partition of the existing set s, with the additional constraint that the sizes of a and b should not differ by more that 1.  ... 
doi:10.1007/978-3-642-14295-6_38 fatcat:xffmhv4qxfd3xl76lujl3uqnga

Optimizing SAT Encodings for Arithmetic Constraints [chapter]

Neng-Fa Zhou, Håkan Kjellerstrand
2017 Lecture Notes in Computer Science  
PicatSAT is also empowered by a novel optimization, called equivalence reasoning, for arithmetic constraints, which leads to reduction of code size and execution time.  ...  PicatSAT adopts some well-known optimizations from CP systems, language compilers, and hardware design systems for encoding constraints into compact and efficient SAT code.  ...  For magic square, whose code size is dominated by an all-different constraint, the reduction in code size is only 1%.  ... 
doi:10.1007/978-3-319-66158-2_43 fatcat:7fyrc3dvvzhzblgowf5kjhzsi4

Bound Analysis for Whiley Programs

Min-Hsien Weng, Mark Utting, Bernhard Pfahringer
2016 Electronical Notes in Theoretical Computer Science  
Our project goal is to build up a compiler that can translate Whiley programs into efficient OpenCL code with fixed-size integer types and fixed-size arrays, for parallel execution on GPUs.  ...  The Whiley compiler can generate naive C code, but the code is inefficient because it uses infinite integers and dynamic array sizes.  ...  generated code with some optimization.  ... 
doi:10.1016/j.entcs.2016.01.005 fatcat:qjp7rhd3svcdhj2qurbveq5rpu

The GNU Prolog system and its implementation

Daniel Diaz, Philippe Codognet
2000 Proceedings of the 2000 ACM symposium on Applied computing - SAC '00  
The overall system is efficient and comparable in performances with commercial systems, both for the Prolog and constraint parts.  ...  We describe in this paper the GNU-Prolog system, a free system consisting of a Prolog compiler and a constraint solver on finite domains.  ...  CONCLUSION GNU Prolog is a free Prolog compiler with constraint solving over finite domains.  ... 
doi:10.1145/338407.338553 dblp:conf/sac/DiazC00 fatcat:nuxro3acgzcqxefgj3jgomnbia
« Previous Showing results 1 — 15 out of 183,326 results