標題: Titlebook: Compiler Construction; 24th International C Bj?rn Franke Conference proceedings 2015 Springer-Verlag Berlin Heidelberg 2015 Code Generation [打印本頁] 作者: Fixate 時間: 2025-3-21 18:42
書目名稱Compiler Construction影響因子(影響力)
書目名稱Compiler Construction影響因子(影響力)學科排名
書目名稱Compiler Construction網絡公開度
書目名稱Compiler Construction網絡公開度學科排名
書目名稱Compiler Construction被引頻次
書目名稱Compiler Construction被引頻次學科排名
書目名稱Compiler Construction年度引用
書目名稱Compiler Construction年度引用學科排名
書目名稱Compiler Construction讀者反饋
書目名稱Compiler Construction讀者反饋學科排名
作者: 裝勇敢地做 時間: 2025-3-21 22:12 作者: 貪婪的人 時間: 2025-3-22 03:39 作者: 殺菌劑 時間: 2025-3-22 07:42 作者: 動脈 時間: 2025-3-22 11:09
Staged Points-to Analysis for Large Code Basesework in Datalog for a proprietary bug checker that could identify security vulnerabilities in the OpenJDK. library which has approximately 1.3 million variables and 500,000 allocation-sites. For the clients that we have chosen, our technique is able to eliminate about 73% of all variables and about作者: 粗糙濫制 時間: 2025-3-22 16:58
Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizeslong tile axes, the parametric (with respect to tile sizes) analysis for inter-tile data reuse is nevertheless possible, i.e., one can determine, at compiletime and in a parametric fashion, the copy-in and copy-out data sets for all tiles, with inter-tile reuse, as well as sizes for the induced loca作者: 粗糙濫制 時間: 2025-3-22 19:08 作者: 凝結劑 時間: 2025-3-22 23:08 作者: 好忠告人 時間: 2025-3-23 04:40 作者: Glossy 時間: 2025-3-23 06:35
Wirtschaftswissenschaftliche Beitr?ge this paper details the sequence of source-to-source transformations that ultimately yield sequential code. A generic intermediate language is introduced to represent transition functions. The versatility of this approach is exhibited by treating two classical simulation targets: code that complies 作者: 使痛苦 時間: 2025-3-23 10:27 作者: 填滿 時間: 2025-3-23 14:08 作者: 苦惱 時間: 2025-3-23 18:29
https://doi.org/10.1007/978-3-476-04177-7ework in Datalog for a proprietary bug checker that could identify security vulnerabilities in the OpenJDK. library which has approximately 1.3 million variables and 500,000 allocation-sites. For the clients that we have chosen, our technique is able to eliminate about 73% of all variables and about作者: Opponent 時間: 2025-3-24 01:07
Theorien. Der Autor auf dem Weg zur Figur,long tile axes, the parametric (with respect to tile sizes) analysis for inter-tile data reuse is nevertheless possible, i.e., one can determine, at compiletime and in a parametric fashion, the copy-in and copy-out data sets for all tiles, with inter-tile reuse, as well as sizes for the induced loca作者: Neolithic 時間: 2025-3-24 03:23 作者: 相符 時間: 2025-3-24 10:19
https://doi.org/10.1007/978-3-476-03806-7ates an optimisation method that overlaps communication and computation, and can derive not only representative parallel programs with common parallel patterns (such as ring and stencil), but also distributed applications from any MPST protocols. We show that our tool generates efficient and scalabl作者: guzzle 時間: 2025-3-24 14:31 作者: 不給啤 時間: 2025-3-24 17:15 作者: 裝入膠囊 時間: 2025-3-24 19:14 作者: 思想上升 時間: 2025-3-25 03:11 作者: 諄諄教誨 時間: 2025-3-25 03:48
https://doi.org/10.1007/978-3-658-04441-1 With a feature-specific profiler, a programmer can identify specific instances of language features that are responsible for performance problems. After explaining the architecture of our feature-specific profiler, the paper presents the evidence in support of adding feature-specific profiling to the programmer’s toolset.作者: 在前面 時間: 2025-3-25 10:11 作者: badinage 時間: 2025-3-25 12:09
https://doi.org/10.1007/978-3-658-04441-1s, and, second, a DSL to eliminate much of the boilerplate code required for plugin development. We demonstrate the usefulness of our library by implementing five diverse compiler plugins. We show that, using Piuma, plugins require less code and are easier to understand than plugins developed using the base Scala compiler plugin API.作者: 無底 時間: 2025-3-25 15:51
https://doi.org/10.1007/978-3-531-19777-7are embedded in a single sparse optimization framework, factoring out many of the dominance-based reasoning steps required in proofs of SSA-based optimizations. Our experimental evaluations indicate both a better precision, and a significant compilation time speedup.作者: 微生物 時間: 2025-3-25 20:05
A Refactoring Library for Scala Compiler Extensionss, and, second, a DSL to eliminate much of the boilerplate code required for plugin development. We demonstrate the usefulness of our library by implementing five diverse compiler plugins. We show that, using Piuma, plugins require less code and are easier to understand than plugins developed using the base Scala compiler plugin API.作者: farewell 時間: 2025-3-26 01:32
Verifying Fast and Sparse SSA-Based Optimizations in Coqare embedded in a single sparse optimization framework, factoring out many of the dominance-based reasoning steps required in proofs of SSA-based optimizations. Our experimental evaluations indicate both a better precision, and a significant compilation time speedup.作者: 保守 時間: 2025-3-26 04:33 作者: exophthalmos 時間: 2025-3-26 12:12
0302-9743 Joint Conferences on Theory and Practice of Software, ETAPS 2015, in London, UK, in April 2015..The 11 papers presented in this volume were carefully reviewed and selected from 34 submissions. They deal with compiler engineering and compiling techniques; compiler analysis and optimisation and formal作者: 大方不好 時間: 2025-3-26 15:18 作者: 魯莽 時間: 2025-3-26 19:07
A Refactoring Library for Scala Compiler Extensionstion, or code transformations. However, compiler plugins are often difficult to build. A plugin can perform arbitrary code transformations, easily allowing a developer to generate incorrect code. Moreover, the base compiler assumes many complex, sometimes undocumented invariants, requiring plugin de作者: NICHE 時間: 2025-3-26 22:55
Feature-Specific Profiling least not easily. Programmers may accidentally use high-level features in ways that compiler writers could not anticipate, and they may thus produce underperforming programs as a result..This paper introduces ., a profiling technique that reports performance costs in terms of linguistic constructs.作者: ETHER 時間: 2025-3-27 04:38
A Synchronous-Based Code Generator for Explicit Hybrid Systems Languagestial code generation from such languages is important for simulation efficiency and for producing code for embedded targets. Despite being routinely used in industrial compilers, code generation is rarely, if ever, described in full detail, much less formalized. Yet formalization is an essential ste作者: 圓柱 時間: 2025-3-27 09:09
Faster, Practical GLL Parsingsers have the direct relationship with the grammar that RD parsers have, and therefore, compared to GLR, are easier to understand, debug, and extend. This makes GLL parsing attractive for parsing programming languages..In this paper we propose a more efficient Graph-Structured Stack (GSS) for GLL pa作者: 高腳酒杯 時間: 2025-3-27 11:33 作者: 入會 時間: 2025-3-27 14:15
Staged Points-to Analysis for Large Code Bases sets for program variables to find bugs in source codes. However, heap abstractions coined commonly as points-to analysis, have high runtime-complexity especially when the points-to analysis is context- sensitive, and, hence, state-of-the-art points-to analyses do not scale for large code bases..In作者: ARM 時間: 2025-3-27 19:50
Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizescking algorithms, which are particularly useful when offloading kernels on computing units with smaller memories. When caches are not available or used, data transfers and local storage must be software-managed, and some useless remote communications can be avoided by exploiting data reuse between t作者: 招人嫉妒 時間: 2025-3-28 01:39
: A Generator for Local Optimizationsof the compiler developers about mathematical identities that hold for the operations of their intermediate representation. Unfortunately, these sets of hand-crafted rules guarantee neither correctness nor completeness. . solves this problem by generating . local optimizations up to a given cost lim作者: allergy 時間: 2025-3-28 04:29
Towards a Scalable Framework for Context-Free Language Reachabilitye language. CFL-R provides a fundamental formulation for many applications, including shape analysis, data and control flow analysis, program slicing, specification-inferencing and points-to analysis. Unfortunately, generic algorithms for CFL-R scale poorly with large instances, leading research to 作者: Neonatal 時間: 2025-3-28 09:20
Protocols by Defaultstarts with the definition of the global topology using a protocol specification language based on parameterised multiparty session types (MPST). An MPI parallel program backbone is automatically generated from the global specification. The backbone code can then be merged with the sequential code d作者: 友好關系 時間: 2025-3-28 14:12 作者: Platelet 時間: 2025-3-28 17:37
Arnold Picot,Said Zahedani,Albrecht Ziemerhdown automata. Unfortunately, the resulting descriptions can be baroque, and even a basic understanding of some parsing algorithms, such as Earley’s algorithm for general context-free grammars, can be elusive. In this paper, we present a graphical representation of context-free grammars called the 作者: Harpoon 時間: 2025-3-28 19:48 作者: 紳士 時間: 2025-3-29 01:02 作者: GNAT 時間: 2025-3-29 04:32 作者: STYX 時間: 2025-3-29 11:07 作者: 惡臭 時間: 2025-3-29 14:56
Wissenssoziologische Diskursanalyse,rative systems can use powerful algorithms such as query planning to choose high-level execution strategies during compilation. However, the principal downside of such languages is that their primitives must be carefully curated, to allow the query planner to correctly estimate their overhead. In th作者: 拋射物 時間: 2025-3-29 17:05 作者: 慢慢流出 時間: 2025-3-29 22:23
Theorien. Der Autor auf dem Weg zur Figur,cking algorithms, which are particularly useful when offloading kernels on computing units with smaller memories. When caches are not available or used, data transfers and local storage must be software-managed, and some useless remote communications can be avoided by exploiting data reuse between t作者: 值得贊賞 時間: 2025-3-30 02:59 作者: 輕率的你 時間: 2025-3-30 07:06
https://doi.org/10.1007/978-3-476-03806-7e language. CFL-R provides a fundamental formulation for many applications, including shape analysis, data and control flow analysis, program slicing, specification-inferencing and points-to analysis. Unfortunately, generic algorithms for CFL-R scale poorly with large instances, leading research to
