Статті в журналах з теми "Compiler theory"

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Compiler theory.

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

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

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Compiler theory".

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

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

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Zubkov, Kirill. "From the Compiler." Novoe literaturnoe obozrenie, no. 5 (2022): 11–16. http://dx.doi.org/10.53953/08696365_2022_177_5_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Bugaeva, Lyubov. "From the Compiler." Novoe literaturnoe obozrenie, no. 4 (2022): 27–30. http://dx.doi.org/10.53953/08696365_2022_176_4_27.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Song, Qiang, Chun Yu Peng, Hong Gang Zhou, and Shou Biao Tan. "Time Delay Model for SRAM Compiler." Applied Mechanics and Materials 373-375 (August 2013): 1561–66. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.1561.

Повний текст джерела
Анотація:
In this paper, we introduced an effective time delay model for SRAM compiler, which represents an important performance of SRAM. Our method divide the delay time into several periods, including decoder delay, word line delay, bit line delay and SA delay. The theory is useful in predicting the delay time when the SRAM size is changed. Simulations by Hsim in 65nm CMOS process proves a high accuracy.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Evans, D. J., and M. N. Sulaiman. "Neucomp—a neural network compiler." International Journal of Computer Mathematics 53, no. 1-2 (January 1994): 29–44. http://dx.doi.org/10.1080/00207169408804312.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

HARDIN, THÉRÈSE, LUC MARANGET, and BRUNO PAGANO. "Functional runtime systems within the lambda-sigma calculus." Journal of Functional Programming 8, no. 2 (March 1998): 131–76. http://dx.doi.org/10.1017/s0956796898002986.

Повний текст джерела
Анотація:
We define a weak λ-calculus, λσw, as a subsystem of the full λ-calculus with explicit substitutions λσ[uArr ]. We claim that λσw could be the archetypal output language of functional compilers, just as the λ-calculus is their universal input language. Furthermore, λσ[uArr ] could be the adequate theory to establish the correctness of functional compilers. Here we illustrate these claims by proving the correctness of four simplified compilers and runtime systems modelled as abstract machines. The four machines we prove are the Krivine machine, the SECD, the FAM and the CAM. Thus, we give the first formal proofs of Cardelli's FAM and of its compiler.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Bohli, Jens-Matthias, María I. González Vasco, and Rainer Steinwandt. "Building Group Key Establishment on Group Theory: A Modular Approach." Symmetry 12, no. 2 (January 30, 2020): 197. http://dx.doi.org/10.3390/sym12020197.

Повний текст джерела
Анотація:
A group key establishment protocol is presented and proven secure in the common reference string mode. The protocol builds on a group-theoretic assumption, and a concrete example can be obtained with a decision Diffie–Hellman assumption. The protocol is derived from a two-party solution by means of a protocol compiler presented by Abdalla et al. at TCC 2007, evidencing the possibility of meaningfully integrating cryptographic and group-theoretic tools in cryptographic protocol design. This compiler uses a standard ring configuration, where all users behave symmetrically, exchanging keys with their left and right neighbor, which are later combined to yield a shared group key.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Hsu, Shuo-Huan, Balachandra Krishnamurthy, Prathima Rao, Chunhua Zhao, Suresh Jagannathan, and Venkat Venkatasubramanian. "A domain-specific compiler theory based framework for automated reaction network generation." Computers & Chemical Engineering 32, no. 10 (October 2008): 2455–70. http://dx.doi.org/10.1016/j.compchemeng.2008.01.007.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Li, Mingzhen, Yi Liu, Xiaoyan Liu, Qingxiao Sun, Xin You, Hailong Yang, Zhongzhi Luan, Lin Gan, Guangwen Yang, and Depei Qian. "The Deep Learning Compiler: A Comprehensive Survey." IEEE Transactions on Parallel and Distributed Systems 32, no. 3 (March 1, 2021): 708–27. http://dx.doi.org/10.1109/tpds.2020.3030548.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zhu, Genjiang, Li Xie, and Zhongxiu Sun. "NUAPC: A parallelizing compiler for C++." Journal of Computer Science and Technology 12, no. 5 (September 1997): 458–69. http://dx.doi.org/10.1007/bf02943177.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Sheng, Li, and Z. B. Dai. "Research on the Maritime Communication Cryptographic Chip’s Compiler Optimization." Polish Maritime Research 24, s2 (August 28, 2017): 60–65. http://dx.doi.org/10.1515/pomr-2017-0065.

Повний текст джерела
Анотація:
Abstract In the process of ocean development, the technology for maritime communication system is a hot research field, of which information security is vital for the normal operation of the whole system, and that is also one of the difficulties in the research of maritime communication system. In this paper, a kind of maritime communication cryptographic SOC(system on chip) is introduced, and its compiler framework is put forward through analysis of working mode and problems faced by compiler front end. Then, a loop unrolling factor calculating algorithm based on queue theory, named UFBOQ (unrolling factor based on queue), is proposed to make parallel optimization in the compiler frontend with consideration of the instruction memory capacity limit. Finally, the scalar replacement method is used to optimize unrolled code to solve the memory access latency on the parallel computing efficiency, for continuous data storage characteristics of cryptographic algorithm. The UFBOQ algorithm and scalar replacement prove effective and appropriate, of which the effect achieves the linear speedup.
Стилі APA, Harvard, Vancouver, ISO та ін.
11

Midkiff, S. P., J. Lee, and D. A. Padua. "A compiler for multiple memory models." Concurrency and Computation: Practice and Experience 16, no. 23 (January 7, 2004): 197–220. http://dx.doi.org/10.1002/cpe.771.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
12

Jaejin Lee and D. A. Padua. "Hiding relaxed memory consistency with a compiler." IEEE Transactions on Computers 50, no. 8 (August 2001): 824–33. http://dx.doi.org/10.1109/tc.2001.947010.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
13

Pope. "Notes on Possible Scribe-Compiler/Owner of MS Digby 86." Chaucer Review 56, no. 1 (2021): 80. http://dx.doi.org/10.5325/chaucerrev.56.1.0080.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
14

Pope. "Notes on Possible Scribe-Compiler/Owner of MS Digby 86." Chaucer Review 56, no. 1 (2021): 80. http://dx.doi.org/10.5325/chaucerrev.56.1.0080.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
15

Hamada, Takashi, Toshiyuki Masui, and Yoshiaki Kayano. "Development of self-multiplicating compiler writing system." Systems and Computers in Japan 17, no. 11 (1986): 51–63. http://dx.doi.org/10.1002/scj.4690171106.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
16

Edelsohn, D., W. Gellerich, M. Hagog, D. Naishlos, M. Namolaru, E. Pasch, H. Penner, U. Weigand, and A. Zaks. "Contributions to the GNU Compiler Collection." IBM Systems Journal 44, no. 2 (2005): 259–78. http://dx.doi.org/10.1147/sj.442.0259.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
17

Sato, Taisuke, and Hisao Tamaki. "First order compiler: A deterministic logic program synthesis algorithm." Journal of Symbolic Computation 8, no. 6 (December 1989): 605–27. http://dx.doi.org/10.1016/s0747-7171(89)80064-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
18

REMSHAGEN, ANJA, and KLAUS TRUEMPER. "Learning in a compiler for MINSAT algorithms." Theory and Practice of Logic Programming 3, no. 03 (May 2003): 271–86. http://dx.doi.org/10.1017/s147106840200162x.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
19

Bhowmik, A., and M. Franklin. "A general compiler framework for speculative multithreaded processors." IEEE Transactions on Parallel and Distributed Systems 15, no. 8 (August 2004): 713–24. http://dx.doi.org/10.1109/tpds.2004.26.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
20

Welsh, Jarrett T. "SOME FRAGMENTS OF REPUBLICAN DRAMA FROM NONIUS MARCELLUS' SOURCES 26, 27 AND 28." Classical Quarterly 63, no. 1 (April 24, 2013): 253–76. http://dx.doi.org/10.1017/s0009838812000870.

Повний текст джерела
Анотація:
In a paper in an earlier issue of this journal I endeavoured to show that Nonius Marcellus’ three glossarial sources known as ‘Gloss. iii’, ‘Alph. Verb’ and ‘Alph. Adverb’ (lists 26, 27 and 28 in W.M. Lindsay's analysis of Nonius’ sources) were compiled by a lexicographer who paid attention to both metre and sense when excerpting works of Republican poetry. That compiler always excerpted quotations of poetry such that they consisted of, or began or ended with, a metrically complete verse. That method has produced quotations of high quality that are, on several counts, considerably more transparent and more reliable than those preserved by less diligent sources.
Стилі APA, Harvard, Vancouver, ISO та ін.
21

Butler, Emily. "The Role of the Compiler in the Paris Psalter." English Studies 98, no. 1 (November 16, 2016): 26–34. http://dx.doi.org/10.1080/0013838x.2016.1230321.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
22

Márton, Gábor, and Zoltán Porkoláb. "Unit Testing in C++ with Compiler Instrumentation and Friends." Acta Cybernetica 23, no. 2 (2017): 659–86. http://dx.doi.org/10.14232/actacyb.23.2.2017.14.

Повний текст джерела
Анотація:
In C++, test code is often interwoven with the unit we want to test. During the test development process we often have to modify the public interface of a class to replace existing dependencies; e.g. a supplementary setter or constructor function is added for dependency injection. In many cases, extra template parameters are used for the same purpose. All existing solutions have serious detrimental effects on the code structure and sometimes on the run-time performance as well. In this paper, we overview existing dependency replacement techniques of C++ and we evaluate their advantages and disadvantages. We introduce our non-intrusive, compiler instrumentation based testing approach that does not have such disadvantages. All non-intrusive testing methods (including our new method) require access to an object’s internal state in order to setup a test. Thus, to complement our new solution, we also present different approaches to conveniently access private members in C++. To evaluate these techniques, we created a proof-of-concept implementation which is publicly available for further testing.
Стилі APA, Harvard, Vancouver, ISO та ін.
23

Diessel, O., and G. Milne. "Hardware compiler realising concurrent processes in reconfigurable logic." IEE Proceedings - Computers and Digital Techniques 148, no. 4 (December 1, 2001): 152–62. http://dx.doi.org/10.1049/ip-cdt:20010579.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
24

Savage, Neil. "Getting down to basics." Communications of the ACM 64, no. 6 (June 2021): 12–14. http://dx.doi.org/10.1145/3460734.

Повний текст джерела
Анотація:
2020 ACM A.M. Turing Award recipients Alfred Aho and Jeffrey Ullman helped develop formal language theory, invented efficient algorithms to drive the tasks of a compiler, and put them all together in 'The Dragon Book.'
Стилі APA, Harvard, Vancouver, ISO та ін.
25

Artal, Cayetano Guerra, Maria Dolores Afonso Suarez, Idafen Santana Perez, and Ruben Quesada Lopez. "OLC, On-Line Compiler to Teach Programming Languages." International Journal of Computers Communications & Control 3, no. 1 (March 1, 2008): 69. http://dx.doi.org/10.15837/ijccc.2008.1.2376.

Повний текст джерела
Анотація:
The advance of Internet towards Web 2.0 conveys the potential it has in a wide range of scopes. The ongoing progress of the Web technology and its availability in teaching and learning, as well as a students’ profile increasingly more used to managing an important amount of digital information, offers lecturers the opportunity and challenge of putting at students’ disposal didactic tools making use of the Internet. Programming is one of the essential areas taught in university studies of Computer Science and other engineering degrees. At present, it is a knowledge acquired through tutorial classes and the practice with different tools for programming. This paper shows the acquired experience in the development and use of a simple compiler accessible through a Web page. In addition it presents a teaching proposal for its use in subjects that include programming languages lessons. OLC - On-Line Compiler - is an application which greatly lightens the student’s workload at the initial stage of programming. During this initial period they will neither have to deal with the complexities of the installation and the configuration of these types of tools, nor with the understanding of multiple options which they present. Therefore students can concentrate on the comprehension of the programming structures and the programming language to be studied.
Стилі APA, Harvard, Vancouver, ISO та ін.
26

Choi, Lynn, Hock-Beng Lim, and Pen-Chung Yew. "Parallel architectures: Techniques for compiler-directed cache coherence." IEEE Parallel & Distributed Technology: Systems & Applications 4, no. 4 (1996): 23–34. http://dx.doi.org/10.1109/m-pdt.1996.544438.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
27

Liu, J., F. Chow, T. Kong, and R. Roy. "Variable instruction set architecture and its compiler support." IEEE Transactions on Computers 52, no. 7 (July 2003): 881–95. http://dx.doi.org/10.1109/tc.2003.1214337.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
28

Zhao, Q., and D. J. Lilja. "Static classification of value predictability using compiler hints." IEEE Transactions on Computers 53, no. 8 (August 2004): 929–44. http://dx.doi.org/10.1109/tc.2004.49.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
29

Sinharoy, Balaram. "Compiler Optimization to Improve Data Locality for Processor Multithreading." Scientific Programming 7, no. 1 (1999): 21–37. http://dx.doi.org/10.1155/1999/235625.

Повний текст джерела
Анотація:
Over the last decade processor speed has increased dramatically, whereas the speed of the memory subsystem improved at a modest rate. Due to the increase in the cache miss latency (in terms of the processor cycle), processors stall on cache misses for a significant portion of its execution time. Multithreaded processors has been proposed in the literature to reduce the processor stall time due to cache misses. Although multithreading improves processor utilization, it may also increase cache miss rates, because in a multithreaded processor multiple threads share the same cache, which effectively reduces the cache size available to each individual thread. Increased processor utilization and the increase in the cache miss rate demands higher memory bandwidth. A novel compiler optimization method has been presented in this paper that improves data locality for each of the threads and enhances data sharing among the threads. The method is based on loop transformation theory and optimizes both spatial and temporal data locality. The created threads exhibit high level of intra‐thread and inter‐thread data locality which effectively reduces both the data cache miss rates and the total execution time of numerically intensive computation running on a multithreaded processor.
Стилі APA, Harvard, Vancouver, ISO та ін.
30

Montenyohl, Margaret, and Mitchell Wand. "Incorporating static analysis in a combinator-based compiler." Information and Computation 82, no. 2 (August 1989): 151–84. http://dx.doi.org/10.1016/0890-5401(89)90052-7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
31

Gillhammer, Cosima Clara. "Non-Wycliffite Bible Translation in Oxford, Trinity College, 29 and Universal History Writing in Late Medieval England." Anglia 138, no. 4 (November 11, 2020): 649–72. http://dx.doi.org/10.1515/ang-2020-0052.

Повний текст джерела
Анотація:
AbstractThe late-fifteenth-century Middle English manuscript Oxford, Trinity College, 29 contains a universal history of the world, compiled from diverse religious and secular source texts and written by a single compiler-scribe. A great part of the text is focused on Old Testament history and uses the Vulgate as a key source, thus offering an opportunity to examine in detail the compiler’s strategies of translating the text of the Bible into the vernacular. The Bible translations in this manuscript are unconnected to the Wycliffite translations, and are non-reformist in their interpretative framework, implications, and use. This evidence is of particular interest as an example of the range of approaches to biblical translation and scholarship in the vernacular found in late medieval English texts, despite the restrictive legislation concerning Bible translation in fifteenth-century England. The strategies of translating the biblical text found in this manuscript include close word-by-word translation (seemingly unencumbered by anxieties about censorship), as well as other modes of interaction, such as summary, and exegesis. This article situates these modes of engagement with the Bible within a wider European textual tradition of including biblical material in universal history writing.
Стилі APA, Harvard, Vancouver, ISO та ін.
32

Ding, Yufei, Lin Ning, Hui Guan, and Xipeng Shen. "Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction." ACM SIGPLAN Notices 52, no. 6 (September 14, 2017): 33–48. http://dx.doi.org/10.1145/3140587.3062377.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
33

Evansi, D. J., and M. N. Sulaiman. "Solving optimisation problems using neucomp-a neural network compiler." International Journal of Computer Mathematics 62, no. 1-2 (January 1996): 1–21. http://dx.doi.org/10.1080/00207169608804522.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
34

Navarro, A., E. Zapata, and D. Padua. "Compiler techniques for the distribution of data and computation." IEEE Transactions on Parallel and Distributed Systems 14, no. 6 (June 2003): 545–62. http://dx.doi.org/10.1109/tpds.2003.1206503.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
35

Woo Son, Seung, Guangyu Chen, Ozcan Ozturk, Mahmut Kandemir, and Alok Choudhary. "Compiler-Directed Energy Optimization for Parallel Disk Based Systems." IEEE Transactions on Parallel and Distributed Systems 18, no. 9 (September 2007): 1241–57. http://dx.doi.org/10.1109/tpds.2007.1056.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
36

Guilin Chen and M. Kandemir. "Compiler-Directed Code Restructuring for Improving Performance of MPSoCs." IEEE Transactions on Parallel and Distributed Systems 19, no. 9 (September 2008): 1201–14. http://dx.doi.org/10.1109/tpds.2007.70760.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
37

Couton, Marie. "The Anatomie of Absurditie: Portrait of the Satirist as a Compiler." Cahiers Élisabéthains: A Journal of English Renaissance Studies 37, no. 1 (April 1990): 17–26. http://dx.doi.org/10.1177/018476789003700106.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
38

Thiyagarajan, M., and N. Sairam. "Verification of the correctness of compiler optimization using co-induction." Journal of Discrete Mathematical Sciences and Cryptography 10, no. 3 (June 2007): 329–49. http://dx.doi.org/10.1080/09720529.2007.10698123.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
39

Mellor-Crummey, J., V. Adve, B. Broom, D. Chavarría-Miranda, R. Fowler, G. Jin, K. Kennedy, and Q. Yi. "Advanced optimization strategies in the Rice dHPF compiler." Concurrency and Computation: Practice and Experience 14, no. 8-9 (June 27, 2002): 741–67. http://dx.doi.org/10.1002/cpe.647.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
40

Ferreira de Lima, Thomas, Alexander N. Tait, Armin Mehrabian, Mitchell A. Nahmias, Chaoran Huang, Hsuan-Tung Peng, Bicky A. Marquez, et al. "Primer on silicon neuromorphic photonic processors: architecture and compiler." Nanophotonics 9, no. 13 (August 10, 2020): 4055–73. http://dx.doi.org/10.1515/nanoph-2020-0172.

Повний текст джерела
Анотація:
AbstractMicroelectronic computers have encountered challenges in meeting all of today’s demands for information processing. Meeting these demands will require the development of unconventional computers employing alternative processing models and new device physics. Neural network models have come to dominate modern machine learning algorithms, and specialized electronic hardware has been developed to implement them more efficiently. A silicon photonic integration industry promises to bring manufacturing ecosystems normally reserved for microelectronics to photonics. Photonic devices have already found simple analog signal processing niches where electronics cannot provide sufficient bandwidth and reconfigurability. In order to solve more complex information processing problems, they will have to adopt a processing model that generalizes and scales. Neuromorphic photonics aims to map physical models of optoelectronic systems to abstract models of neural networks. It represents a new opportunity for machine information processing on sub-nanosecond timescales, with application to mathematical programming, intelligent radio frequency signal processing, and real-time control. The strategy of neuromorphic engineering is to externalize the risk of developing computational theory alongside hardware. The strategy of remaining compatible with silicon photonics externalizes the risk of platform development. In this perspective article, we provide a rationale for a neuromorphic photonics processor, envisioning its architecture and a compiler. We also discuss how it can be interfaced with a general purpose computer, i.e. a CPU, as a coprocessor to target specific applications. This paper is intended for a wide audience and provides a roadmap for expanding research in the direction of transforming neuromorphic photonics into a viable and useful candidate for accelerating neuromorphic computing.
Стилі APA, Harvard, Vancouver, ISO та ін.
41

Otiakovskii, Valerii. "From the Compiler. Soviet Samokritika as a Sabotage of Repentant Discourse." Novoe literaturnoe obozrenie, no. 5 (2022): 72–80. http://dx.doi.org/10.53953/08696365_2022_177_5_72.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
42

Tanis, Kristina. "SOVIET CINEMA VIEWER AND THE NEW CINEMA HISTORY. From the Compiler." Novoe literaturnoe obozrenie, no. 3 (2022): 115–21. http://dx.doi.org/10.53953/08696365_2022_175_3_115.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
43

DIAZ, DANIEL, SALVADOR ABREU, and PHILIPPE CODOGNET. "On the implementation ofGNU Prolog." Theory and Practice of Logic Programming 12, no. 1-2 (December 12, 2011): 253–82. http://dx.doi.org/10.1017/s1471068411000470.

Повний текст джерела
Анотація:
AbstractGNU Prologis a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone executables which do not rely on any bytecode emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representations are materialized, in Unix compiler tradition.GNU Prologalso includes an extensible and high-performance finite-domain constraint solver, integrated with the Prolog language but implemented using independent lower-level mechanisms. This paper discusses the main issues involved in designing and implementingGNU Prolog: requirements, system organization, performance, and portability issues as well as its position with respect to other Prolog system implementations and the ISO standardization initiative.
Стилі APA, Harvard, Vancouver, ISO та ін.
44

de Souza Xavier, Tiago Cariolano, and Anderson Faustino da Silva. "Exploration of Compiler Optimization Sequences Using a Hybrid Approach." Computing and Informatics 37, no. 1 (2018): 165–85. http://dx.doi.org/10.4149/cai_2018_1_165.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
45

Morisset, Robin, Pankaj Pawan, and Francesco Zappa Nardelli. "Compiler testing via a theory of sound optimisations in the C11/C++11 memory model." ACM SIGPLAN Notices 48, no. 6 (June 23, 2013): 187–96. http://dx.doi.org/10.1145/2499370.2491967.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
46

Xuejun Yang, Xiaobo Yan, Zuocheng Xing, Yu Deng, Jiang Jiang, Jing Du, and Ying Zhang. "Fei Teng 64 Stream Processing System: Architecture, Compiler, and Programming." IEEE Transactions on Parallel and Distributed Systems 20, no. 8 (August 2009): 1142–57. http://dx.doi.org/10.1109/tpds.2008.170.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
47

Ryan, R. R., and H. Spiller. "The C programming language and a C compiler." IBM Systems Journal 24, no. 1 (1985): 37–48. http://dx.doi.org/10.1147/sj.241.0037.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
48

Binding, C., W. Bouma, M. Dauphin, G. Karjoth, and Y. Yang. "A common compiler for LOTOS and SDL specifications." IBM Systems Journal 31, no. 4 (1992): 668–90. http://dx.doi.org/10.1147/sj.314.0668.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
49

Puchol, Carlos, Douglas A. Stuart, and Aloysius K. Mok. "An Operational Semantics and Compiler for Real-Time Specifications1." Integrated Computer-Aided Engineering 5, no. 3 (July 1, 1998): 187–206. http://dx.doi.org/10.3233/ica-1998-5301.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
50

Stickel, Mark E. "A prolog technology theorem prover: Implementation by an extended prolog compiler." Journal of Automated Reasoning 4, no. 4 (December 1988): 353–80. http://dx.doi.org/10.1007/bf00297245.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

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