Добірка наукової літератури з теми "Compilers (Computer programs)"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Compilers (Computer programs)".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

За допомогою хмари тегів ви можете побачити ще більше пов’язаних тем досліджень, а відповідні кнопки після кожного розділу сторінки дозволяють переглянути розширені списки книг, статей тощо на обрану тему.

Пов'язані теми наукових робіт:

Статті в журналах з теми "Compilers (Computer programs)":

1
Liu, Xiao, Xiaoting Li, Rupesh Prajapati, and Dinghao Wu. "DeepFuzz: Automatic Generation of Syntax Valid C Programs for Fuzz Testing." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 2019): 1044–51. http://dx.doi.org/10.1609/aaai.v33i01.33011044.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Compilers are among the most fundamental programming tools for building software. However, production compilers remain buggy. Fuzz testing is often leveraged with newlygenerated, or mutated inputs in order to find new bugs or security vulnerabilities. In this paper, we propose a grammarbased fuzzing tool called DEEPFUZZ. Based on a generative Sequence-to-Sequence model, DEEPFUZZ automatically and continuously generates well-formed C programs. We use this set of new C programs to fuzz off-the-shelf C compilers, e.g., GCC and Clang/LLVM. We present a detailed case study to analyze the success rate and coverage improvement of the generated C programs for fuzz testing. We analyze the performance of DEEPFUZZ with three types of sampling methods as well as three types of generation strategies. Consequently, DEEPFUZZ improved the testing efficacy in regards to the line, function, and branch coverage. In our preliminary study, we found and reported 8 bugs of GCC, all of which are actively being addressed by developers.
2
Rushinek, Avi, and Sara F. Rushinek. "Operating systems, compilers, assemblers and application programs: audit trails of user satisfaction." Microprocessors and Microsystems 9, no. 5 (June 1985): 241–49. http://dx.doi.org/10.1016/0141-9331(85)90272-8.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3
Shen, Z., Z. Li, and P. C. Yew. "An empirical study of Fortran programs for parallelizing compilers." IEEE Transactions on Parallel and Distributed Systems 1, no. 3 (July 1990): 356–64. http://dx.doi.org/10.1109/71.80162.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4
Chakraborty, Pinaki, Shweta Taneja, P. C. Saxena, and C. P. Katti. "Teaching purpose compilers." ACM Inroads 2, no. 2 (June 2011): 47–51. http://dx.doi.org/10.1145/1963533.1963549.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5
Poetzsch-Heffter, Arnd, and Marek Gawkowski. "Towards Proof Generating Compilers." Electronic Notes in Theoretical Computer Science 132, no. 1 (May 2005): 37–51. http://dx.doi.org/10.1016/j.entcs.2005.03.023.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6
Rompf, Tiark, Arvind K. Sujeeth, Kevin J. Brown, HyoukJoong Lee, Hassan Chafi, and Kunle Olukotun. "Surgical precision JIT compilers." ACM SIGPLAN Notices 49, no. 6 (June 2014): 41–52. http://dx.doi.org/10.1145/2666356.2594316.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7
Leijen, Daan, and Erik Meijer. "Domain specific embedded compilers." ACM SIGPLAN Notices 35, no. 1 (January 2000): 109–22. http://dx.doi.org/10.1145/331963.331977.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8
Padua, David, and Ron Cytron. "Compilers and interpreters archive." ACM SIGPLAN Notices 35, no. 3 (March 2000): 32. http://dx.doi.org/10.1145/351159.351170.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Godbolt, Matt. "Optimizations in C++ compilers." Communications of the ACM 63, no. 2 (January 2020): 41–49. http://dx.doi.org/10.1145/3369754.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10
Godbolt, Matt. "Optimizations in C++ Compilers." Queue 17, no. 5 (October 2019): 69–100. http://dx.doi.org/10.1145/3371595.3372264.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Compilers (Computer programs)":

1
Walker, Kenneth William. "The implementation of an optimizing compiler for Icon." Dissertation-Reproduction (electronic), The University of Arizona, 1991. http://hdl.handle.net/10150/185599.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
There are many optimizations that can be applied while translating Icon programs. These optimizations and the analyses needed to apply them are of interest for two reasons. First, Icon's unique combination of characteristics requires developing new techniques for implementing them. Second, these optimizations are used in variety of languages and Icon can be used as a medium for extending the state of the art. Many of these optimizations require detailed control of the generated code. Previous production implementations of the Icon programming language have been interpreters. The virtual machine code of an interpreter is seldom flexible enough to accommodate these optimizations and modifying the virtual machine to add the flexibility destroys the simplicity that justified using an interpreter in the first place. These optimizations can only reasonably be implemented in a compiler. In order to explore these optimizations for Icon programs, a compiler was developed. This dissertation describes the compiler and the optimizations it employs. It also describes a run-time system designed to support the analyses and optimizations. Icon variables are untyped. The compiler contains a type inferencing system that determines what values variables and expression may take on during program execution. This system is effective in the presence of values with pointer semantics and of assignments to components of data structures. The compiler stores intermediate results in temporary variables rather than on a stack. A simple and efficient algorithm was developed for determining the lifetimes of intermediate results in the presence of goal-directed evaluation. This allows an efficient allocation of temporary variables to intermediate results. The compiler uses information from type inferencing and liveness analysis to simplify generated code. Performance measurements on a variety of Icon programs show these optimizations to be effective.
2
Junaidu, Sahalu B. "A parallel functional language compiler for message-passing multicomputers." Electronic Thesis or Dissertation, University of St Andrews, 1998. http://hdl.handle.net/10023/13450.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
The research presented in this thesis is about the design and implementation of Naira, a parallel, parallelising compiler for a rich, purely functional programming language. The source language of the compiler is a subset of Haskell 1.2. The front end of Naira is written entirely in the Haskell subset being compiled. Naira has been successfully parallelised and it is the largest successfully parallelised Haskell program having achieved good absolute speedups on a network of SUN workstations. Having the same basic structure as other production compilers of functional languages, Naira's parallelisation technology should carry forward to other functional language compilers. The back end of Naira is written in C and generates parallel code in the C language which is envisioned to be run on distributed-memory machines. The code generator is based on a novel compilation scheme specified using a restricted form of Milner's 7r-calculus which achieves asynchronous communication. We present the first working implementation of this scheme on distributed-memory message-passing multicomputers with split-phase transactions. Simulated assessment of the generated parallel code indicates good parallel behaviour. Parallelism is introduced using explicit, advisory user annotations in the source' program and there are two major aspects of the use of annotations in the compiler. First, the front end of the compiler is parallelised so as to improve its efficiency at compilation time when it is compiling input programs. Secondly, the input programs to the compiler can themselves contain annotations based on which the compiler generates the multi-threaded parallel code. These, therefore, make Naira, unusually and uniquely, both a parallel and a parallelising compiler. We adopt a medium-grained approach to granularity where function applications form the unit of parallelism and load distribution. We have experimented with two different task distribution strategies, deterministic and random, and have also experimented with thread-based and quantum- based scheduling policies. Our experiments show that there is little efficiency difference for regular programs but the quantum-based scheduler is the best in programs with irregular parallelism. The compiler has been successfully built, parallelised and assessed using both idealised and realistic measurement tools: we obtained significant compilation speed-ups on a variety of simulated parallel architectures. The simulated results are supported by the best results obtained on real hardware for such a large program: we measured an absolute speedup of 2.5 on a network of 5 SUN workstations. The compiler has also been shown to have good parallelising potential, based on popular test programs. Results of assessing Naira's generated unoptimised parallel code are comparable to those produced by other successful parallel implementation projects.
3
Lu, Jing. "Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples." Thesis/Dissertation, University of British Columbia, 1990. http://hdl.handle.net/2429/29419.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Formal Description Techniques allow for the use of automated tools during the specification and development of communication protocols. Estelle is a standardized formal description technique developed by ISO to remove ambiguities in the specification of communication protocols and services. The UBC Estelle-C compiler automates the implementation of protocols by producing an executable C implementation directly from its Estelle specification. In this thesis, we investigate the automated protocol implementation methodology using the Estelle-C compiler. First, we describe the improvements made to the compiler to support the latest version of Estelle. Then, we present and discuss the semiautomated implementations of the LAPB protocol in the CCITT X.25 Recommendation and the RTS protocol in the CCITT X.400 MHS series using this compiler. Finally, we compare the automatic and manual protocol implementations of LAPB and RTS protocols in terms of functional coverage, development time, code size, and performance measure. The results strongly indicate the overall advantages of automatic protocol implementation method over the manual approach.
Science, Faculty of
Computer Science, Department of
Graduate
4
Wendt, Alan Lee. "An optimizing code generator generator." Dissertation-Reproduction (electronic), The University of Arizona, 1989. http://hdl.handle.net/10150/184771.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
This dissertation describes a system that constructs efficient, retargetable code generators and optimizers. chop reads nonprocedural descriptions of a computer's instruction set and of a naive code generator for the computer, and it writes an integrated code generator and peephole optimizer for it. The resulting code generators are very efficient because they interpret no tables; they are completely hard-coded. Nor do they build complex data structures to communicate between code generation and optimization phases. Interphase communication is reduced to the point that the code generator's output is often encoded in the program counter and conveyed to the optimizer by jumping to the right label. chop's code generator and optimizer are based on a very simple formalism, namely rewriting rules. An instrumented version of the compiler infers the optimization rules as it complies a training suite, and it records them for translation into hard code and inclusion into the production version. I have replaced the Portable C Compiler's code generator with one generated by chop. Despite a costly interface, the resulting compiler runs 30% to 50% faster than the original Portable C Compiler (pcc) and generates comparable code. This figure is diluted by common lexical analysis, parsing, and semantic analysis and by comparable code emission. Allowing for these, the new code generator appears to run approximately seven times faster than that of the original pcc.
5
Cai, Qiong Computer Science &amp Engineering Faculty of Engineering UNSW. "Profile-guided redundancy elimination." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25156.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Program optimizations analyze and transform the programs such that better performance results can be achieved. Classical optimizations mainly use the static properties of the programs to analyze program code and make sure that the optimizations work for every possible combination of the program and the input data. This approach is conservative in those cases when the programs show the same runtime behaviors for most of their execution time. On the other hand, profile-guided optimizations use runtime profiling information to discover the aforementioned common behaviors of the programs and explore more optimization opportunities, which are missed in the classical, non-profile-guided optimizations. Redundancy elimination is one of the most powerful optimizations in compilers. In this thesis, a new partial redundancy elimination (PRE) algorithm and a partial dead code elimination algorithm (PDE) are proposed for a profile-guided redundancy elimination framework. During the design and implementation of the algorithms, we address three critical issues: optimality, feasibility and profitability. First, we prove that both our speculative PRE algorithm and our region-based PDE algorithm are optimal for given edge profiling information. The total number of dynamic occurrences of redundant expressions or dead codes cannot be further eliminated by any other code motion. Moreover, our speculative PRE algorithm is lifetime optimal, which means that the lifetimes of new introduced temporary variables are minimized. Second, we show that both algorithms are practical and can be efficiently implemented in production compilers. For SPEC CPU2000 benchmarks, the average compilation overhead for our PRE algorithm is 3%, and the average overhead for our PDE algorithm is less than 2%. Moreover, edge profiling rather than expensive path profiling is sufficient to guarantee the optimality of the algorithms. Finally, we demonstrate that the proposed profile-guided redundancy elimination techniques can provide speedups on real machines by conducting a thorough performance evaluation. To the best of our knowledge, this is the first performance evaluation of the profile-guided redundancy elimination techniques on real machines.
6
Hessaraki, Alireza. "CCC86, a generic 8086 C-language cross compiler plus communication package." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/544004.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
The Cross Compiler is an excellent and valuable program development tool. It provides to the user a low level compiled language that allows character (byte), integer (8086 word) and pointer (8086 one word address) manipulation. It also allows recursion, has modern flow and a rich set of operators.The Communication Program which include file transfer utility allows the student to download or upload their C program to a PC. It allows use of the Modem. The file transferring can be done using XON/XOFF or XMODEM. It also supports INS 8250 UART chip, plus 16450 high speed device found in hardware such as IBM AT Serial/Parallel Adapter.
Department of Computer Science
7
Burke, Patrick William. "A New Look at Retargetable Compilers." Thesis or Dissertation, University of North Texas, 2012. https://digital.library.unt.edu/ark:/67531/metadc699988/.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Consumers demand new and innovative personal computing devices every 2 years when their cellular phone service contracts are renewed. Yet, a 2 year development cycle for the concurrent development of both hardware and software is nearly impossible. As more components and features are added to the devices, maintaining this 2 year cycle with current tools will become commensurately harder. This dissertation delves into the feasibility of simplifying the development of such systems by employing heterogeneous systems on a chip in conjunction with a retargetable compiler such as the hybrid computer retargetable compiler (Hy-C). An example of a simple architecture description of sufficient detail for use with a retargetable compiler like Hy-C is provided. As a software engineer with 30 years of experience, I have witnessed numerous system failures. A plethora of software development paradigms and tools have been employed to prevent software errors, but none have been completely successful. Much discussion centers on software development in the military contracting market, as that is my background. The dissertation reviews those tools, as well as some existing retargetable compilers, in an attempt to determine how those errors occurred and how a system like Hy-C could assist in reducing future software errors. In the end, the potential for a simple retargetable solution like Hy-C is shown to be very simple, yet powerful enough to provide a very capable product in a very fast-growing market.
8
De, Subrato Kumar. "Design of a retargetable compiler for digital signal processors." Dissertation, Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/15740.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Moon, Hae-Kyung. "Compiler construction for a simple Pascal-like language." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897511.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple Pascal-like language called SPASCAL into target programs in the VAX assembly language. This thesis clearly describes the main aspects of a compiler: lexical analysis and syntactic analysis, including the symbol-table routines and the error-handling routines. This thesis uses regular expressions to define the lexical structure and a context-free grammar to define the syntactic structure of SPASCAL. The compiler is constructed using syntax-directed translation, context-free grammars and a set of semantic rules. SPASCAL Compiler is written with standard C in UNIX.
Department of Computer Science
10
Leather, Hugh. "Machine learning in compilers." Electronic Thesis or Dissertation, University of Edinburgh, 2011. http://hdl.handle.net/1842/9810.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Tuning a compiler so that it produces optimised code is a difficult task because modern processors are complicated; they have a large number of components operating in parallel and each is sensitive to the behaviour of the others. Building analytical models on which optimisation heuristics can be based has become harder as processor complexity increased and this trend is bound to continue as the world moves towards further heterogeneous parallelism. Compiler writers need to spend months to get a heuristic right for any particular architecture and these days compilers often support a wide range of disparate devices. Whenever a new processor comes out, even if derived from a previous one, the compiler’s heuristics will need to be retuned for it. This is, typically, too much effort and so, in fact, most compilers are out of date. Machine learning has been shown to help; by running example programs, compiled in different ways, and observing how those ways effect program run-time, automatic machine learning tools can predict good settings with which to compile new, as yet unseen programs. The field is nascent, but has demonstrated significant results already and promises a day when compilers will be tuned for new hardware without the need for months of compiler experts’ time. Many hurdles still remain, however, and while experts no longer have to worry about the details of heuristic parameters, they must spend their time on the details of the machine learning process instead to get the full benefits of the approach. This thesis aims to remove some of the aspects of machine learning based compilers for which human experts are still required, paving the way for a completely automatic, retuning compiler. First, we tackle the most conspicuous area of human involvement; feature generation. In all previous machine learning works for compilers, the features, which describe the important aspects of each example to the machine learning tools, must be constructed by an expert. Should that expert choose features poorly, they will miss crucial information without which the machine learning algorithm can never excel. We show that not only can we automatically derive good features, but that these features out perform those of human experts. We demonstrate our approach on loop unrolling, and find we do better than previous work, obtaining XXX% of the available performance, more than the XXX% of previous state of the art. Next, we demonstrate a new method to efficiently capture the raw data needed for machine learning tasks. The iterative compilation on which machine learning in compilers depends is typically time consuming, often requiring months of compute time. The underlying processes are also noisy, so that most prior works fall into two categories; those which attempt to gather clean data by executing a large number of times and those which ignore the statistical validity of their data to keep experiment times feasible. Our approach, on the other hand guarantees clean data while adapting to the experiment at hand, needing an order of magnitude less work that prior techniques.

Книги з теми "Compilers (Computer programs)":

1
Safonov, V. O. Trustworthy compilers. Hoboken, N.J: John Wiley & Sons, 2010.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2
Safonov, V. O. Trustworthy compilers. Hoboken, N.J: John Wiley & Sons, 2010.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3
Hunter, Robin. The essence of compilers. New York: Prentice Hall, 1998.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4
Cooper, Keith D. Engineering a compiler. 2nd ed. Amsterdam: Elsevier/Morgan Kaufmann, 2012.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5
Wilhelm, R. Compiler design. Wokingham, England: Addison-Wesley Publishing Co., 1995.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6
Louden, Kenneth C. Compiler construction: Principles and practice. Boston: PWS Pub. Co., 1997.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7
Fischer, Charles N. Crafting a compiler. Boston: Addison-Wesley, 2010.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8
Kiong, Derek Beng Kee. Compiler technology: Tools, translators, and language implementation. Boston: Kluwer Academic Publishers, 1997.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Polychronopoulos, C. D. Parallel programming and compilers. Boston: Kluwer Academic, 1988.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10
CC, 2005 (2005 Edinburgh Scotland). Compiler construction: 14th international conference, CC 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005 : proceedings. Berlin: Springer, 2005.
Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Compilers (Computer programs)":

1
Levesque, John, and Aaron Vose. "How Compilers Optimize Programs." In Programming for Hybrid Multi/Manycore MPP Systems, 43–66. Boca Raton : CRC Press, Taylor & Francis, 2017. | Series:: Chapman and Hall/CRC, 2017. http://dx.doi.org/10.1201/9781315155944-4.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2
Page, Daniel. "Compilers." In Texts in Computer Science, 451–93. London: Springer London, 2009. http://dx.doi.org/10.1007/978-1-84882-256-6_11.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3
Krishnamurthy, Arvind, and Katherine Yelick. "Optimizing parallel SPMD programs." In Languages and Compilers for Parallel Computing, 331–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0025888.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4
Hankin, C., D. LeMétayer, and D. Sands. "A calculus of gamma programs." In Languages and Compilers for Parallel Computing, 342–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57502-2_57.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5
Sehr, David C., Laxmikant V. Kale, and David A. Padua. "Loop transformations for Prolog programs." In Languages and Compilers for Parallel Computing, 374–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57659-2_22.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6
Doerfert, Johannes, and Hal Finkel. "Compiler Optimizations for Parallel Programs." In Languages and Compilers for Parallel Computing, 112–19. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34627-0_9.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7
Mahmood, Nasim, Guosheng Deng, and James C. Browne. "Compositional Development of Parallel Programs." In Languages and Compilers for Parallel Computing, 109–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24644-2_8.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8
Zhao, Jianzhou, and Steve Zdancewic. "Mechanized Verification of Computing Dominators for Formalizing Compilers." In Certified Programs and Proofs, 27–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35308-6_6.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Watson, Des. "Compilers and Interpreters." In Undergraduate Topics in Computer Science, 13–36. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52789-5_2.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10
Grillmeyer, Oliver. "Compilers and Interpreters." In Exploring Computer Science with Scheme, 319–72. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2937-5_13.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Compilers (Computer programs)":

1
Sun, Yu, and Wei Zhang. "On-Line Trace Based Automatic Parallelization of Java Programs on Multicore Platforms." In 2011 INTERACT-15: 15th Workshop on Interaction between Compilers and Computer Architectures. IEEE, 2011. http://dx.doi.org/10.1109/interact.2011.11.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2
Misailovic, Sasa. "Accuracy-aware optimization of approximate programs." In 2015 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES). IEEE, 2015. http://dx.doi.org/10.1109/cases.2015.7324543.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3
Mohr, Manuel, Artjom Grudnitsky, Tobias Modschiedler, Lars Bauer, Sebastian Hack, and Jorg Henkel. "Hardware acceleration for programs in SSA form." In 2013 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES). IEEE, 2013. http://dx.doi.org/10.1109/cases.2013.6662518.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4
Domagała, Łukasz, Duco van Amstel, and Fabrice Rastello. "Generalized cache tiling for dataflow programs." In LCTES'16: SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2016. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2907950.2907960.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5
Kumar Thakur, Rajesh, and Y. N. Srikant. "Efficient Compilation of Stream Programs for Heterogeneous Architectures." In SCOPES '15: 18th International Workshop on Software and Compilers for Embedded Systems. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2764967.2764968.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6
Grech, Neville, Kyriakos Georgiou, James Pallister, Steve Kerrison, Jeremy Morse, and Kerstin Eder. "Static analysis of energy consumption for LLVM IR programs." In SCOPES '15: 18th International Workshop on Software and Compilers for Embedded Systems. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2764967.2764974.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7
Allen, Frances. "Compilers and parallel computing systems." In 2008 IEEE 14th International Symposium on High Performance Computer Architecture (HPCA). IEEE, 2008. http://dx.doi.org/10.1109/hpca.2008.4658658.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8
Kim, Hwiwon, Hyunjun Kim, and Hwansoo Han. "Effective Profiling for Data-Intensive GPU Programs: Work-in-Progress." In 2020 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES). IEEE, 2020. http://dx.doi.org/10.1109/cases51649.2020.9243727.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Wang, Jia Jie, Partha S. Roop, and Sidharta Andalam. "ILPc: A novel approach for scalable timing analysis of synchronous programs." In 2013 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES). IEEE, 2013. http://dx.doi.org/10.1109/cases.2013.6662526.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10
Taylor, Ben, Vicent Sanz Marco, and Zheng Wang. "Adaptive optimization for OpenCL programs on embedded heterogeneous systems." In LCTES '17: SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2017. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3078633.3081040.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Compilers (Computer programs)":

1
Nataf, J. M., and F. Winkelmann. Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers. Office of Scientific and Technical Information (OSTI), September 1992. http://dx.doi.org/10.2172/10161277.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2
Nataf, J. M., and F. Winkelmann. Automatic code generation in SPARK: Applications of computer algebra and compiler-compilers. Office of Scientific and Technical Information (OSTI), September 1992. http://dx.doi.org/10.2172/7368555.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3
Rozhkov, M., and K. Nakanishi. Computer programs for analysis of geophysical data. Office of Scientific and Technical Information (OSTI), June 1994. http://dx.doi.org/10.2172/10193091.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4
Pate, J. R., and C. V. Dodd. Computer programs for eddy-current defect studies. Office of Scientific and Technical Information (OSTI), June 1990. http://dx.doi.org/10.2172/7072003.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5
Deimel, Lionel E., and J. F. Naveda. Reading Computer Programs: Instructor's Guide to Exercises. Fort Belvoir, VA: Defense Technical Information Center, August 1990. http://dx.doi.org/10.21236/ada228026.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6
NEWPORT NEWS SHIPBUILDING VA. Producibility Evaluation Criteria Cost Estimating Computer Programs - Manual. Fort Belvoir, VA: Defense Technical Information Center, December 1993. http://dx.doi.org/10.21236/ada457051.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7
Appel, Andrew W., Edward W. Felton, David P. Walker, Zhong Shao, and Valery Trifonov. Scaling Proof-Carrying Code to Production Compilers and Security Policies. Fort Belvoir, VA: Defense Technical Information Center, April 2005. http://dx.doi.org/10.21236/ada434335.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8
Hook, Audrey A., William E. Akin, Lewis E. Dimler, Kathleen A. Jordon, and R. D. Lehman. Availability of Ada and C++ Compilers, Tools, Education and Training. Fort Belvoir, VA: Defense Technical Information Center, July 1991. http://dx.doi.org/10.21236/ada243998.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9
Laguitton, D., J. Leung, F. Flament, D. Hodouin, and R. Spring. The SPOC manual Chapter 7.3 RTD and MIXERS computer programs. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1985. http://dx.doi.org/10.4095/305027.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10
Knutson, E. O. Personal computer programs for use in radon/thoron progeny measurements. Office of Scientific and Technical Information (OSTI), March 1989. http://dx.doi.org/10.2172/6294239.
Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

До бібліографії

Будь ласка, вимкніть ваш блокувальник реклами

Adblock logo Adblock logo Adblock logo

"Grafiati" – це незалежний сервіс, що забезпечує унікальну якість оформлення бібліографічних посилань. Ви можете користуватися нашим сайтом безоплатно, дозволивши показ реклами, або оформити передплату.

Передплатити