Zeitschriftenartikel zum Thema „Compilers (Computer programs)“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Compilers (Computer programs)" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Feng, Jing Ge, Ye Ping He und Qiu Ming Tao. „Evaluation of Compilers’ Capability of Automatic Vectorization Based on Source Code Analysis“. Scientific Programming 2021 (30.11.2021): 1–15. http://dx.doi.org/10.1155/2021/3264624.
Susungi, Adilla, und Claude Tadonki. „Intermediate Representations for Explicitly Parallel Programs“. ACM Computing Surveys 54, Nr. 5 (Juni 2021): 1–24. http://dx.doi.org/10.1145/3452299.
AlFayez, Fayez. „Algorithms for Pre-Compiling Programs by Parallel Compilers“. Computer Systems Science and Engineering 44, Nr. 3 (2023): 2165–76. http://dx.doi.org/10.32604/csse.2023.026238.
Dold, Axel, Friedrich von Henke und Wolfgang Goerigk. „A Completely Verified Realistic Bootstrap Compiler“. International Journal of Foundations of Computer Science 14, Nr. 04 (August 2003): 659–80. http://dx.doi.org/10.1142/s0129054103001947.
Ciric, Miroslav, und Svetozar Rancic. „Parsing in different languages“. Facta universitatis - series: Electronics and Energetics 18, Nr. 2 (2005): 299–307. http://dx.doi.org/10.2298/fuee0502299c.
Steele, James K., und Ronald R. Biederman. „Powder Diffraction Pattern Simulation and Analysis“. Advances in X-ray Analysis 37 (1993): 101–7. http://dx.doi.org/10.1154/s0376030800015561.
Lin, Jenny, Vidya Narayanan, Yuka Ikarashi, Jonathan Ragan-Kelley, Gilbert Bernstein und James McCann. „Semantics and Scheduling for Machine Knitting Compilers“. ACM Transactions on Graphics 42, Nr. 4 (26.07.2023): 1–26. http://dx.doi.org/10.1145/3592449.
Burgin, Mark. „Triadic Automata and Machines as Information Transformers“. Information 11, Nr. 2 (13.02.2020): 102. http://dx.doi.org/10.3390/info11020102.
Rushinek, Avi, und Sara F. Rushinek. „Operating systems, compilers, assemblers and application programs: audit trails of user satisfaction“. Microprocessors and Microsystems 9, Nr. 5 (Juni 1985): 241–49. http://dx.doi.org/10.1016/0141-9331(85)90272-8.
LaRose, Ryan. „Overview and Comparison of Gate Level Quantum Software Platforms“. Quantum 3 (25.03.2019): 130. http://dx.doi.org/10.22331/q-2019-03-25-130.
PHILLIPS, C., und R. PERROTT. „PROBLEMS WITH DATA PARALLELISM“. Parallel Processing Letters 11, Nr. 01 (März 2001): 77–94. http://dx.doi.org/10.1142/s0129626401000440.
Jerbi, Khaled, Mickaël Raulet, Olivier Déforges und Mohamed Abid. „Automatic Generation of Optimized and Synthesizable Hardware Implementation from High-Level Dataflow Programs“. VLSI Design 2012 (16.08.2012): 1–14. http://dx.doi.org/10.1155/2012/298396.
Nagy, Stefan. „The Fun in Fuzzing“. Queue 20, Nr. 6 (31.12.2022): 80–87. http://dx.doi.org/10.1145/3580504.
Stepanov, Daniil, und Vladimir Itsykson. „Backend Bug Finder — a platform for effective compiler fuzzing“. Information and Control Systems, Nr. 6 (27.12.2022): 31–40. http://dx.doi.org/10.31799/1684-8853-2022-6-31-40.
Wu, Jiang, Jianjun Xu, Xiankai Meng, Haoyu Zhang und Zhuo Zhang. „Enabling Reliability-Driven Optimization Selection with Gate Graph Attention Neural Network“. International Journal of Software Engineering and Knowledge Engineering 30, Nr. 11n12 (November 2020): 1641–65. http://dx.doi.org/10.1142/s0218194020400240.
Zhang, Du, und Michael D. Kramer. „GAPS: A Genetic Programming System“. International Journal on Artificial Intelligence Tools 12, Nr. 02 (Juni 2003): 187–206. http://dx.doi.org/10.1142/s0218213003001198.
Amir, Amihood, und Carl H. Smith. „The Syntax of Parallelism“. Fundamenta Informaticae 19, Nr. 3-4 (01.10.1993): 383–402. http://dx.doi.org/10.3233/fi-1993-193-409.
Rodríguez, Gabriel, Louis-Noël Pouchet und Juan Touriño. „Representing Integer Sequences Using Piecewise-Affine Loops“. Mathematics 9, Nr. 19 (24.09.2021): 2368. http://dx.doi.org/10.3390/math9192368.
Dévai, Gergely, Zoltán Gera und Zoltán Kelemen. „Language abstractions for low level optimization techniques“. Computer Science and Information Systems 11, Nr. 4 (2014): 1499–514. http://dx.doi.org/10.2298/csis130224080d.
BONE, PAUL, ZOLTAN SOMOGYI und PETER SCHACHTE. „Estimating the overlap between dependent computations for automatic parallelization“. Theory and Practice of Logic Programming 11, Nr. 4-5 (Juli 2011): 575–91. http://dx.doi.org/10.1017/s1471068411000184.
WOLSKI, RICH. „STATIC SCHEDULING OF HIERARCHICAL PROGRAM GRAPHS“. Parallel Processing Letters 05, Nr. 04 (Dezember 1995): 611–22. http://dx.doi.org/10.1142/s0129626495000540.
Fahringer, T., und A. Požgaj. „P3T+: A Performance Estimator for Distributed and Parallel Programs“. Scientific Programming 8, Nr. 2 (2000): 73–93. http://dx.doi.org/10.1155/2000/217384.
Taylor, Matthew, Katherine Coons, Behnam Robatmili, Bertrand Maher, Doug Burger und Kathryn McKinley. „Evolving Compiler Heuristics to Manage Communication and Contention“. Proceedings of the AAAI Conference on Artificial Intelligence 24, Nr. 1 (05.07.2010): 1690–93. http://dx.doi.org/10.1609/aaai.v24i1.7711.
Mirzaev, Farrukh, und Khurshid Nematov. „Performance of Free Software and Freeware in Telecommunication System“. Journal La Multiapp 1, Nr. 5 (12.01.2021): 20–24. http://dx.doi.org/10.37899/journallamultiapp.v1i5.276.
Lee, Jaejin, David A. Padua und Samuel P. Midkiff. „Basic compiler algorithms for parallel programs“. ACM SIGPLAN Notices 34, Nr. 8 (August 1999): 1–12. http://dx.doi.org/10.1145/329366.301105.
Soni, Sumit, und Pravesh Kumar. „Compiler Construction for a Network Identification“. Journal of Advance Research in Electrical & Electronics Engineering (ISSN: 2208-2395) 1, Nr. 4 (30.04.2014): 1317. http://dx.doi.org/10.53555/nneee.v1i4.240.
HAN, JIA WEI. „ON THE POWER OF QUERY-INDEPENDENT COMPILATION“. International Journal of Software Engineering and Knowledge Engineering 02, Nr. 02 (Juni 1992): 277–92. http://dx.doi.org/10.1142/s0218194092000142.
Wells, Mark B., Margaret A. Hug und Rollo Silver. „Libraries as programs preserved within compiler continuations“. ACM SIGPLAN Notices 20, Nr. 7 (Juli 1985): 83–91. http://dx.doi.org/10.1145/17919.806830.
Armstrong, Brian, Seon Wook Kim, Insung Park, Michael Voss und Rudolf Eigenmann. „Compiler-based tools for analyzing parallel programs“. Parallel Computing 24, Nr. 3-4 (Mai 1998): 401–20. http://dx.doi.org/10.1016/s0167-8191(98)00019-2.
Bowles, Andrew. „Trends in applying abstract interpretation“. Knowledge Engineering Review 7, Nr. 2 (Juni 1992): 157–71. http://dx.doi.org/10.1017/s0269888900006275.
He, Xuzhen. „Accelerated linear algebra compiler for computationally efficient numerical models: Success and potential area of improvement“. PLOS ONE 18, Nr. 2 (24.02.2023): e0282265. http://dx.doi.org/10.1371/journal.pone.0282265.
DE LA BANDA, MARIC GARCÍA, WARWICK HARVEY, KIM MARRIOTT, PETER J. STUCKEY und BART DEMOEN. „Checking modes of HAL programs“. Theory and Practice of Logic Programming 5, Nr. 6 (31.10.2005): 623–67. http://dx.doi.org/10.1017/s1471068404002327.
Leinenbach, Dirk, und Elena Petrova. „Pervasive Compiler Verification – From Verified Programs to Verified Systems“. Electronic Notes in Theoretical Computer Science 217 (Juli 2008): 23–40. http://dx.doi.org/10.1016/j.entcs.2008.06.040.
Black, Paul, und Iqbal Gondal. „Cross-Compiler Bipartite Vulnerability Search“. Electronics 10, Nr. 11 (07.06.2021): 1356. http://dx.doi.org/10.3390/electronics10111356.
Mehta, Sanyam, und Pen-Chung Yew. „Improving compiler scalability: optimizing large programs at small price“. ACM SIGPLAN Notices 50, Nr. 6 (07.08.2015): 143–52. http://dx.doi.org/10.1145/2813885.2737954.
Tian, Xinmin, Jay P. Hoeflinger, Grant Haab, Yen-Kuang Chen, Milind Girkar und Sanjiv Shah. „A compiler for exploiting nested parallelism in OpenMP programs“. Parallel Computing 31, Nr. 10-12 (Oktober 2005): 960–83. http://dx.doi.org/10.1016/j.parco.2005.03.007.
Yang, Yi, Ping Xiang, Jingfei Kong und Huiyang Zhou. „An optimizing compiler for GPGPU programs with input-data sharing“. ACM SIGPLAN Notices 45, Nr. 5 (Mai 2010): 343–44. http://dx.doi.org/10.1145/1837853.1693505.
Huang, Lei, Deepak Eachempati, Marcus W. Hervey und Barbara Chapman. „Exploiting global optimizations for openmp programs in the openuh compiler“. ACM SIGPLAN Notices 44, Nr. 4 (14.02.2009): 289–90. http://dx.doi.org/10.1145/1594835.1504219.
Newton, Ryan R., Lewis D. Girod, Michael B. Craig, Samuel R. Madden und John Gregory Morrisett. „Design and evaluation of a compiler for embedded stream programs“. ACM SIGPLAN Notices 43, Nr. 7 (27.06.2008): 131–40. http://dx.doi.org/10.1145/1379023.1375675.
Ierotheou, C. S., S. P. Johnson, P. F. Leggett, M. Cross, E. W. Evans, H. Jin, M. Frumkin und J. Yan. „The Semi-Automatic Parallelisation of Scientific Application Codes Using a Computer Aided Parallelisation Toolkit“. Scientific Programming 9, Nr. 2-3 (2001): 163–73. http://dx.doi.org/10.1155/2001/327048.
Marowka, Ami. „Bsp2omp: A Compiler For Translating Bsp Programs To Openmp“. International Journal of Parallel, Emergent and Distributed Systems 24, Nr. 4 (August 2009): 293–310. http://dx.doi.org/10.1080/17445760902719927.
Campanoni, Simone, Kevin Brownell, Svilen Kanev, Timothy M. Jones, Gu-Yeon Wei und David Brooks. „Automatically accelerating non-numerical programs by architecture-compiler co-design“. Communications of the ACM 60, Nr. 12 (27.11.2017): 88–97. http://dx.doi.org/10.1145/3139461.
Lenglet, Romain, Thierry Coupaye und Eric Bruneton. „Composing transformations of compiled Java programs with Jabyce“. Computer Science and Information Systems 1, Nr. 2 (2004): 83–125. http://dx.doi.org/10.2298/csis0402083l.
Lickly, Daniel J., und Philip J. Hatcher. „C++ and Massively Parallel Computers“. Scientific Programming 2, Nr. 4 (1993): 193–202. http://dx.doi.org/10.1155/1993/450517.
Sarkar, Vivek, und John Hennessy. „Compile-time partitioning and scheduling of parallel programs“. ACM SIGPLAN Notices 21, Nr. 7 (Juli 1986): 17–26. http://dx.doi.org/10.1145/13310.13313.
MONGENET, CATHERINE. „DATA COMPILING FOR SYSTEMS OF UNIFORM RECURRENCE EQUATIONS“. Parallel Processing Letters 04, Nr. 03 (September 1994): 245–57. http://dx.doi.org/10.1142/s0129626494000247.
Tian, X. „Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs“. Computer Journal 48, Nr. 5 (01.01.2005): 588–601. http://dx.doi.org/10.1093/comjnl/bxh109.
Tewary, Manish, Zoran Salcic, Morteza Biglari-Abhari und Avinash Malik. „Compiler-assisted energy reduction of java real-time programs“. Microprocessors and Microsystems 89 (März 2022): 104436. http://dx.doi.org/10.1016/j.micpro.2022.104436.
Ward, A. C., und W. P. Seering. „Quantitative Inference in a Mechanical Design ‘Compiler’“. Journal of Mechanical Design 115, Nr. 1 (01.03.1993): 29–35. http://dx.doi.org/10.1115/1.2919320.
FERRANTE, JEANNE, DIRK GRUNWALD und HARLNI SRINIVASAN. „COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*“. Parallel Algorithms and Applications 12, Nr. 1-3 (Januar 1997): 21–56. http://dx.doi.org/10.1080/01495739708941415.