作者: fatty-streak 時(shí)間: 2025-3-21 20:38
J. Cervós-Navarro,A. Perez Cantocutive statements, we call the analysis dense. On the other hand, if these regions include many such points, then we call it sparse. This paper presents a systematic method to build program representations that support sparse analyses. To pave the way to this framework we clarify the bibliography ab作者: 紅腫 時(shí)間: 2025-3-22 02:32 作者: REIGN 時(shí)間: 2025-3-22 05:32 作者: esoteric 時(shí)間: 2025-3-22 10:19
H. Friedrich,V. Seifert,H. Beckereachable data—need be preserved..Using a first-order functional language we formulate a context-sensitive liveness analysis for structured data and prove it correct. We then use a 0-CFA-like conservative approximation to annotate each allocation and function-call program point with a finite-state au作者: laceration 時(shí)間: 2025-3-22 16:26 作者: laceration 時(shí)間: 2025-3-22 20:32
Unilateral Approaches to Spinal Tumorsorms. The sequential core of X10 is an object-oriented language in the Java family. This core is augmented by a few parallel constructs that create . as a generalization of the well known fork/join model. Clocks are a generalization of the familiar barriers. Synchronization on a clock is specified b作者: 思考 時(shí)間: 2025-3-23 00:31
Spinal Tumors: Magnetic Resonance Imaging one control flow path at a time. Existing hardware mechanism to reconverge threads using a stack causes duplicate execution of code for unstructured control flow graphs. Also the stack mechanism cannot effectively utilize the available parallelism among diverging branches. Further, the amount of ne作者: sulcus 時(shí)間: 2025-3-23 03:46 作者: 孵卵器 時(shí)間: 2025-3-23 07:44
Occipitocervical Surgery Complicationsions combined with the ability to extract submatch information significantly increase the expressiveness of lexer specifications. We show that such an expressive lexical analysis can be done efficiently using some novel automata-based methods. The approach has been implemented in an ML lexer tool w作者: 男學(xué)院 時(shí)間: 2025-3-23 11:09
Elizabeth W. Hubbard,Daniel J. Sucato an impact also in the field of compiler technology, although the research on deterministic parsing did not prove to be effective in exploiting the architectural advantages, the main impediment being the inherent sequential nature of traditional LL and LR algorithms. We present PAPAGENO, an automate作者: FECT 時(shí)間: 2025-3-23 15:19
Daniel Haschtmann,Stephen J. Fergusonr completely ignore dynamic field access or use overly conservative approximations that lead to poor precision and scalability..We present new string domains to reason about dynamic field access in a static analysis tool. A key feature of the domains is that the equal, concatenate and join operation作者: 客觀 時(shí)間: 2025-3-23 19:00
The Optimization of Spinal Arthrodesisent and even desktop applications. The most appealing advantage of moving applications to JavaScript is its capability to run the same code in a large number of different devices. It is not surprising that many compilers target JavaScript as an intermediate language. However, writing optimizations a作者: 柏樹(shù) 時(shí)間: 2025-3-24 00:21
Bone Densitometry in Research and PracticeThe first step towards correct business processes is the verification of structural correctness, i.e., the absence of deadlocks and lack of synchronization..In this demonstration paper, we present a system which was integrated into the Activiti BPMN 2.0 designer for Eclipse, allowing an immediate us作者: GLEAN 時(shí)間: 2025-3-24 04:06
Bone Densitometry in Research and Practiced in parts from both parties. By the security guarantees of STC, neither party can learn any information on the other party’s input while performing the STC task. For a long time thought to be impractical, until recently, STC has only been implemented with domain-specific languages or hand-crafted B作者: 游行 時(shí)間: 2025-3-24 07:06 作者: DOTE 時(shí)間: 2025-3-24 14:39 作者: GRAVE 時(shí)間: 2025-3-24 15:43 作者: 銼屑 時(shí)間: 2025-3-24 22:34 作者: 的染料 時(shí)間: 2025-3-24 23:34
Recovery of Class Hierarchies and Composition Relationships from Machine Codetand the object-oriented design of software systems that lack documentation and source code, e.g., to enable interoperability. Our experiments show that the class hierarchies recovered by Lego have a high degree of agreement—measured in terms of precision and recall—with the hierarchy defined in the source code.作者: 流出 時(shí)間: 2025-3-25 05:33 作者: caldron 時(shí)間: 2025-3-25 09:53
0302-9743 re organized in topical sections named: program analysis and optimization; parallelism and parsing and new trends in compilation.978-3-642-54806-2978-3-642-54807-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Acetaminophen 時(shí)間: 2025-3-25 14:32 作者: CLOT 時(shí)間: 2025-3-25 19:23
https://doi.org/10.1007/978-3-642-71108-4tand the object-oriented design of software systems that lack documentation and source code, e.g., to enable interoperability. Our experiments show that the class hierarchies recovered by Lego have a high degree of agreement—measured in terms of precision and recall—with the hierarchy defined in the source code.作者: flutter 時(shí)間: 2025-3-25 22:39
Elizabeth W. Hubbard,Daniel J. Sucatod parser generator relying on operator precedence grammars. We complemented the PAPAGENO-generated parallel parsers with parallel lexing techniques, obtaining near-linear speedups on multicore machines, and the same speed as Bison parsers on sequential execution.作者: Explicate 時(shí)間: 2025-3-26 00:32
Differential Diagnosis of Spinal Tumors, specifically: what are the challenges of maintaining the SSA form on a program representation based on machine instructions; how the SSA form may be used in the if-conversion optimizations; why the SSA form does not seem to benefit instruction scheduling; and what is the state-of-the-art in SSA form destruction on machine code.作者: CUB 時(shí)間: 2025-3-26 06:45 作者: Vasodilation 時(shí)間: 2025-3-26 09:26 作者: 凌辱 時(shí)間: 2025-3-26 14:07
Using the SSA-Form in a Code Generator, specifically: what are the challenges of maintaining the SSA form on a program representation based on machine instructions; how the SSA form may be used in the if-conversion optimizations; why the SSA form does not seem to benefit instruction scheduling; and what is the state-of-the-art in SSA form destruction on machine code.作者: 牛馬之尿 時(shí)間: 2025-3-26 18:29 作者: 聚集 時(shí)間: 2025-3-26 22:03
CBMC-GC: An ANSI C Compiler for Secure Two-Party Computationsl role since each STC step involves encryption and network transfer and is therefore extremely slow when compared to computations performed on modern hardware architectures. We report on newly implemented circuit optimization techniques that substantially reduce the circuit sizes compared to the original release of CBMC-GC.作者: 羽毛長(zhǎng)成 時(shí)間: 2025-3-27 05:00
0302-9743 European Joint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. The 10 full papers and 4 tool papers included in this volume were carefully reviewed and selected from 47 submissions; the book also contains one invited talk. The papers a作者: Felicitous 時(shí)間: 2025-3-27 07:12
https://doi.org/10.1007/978-3-642-71108-4o perform data dependent optimizations at run-time for processing kernels..In this paper we present the motivations and how to use .: a tool designed to build fast and portable binary code generators called ..作者: incredulity 時(shí)間: 2025-3-27 10:41
Occipitocervical Surgery Complicationn expressive lexical analysis can be done efficiently using some novel automata-based methods. The approach has been implemented in an ML lexer tool which is compatible with .. Experimental results confirm that our approach is competitive with respect to existing ML lexer tools.作者: Hemiplegia 時(shí)間: 2025-3-27 16:12
a Tool to Embed Dynamic Code Generators into Applicationso perform data dependent optimizations at run-time for processing kernels..In this paper we present the motivations and how to use .: a tool designed to build fast and portable binary code generators called ..作者: 輕推 時(shí)間: 2025-3-27 20:41
A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatchingn expressive lexical analysis can be done efficiently using some novel automata-based methods. The approach has been implemented in an ML lexer tool which is compatible with .. Experimental results confirm that our approach is competitive with respect to existing ML lexer tools.作者: calamity 時(shí)間: 2025-3-27 23:38
H. Friedrich,V. Seifert,H. Beckerve marker) and then preserved (e.g. by a copy phase)..Experiments confirm the expected performance benefits—increase in garbage reclaimed and a consequent decrease in the number of collections, a decrease in the memory size required to run programs, and reduced overall garbage collection time for a majority of programs.作者: 浪蕩子 時(shí)間: 2025-3-28 02:43
Bone Densitometry in Research and Practiceaphs on which a new structural correctness verification is performed directly. This is done for each modification and the determined failures are visualized directly in the business process. The system can be seen as first step towards a compiler for business processes.作者: 讓你明白 時(shí)間: 2025-3-28 08:44
Liveness-Based Garbage Collectionve marker) and then preserved (e.g. by a copy phase)..Experiments confirm the expected performance benefits—increase in garbage reclaimed and a consequent decrease in the number of collections, a decrease in the memory size required to run programs, and reduced overall garbage collection time for a majority of programs.作者: 政府 時(shí)間: 2025-3-28 14:30
A First Step towards a Compiler for Business Processesaphs on which a new structural correctness verification is performed directly. This is done for each modification and the determined failures are visualized directly in the business process. The system can be seen as first step towards a compiler for business processes.作者: Awning 時(shí)間: 2025-3-28 15:18
Conference proceedings 2014oint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. The 10 full papers and 4 tool papers included in this volume were carefully reviewed and selected from 47 submissions; the book also contains one invited talk. The papers are organiz作者: Intractable 時(shí)間: 2025-3-28 20:46 作者: decode 時(shí)間: 2025-3-29 01:53 作者: 散布 時(shí)間: 2025-3-29 03:28 作者: intoxicate 時(shí)間: 2025-3-29 07:40
Spinal Tumors: Magnetic Resonance Imagingis mechanism reconverges the divergent threads as early as possible. It also reduces the depth of the reconvergence stack. The available parallelism in nested branches can be effectively extracted by scheduling the basic blocks to reduce the effect of stalls due to memory accesses. It can also incre作者: 拔出 時(shí)間: 2025-3-29 14:15
Young M. Lee,Joseph Osorio,Sanjay Dhallations. We demonstrate the effectiveness of our approach in detecting and exploiting parallelism using sequential codes from the Nas benchmark suite. We achieve an average speedup of 3.2x, and up to 99x, over the sequential baseline. On average, this is 1.42 times faster than state-of-the-art specul作者: KEGEL 時(shí)間: 2025-3-29 19:18 作者: Vsd168 時(shí)間: 2025-3-29 21:53
Parameterized Construction of Program Representations for Sparse Dataflow Analysesly of data-flow problems that can be partitioned per variables. However, contrary to SEGs, we can handle - sparsely - problems that are not in this family. We have tested our ideas in the LLVM compiler, comparing different program representations in terms of size and construction time.作者: 總 時(shí)間: 2025-3-30 00:06 作者: finale 時(shí)間: 2025-3-30 05:42
Improving the Performance of X10 Programs by Clock Removaln. Operations with the same date constitute a ., fronts are executed sequentially in order of increasing dates, while operations in a front are executed in parallel if possible. Depending on the nature of the program, this may entail some overhead, which can be reduced to zero for polyhedral program作者: 抱狗不敢前 時(shí)間: 2025-3-30 11:35
Taming Control Divergence in GPUs through Control Flow Linearizationis mechanism reconverges the divergent threads as early as possible. It also reduces the depth of the reconvergence stack. The available parallelism in nested branches can be effectively extracted by scheduling the basic blocks to reduce the effect of stalls due to memory accesses. It can also incre作者: 比喻好 時(shí)間: 2025-3-30 15:58 作者: 喃喃而言 時(shí)間: 2025-3-30 17:22
Addressing JavaScript JIT Engines Performance Quirks: A Crowdsourced Adaptive Compiler a scenario demands a radical new solution for the traditional compiler optimization flow. This paper proposes collecting web clients performance data to build a crowdsourced compiler flag suggestion system in the cloud that helps the compiler perform the appropriate optimizations for each client pl作者: 誰(shuí)在削木頭 時(shí)間: 2025-3-30 21:26
Using the SSA-Form in a Code Generatoresentation that supports most of the code optimizations. However, aggressive compilation also requires that optimizations that are more effective with the SSA form be applied to the target-specific program representations operated by the code generator, that is, the set of compiler phases after and 作者: 共同給與 時(shí)間: 2025-3-31 02:02
Parameterized Construction of Program Representations for Sparse Dataflow Analysescutive statements, we call the analysis dense. On the other hand, if these regions include many such points, then we call it sparse. This paper presents a systematic method to build program representations that support sparse analyses. To pave the way to this framework we clarify the bibliography ab作者: 感激小女 時(shí)間: 2025-3-31 06:44
Inter-iteration Scalar Replacement Using Array SSA FormSA form, a uniform representation for capturing control and data flow properties at the level of array or pointer accesses. We present extensions to the original Array SSA form representation to capture loop-carried data flow information for arrays and pointers. A core contribution of our algorithm
