78,345 Hits in 3.4 sec

Efficient Symbolic Analysis for Optimizing Compilers [chapter]

Robert A. van Engelen
2001 Lecture Notes in Computer Science  
Because most of the execution time of a program is typically spend in loops, loop optimization is the main target of optimizing and restructuring compilers.  ...  The most powerful method known is the symbolic differencing method as demonstrated by the Parafrase-2 compiler on parallelizing the Perfect Benchmarks (R) .  ...  in order for compilers to effectively transform and optimize loops.  ... 
doi:10.1007/3-540-45306-7_9 fatcat:polf5xl6uvehxfss2er3cuqyu4

A method for the time analysis of programs

S. L. de Freitas, P. J. Lavelle
1978 IBM Systems Journal  
For a given language, timing analysis gives a comparison of the efficiencies of various compilers. For a given machine, timing analysis gives a comparison of the efficiencies of different languages.  ...  Optimizing compilers are used to improve the efficiency and to reduce the size of the object code, at the expense of an increase in the time and storage needed for the compilation.  ... 
doi:10.1147/sj.171.0026 fatcat:gm33lerrrrckfeqdy4vkbohxsm

Learning to Accelerate Symbolic Execution via Code Transformation

Junjie Chen, Wenxiang Hu, Lingming Zhang, Dan Hao, Sarfraz Khurshid, Lu Zhang, Michael Wagner
2018 European Conference on Object-Oriented Programming  
Recent work also reported that unified settings on compiler optimizations that can accelerate symbolic execution for any program do not exist at all.  ...  for symbolic execution.  ...  Moreover, there is no unified configuration on the compiler optimizations guaranteeing the efficiency of symbolic execution for all programs.  ... 
doi:10.4230/lipics.ecoop.2018.6 dblp:conf/ecoop/ChenHZHK018 fatcat:4f7uciggoneulmfsgi3kve3zly

Efficient Temperature - Dependent Symbolic Sensitivity Analysis and Symbolic Performance Evaluation in Analog Circuit Synthesis

Huiying Yang, R. Vemuri
2006 Proceedings of the Design Automation & Test in Europe Conference  
We present a new methodology for fast analog circuit synthesis, based on the use of temperature-dependent symbolic sensitivity analysis and symbolic performance evaluation in synthesis loop.  ...  Fast sensitivity analysis achieved and performance estimation are based on element-coefficient diagrams (ECDs).  ...  In analog circuit synthesis, symbolic performance evaluator is used for repetitive performance estimation during the optimization iterations.  ... 
doi:10.1109/date.2006.244139 dblp:conf/date/YangV06 fatcat:myc7yc4tszbivkfbhhlcl5qvzi

A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages

Biswajit Bhowmik, Abhishek Kumar, Abhishek Kumar Jha, Rajesh Kumar Agrawal
2010 International Journal of Computer Applications  
A new approach GLAP model for design and time complexity analysis of lexical analyzer is proposed in this paper.  ...  General Terms Compiler, Language Processor.  ...  Efficient speed to read large data. Thus, optimized read time. Code recycling supported is same for every compilation utility. An input system must possess the following design criteria [6] .  ... 
doi:10.5120/1116-1462 fatcat:owjlytnqlrcvrizncmkefyzs34

A technological review of the FORTRAN I compiler

F. E. Allen
1982 Proceedings of the June 7-10, 1982, national computer conference on - AFIPS '82  
The FORTRAN I compiler functions and organizations are described and shown to form the basis for many of the techniques used in modern compilers.  ...  FLOW ANALYSIS The function of Sections 4 and 5 of the compiler was to assign real registers to the symbolic registers.  ...  Separating register assignment from the problem of optimizing code involving symbolic registers is now considered a good strategy,' though many optimizing compilers have not exposed loads, symbolic registers  ... 
doi:10.1145/1500774.1500875 dblp:conf/afips/Allen82 fatcat:xz4zadcanfdyvc46yglaznnkfe

Interprocedural Symbolic Range Propagation for Optimizing Compilers [chapter]

Hansang Bae, Rudolf Eigenmann
2006 Lecture Notes in Computer Science  
It builds on our previous work of intraprocedural symbolic range analysis.  ...  Our algorithm contrasts with related work on interprocedural value range analysis in that it extends the ability to handle symbolic range expressions.  ...  Our analysis is intended for general use in several compiler optimizations and considers arbitrary symbolic expressions.  ... 
doi:10.1007/978-3-540-69330-7_28 fatcat:yelfltgjpfcphbzyzjfjgihv34

Studying the influence of standard compiler optimizations on symbolic execution

Shiyu Dong, Oswaldo Olivo, Lingming Zhang, Sarfraz Khurshid
2015 2015 IEEE 26th International Symposium on Software Reliability Engineering (ISSRE)  
The key finding of our work is that standard compiler optimizations need to be used with care when performing symbolic execution for creating tests that provide high code coverage.  ...  scale symbolic execution or by studying broader classes of traditional compiler optimizations in the context of different search heuristics, memoization, and other strategies employed by modern symbolic  ...  Our study of the influence of compiler optimizations on symbolic execution is driven by our overarching goal of making symbolic execution more efficient.  ... 
doi:10.1109/issre.2015.7381814 dblp:conf/issre/DongOZK15 fatcat:vopgbbxbrfe3vkfpggbie6nu2y

The Design of the PROMIS Compiler [chapter]

Hideki Saito, Nicholas Stavrakos, Steven Carroll, Constantine Polychronopoulos, Alex Nicolau
1999 Lecture Notes in Computer Science  
This information is used by other analysis and transformation passes to achieve highly optimized code. Symbolic analysis also helps statically quantify the effectiveness of transformations.  ...  Based on conditional algebra, the symbolic analyzer provides control sensitive and interprocedural information to the compiler.  ...  Ackknowledgements The authors are grateful to Peter Grun, Ashok Halambi, and Nick Savoiu of University of California at Irvine for their work on the trailblazing part of the backend and pointer analysis  ... 
doi:10.1007/978-3-540-49051-7_15 fatcat:pwro2nysuvdr3mxz4ic6lob7ma

Compiler construction using attribute grammars

Kai Koskimies, Kari-Jouko Räihä, Matti Sarjakoski
1982 Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82  
To achieve this, a carefully optimized implementation of the compiler-compiler is required.  ...  Quantitative measurements of the automatically generated compilers suggest that an efficient compiler can be produced from an attribute grammar.  ...  Comparisons with multi-pass compilers (e.g. optimizing compilers) would shorten the efficiency gap.  ... 
doi:10.1145/800230.806991 dblp:conf/sigplan/KoskimiesRS82 fatcat:3gdnof35nvbgjbsy3vmmrdzbom

HERCULES: A Pattern Driven Code Transformation System

Christos Kartsaklis, Oscar Hernandez, Chung-Hsing Hsu, Thomas Ilsche, Wayne Joubert, Richard L. Graham
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum  
elimination -Loop optimizations with STL iterators -Data flow analysis -Alias Analysis • Programmers may have to write code in assembler if back-end compiler doesn't generate efficient code.  ...  Locality -Each with different optimization strategies • Constant adaptation to new architectures -Efficient translation of code to architecture 5 Managed by UT-Battelle for the U.S.  ... 
doi:10.1109/ipdpsw.2012.69 dblp:conf/ipps/KartsaklisHHIJG12 fatcat:ulsv2roi5fc5xojpiq7dinbr6q

Bound Analysis for Whiley Programs

Min-Hsien Weng, Mark Utting, Bernhard Pfahringer
2016 Electronical Notes in Theoretical Computer Science  
This paper presents an abstract interpretation-based bound inference approach along with symbolic analysis for Whiley programs.  ...  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.  ...  Acknowledgement Thanks for Dr. David J. Pearce's technical support and to Google for some funding support for this project via a grant to Dr Utting.  ... 
doi:10.1016/j.entcs.2016.01.005 fatcat:qjp7rhd3svcdhj2qurbveq5rpu

Design an Optimized Compiler to Enhance Performance of Android Applications

Marwa Dahdouh, Mouhamad Ayman, Souheil Khawatmi, Amer Bouchi
2019 International Journal of Computer Applications  
The proposed compiler, Which is called MySMALI compiler, generates optimized Smali code by replacing some blocks in the Smali code by other blocks more efficient in performance and equivalent in behavior  ...  This paper presents a detailed study of the mechanism to design a compiler of Smali language to generate optimized Android applications.  ...  ART supports two backend compilers, which were a quick compiler and an optimizing compiler [6] . In this article new compiler is designed for Smali (Assembly Android) language.  ... 
doi:10.5120/ijca2019919709 fatcat:xl6gf6vwybaqhcywxqmhdkgege

A compiler-level intermediate representation based binary analysis and rewriting system

Kapil Anand, Matthew Smithson, Khaled Elwazeer, Aparna Kotha, Jim Gruen, Nathan Giles, Rajeev Barua
2013 Proceedings of the 8th ACM European Conference on Computer Systems - EuroSys '13  
Examples of new formulation • Lack of symbols New formulations for standard compiler analyses 1 eax = add ebx, ecx 1 eax = add ebx, ecx High level code with symbols Binary code without symbols  ...  related to current segments -Improved efficiency of constraint solvers SecondWrite Flow LLVM FrontEnd LLVM CodeGen LLVM IR Optimizations Binary FrontEnd Binary Layout Modifications •  ...  • X86 ISA support -Two compilers (gcc and Visual Studio) -Two OS (Linux and Windows) -Three languages (C,C++,F) -Spec and OMP Benchmark -Real programs: Apache server, Linux Coreutils, lynx browser, tar  ... 
doi:10.1145/2465351.2465380 dblp:conf/eurosys/AnandSEKGGB13 fatcat:vcpn72yhojbdnmzb7hadb4aeiq

Pseudocode to Source Programming Language Translator

Amal M R, Jamsheedh C V, Linda Sara Mathew
2016 International Journal of Computational Science and Information Technology  
Here we present the solution for translating the pseudocode to a programming language by using the different stages of a compiler.  ...  This tool compiles the pseudocode given by the user and translates it to a source programming language.  ...  Syntax Analysis Syntax analysis or parsing is the second phase of a compiler.  ... 
doi:10.5121/ijcsity.2016.4203 fatcat:pz5s4d4zrbgipdkmduvzkfrwr4
« Previous Showing results 1 — 15 out of 78,345 results