作者: HARP 時(shí)間: 2025-3-21 23:15
Online Subpath Profiling sampling technique that makes effective utilization of memory with small overhead. Both memory and runtime overheads can be controlled, and the OSPalgorit hm can therefore be used for arbitrarily large applications, realizing a tradeoff between report accuracy and performance..We have implemented a作者: 楓樹(shù) 時(shí)間: 2025-3-22 01:28 作者: 放逐 時(shí)間: 2025-3-22 07:46
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs for program analysis and transformation. We also describe a whole-program merger based on structural type equality, allowing a complete project to be viewed as a single compilation unit. As a representative application of CIL, we show a transformation aimed at making code immune to stack-smashing a作者: peritonitis 時(shí)間: 2025-3-22 11:07 作者: negotiable 時(shí)間: 2025-3-22 14:59
Planetary Probes and Spinning Parachutes, sampling technique that makes effective utilization of memory with small overhead. Both memory and runtime overheads can be controlled, and the OSPalgorit hm can therefore be used for arbitrarily large applications, realizing a tradeoff between report accuracy and performance..We have implemented a作者: negotiable 時(shí)間: 2025-3-22 17:48 作者: 修正案 時(shí)間: 2025-3-22 21:55 作者: 道學(xué)氣 時(shí)間: 2025-3-23 04:38 作者: 線 時(shí)間: 2025-3-23 05:58 作者: Mobile 時(shí)間: 2025-3-23 13:21
Disambiguation Filters for Scannerless Generalized LR Parsers作者: AVERT 時(shí)間: 2025-3-23 17:39 作者: CLASP 時(shí)間: 2025-3-23 21:19
StreamIt: A Language for Streaming Applicationswe motivate, describe and justify the language features of StreamIt, which include: a structured model of streams, a messaging system for control, a re-initialization mechanism, and a natural textual syntax.作者: 單純 時(shí)間: 2025-3-24 01:41 作者: faction 時(shí)間: 2025-3-24 06:13
Flux-Deformed Neumann–Rosochatius Systemwe motivate, describe and justify the language features of StreamIt, which include: a structured model of streams, a messaging system for control, a re-initialization mechanism, and a natural textual syntax.作者: 悠然 時(shí)間: 2025-3-24 09:29 作者: Hla461 時(shí)間: 2025-3-24 11:48 作者: Nibble 時(shí)間: 2025-3-24 18:30 作者: 故意釣到白楊 時(shí)間: 2025-3-24 21:11
Data Compression Transformations for Dynamically Allocated Data Structuresprocessor’s instruction set. We have observeda verage reductions in heap allocatedst orage of 25% and average reductions in execution time andp ower consumption of 30%. If DCX support is not provided the reductions in execution times fall from 30% to 12.5%.作者: 貨物 時(shí)間: 2025-3-25 02:50 作者: phlegm 時(shí)間: 2025-3-25 06:04 作者: 微塵 時(shí)間: 2025-3-25 09:23 作者: 上釉彩 時(shí)間: 2025-3-25 15:40 作者: 催眠 時(shí)間: 2025-3-25 19:32 作者: 小蟲(chóng) 時(shí)間: 2025-3-25 23:53
LISA: An Interactive Environment for Programming Language Developmentterpreter and other graphic tools. The LISA is a set of related tools such as scanner generators, parser generators, compiler generators, graphic tools, editors and conversion tools, which are integrated by well-designed interfaces.作者: Hamper 時(shí)間: 2025-3-26 01:49 作者: 躲債 時(shí)間: 2025-3-26 07:12
Bouncing Balls, Airbags, and Tumbleweeds,of memory and reached improvements upto less than a tenth. In the average case, the reduction is about a third of the memory usage of the classical algorithm. In addition, the experiments showed that the runtimes are almost the same: The average speedup of the classical algorithm is only marginally greater than one.作者: 茁壯成長(zhǎng) 時(shí)間: 2025-3-26 08:44
https://doi.org/10.1007/978-3-319-96020-3that is more than competitive with the fastest previous implementation, with greater simplicity and better portability and interoperability..The approach we describe can also be used for compiling to other target languages, such as IL (the Microsoft .NET intermediate language).作者: gerrymander 時(shí)間: 2025-3-26 12:42 作者: 眨眼 時(shí)間: 2025-3-26 18:26 作者: hazard 時(shí)間: 2025-3-26 21:19 作者: FID 時(shí)間: 2025-3-27 04:31 作者: 放肆的你 時(shí)間: 2025-3-27 07:38
Global Variable Promotion: Using Registers to Reduce Cache Power Dissipation tests, up to 22% of memory operations are removed. Four registers, for example, are sufficient to reduce the energy-delay product by 7 to 26%. Our results suggest that global variable promotion should be included as a standard optimization technique in power-conscious compilers.作者: lesion 時(shí)間: 2025-3-27 12:02 作者: UTTER 時(shí)間: 2025-3-27 17:16
Conference proceedings 2002s established in 1998by combining a number of existing and new conferences. This year it comprised 5 conferences (FOSSACS, FASE, ESOP, CC, TACAS), 13 satellite workshops (ACL2, AGT, CMCS, COCV, DCC, INT, LDTA, SC, SFEDL, SLAP, SPIN, TPTS, and VISS), 8invited lectures (not including those speci?c to 作者: arrhythmic 時(shí)間: 2025-3-27 21:05 作者: Conjuction 時(shí)間: 2025-3-27 22:17
Data Compression Transformations for Dynamically Allocated Data Structuress. We have developed the . and . transformations that respectively compress a 32 bit address pointer and a 32 bit integer field into 15 bit entities. A pair of fields which have been compressed by the above compression transformations are packedt ogether into a single 32 bit word. The above transfor作者: 起來(lái)了 時(shí)間: 2025-3-28 03:46
Evaluating a Demand Driven Technique for Call Graph Constructionere is a need for techniques for demand driven construction of a call graph. We have developed a technique for demand driven call graph construction which handles dynamic calls due to polymorphism in object-oriented languages. Our demand driven technique has the same accuracy as the corresponding ex作者: AWL 時(shí)間: 2025-3-28 08:46
A Graph—Free Approach to Data—Flow Analysisblem, this algorithm computes the maximum fixed point (MFP) solution. The edge structure of the graph represents possible control flows in the program. In this paper, we present a new, graph-free algorithm for computing the MFP solution. The experimental implementation of the algorithm was applied t作者: 弓箭 時(shí)間: 2025-3-28 10:47
A Representation for Bit Section Based Analysis and Optimizations, or general purpose processors with media extensions. In addition data compression techniques which are vital for embedded system applications result in code operating on subword level as well. Performing analysis on word level, however, is too coarse grain missing opportunities for optimizations.作者: Obliterate 時(shí)間: 2025-3-28 17:19 作者: Picks-Disease 時(shí)間: 2025-3-28 22:18 作者: 課程 時(shí)間: 2025-3-29 02:26
Decompiling Java Bytecode: Problems, Traps and Pitfallssible to decompile it back to Java source. Many such decompilers have been developed and the conventional wisdom is that decompiling Java bytecode is relatively simple. This may be true when decompiling bytecode produced directly from a specific compiler, most often Sun’s javac compiler. In this cas作者: 施加 時(shí)間: 2025-3-29 06:51 作者: 災(zāi)難 時(shí)間: 2025-3-29 11:16
Modular Static Program Analysis- simplification-based separate analysis; - worst-case separate analysis; - separate analysis with (user-provided) interfaces; - symbolic relational separate analysis; as well as a fifth category which is essentially obtained by composition of the above separate local analyses together with global a作者: LUCY 時(shí)間: 2025-3-29 13:10 作者: 道學(xué)氣 時(shí)間: 2025-3-29 16:05
Compiling Mercury to High-Level C Codeigh-level language. We describe an alternative approach to compiling logic programs to C, based on continuation passing, that we have used in a new back-end for the Mercury compiler. The new approach compiles to much higher-level C code, which means the compiler back-end and run-time system can be c作者: 小歌劇 時(shí)間: 2025-3-29 19:59 作者: 葡萄糖 時(shí)間: 2025-3-30 01:12 作者: 剝皮 時(shí)間: 2025-3-30 05:35 作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-30 08:13
Optimizing Static Power Dissipation by Functional Units in Superscalar Processorsg periods of time for reducing static power dissipation by idle functional units using power gating [.],[.]. The compiler identifies program regions in which functional units are expected to be idle and communicates this information to the hardware by issuing directives for turning units off at entr作者: 斥責(zé) 時(shí)間: 2025-3-30 16:23
Spinning Bullets, Bombs, and Rockets,g language LISA produces a language specific environment that includes editors (a language-knowledgable editor and a structured editor), a compiler/interpreter and other graphic tools. The LISA is a set of related tools such as scanner generators, parser generators, compiler generators, graphic tool作者: 豪華 時(shí)間: 2025-3-30 16:51
Bouncing Balls, Airbags, and Tumbleweeds,s. We have developed the . and . transformations that respectively compress a 32 bit address pointer and a 32 bit integer field into 15 bit entities. A pair of fields which have been compressed by the above compression transformations are packedt ogether into a single 32 bit word. The above transfor作者: 驚奇 時(shí)間: 2025-3-30 23:16
Skipping Stones and Bouncing Bombs,ere is a need for techniques for demand driven construction of a call graph. We have developed a technique for demand driven call graph construction which handles dynamic calls due to polymorphism in object-oriented languages. Our demand driven technique has the same accuracy as the corresponding ex作者: 祝賀 時(shí)間: 2025-3-31 02:50
Bouncing Balls, Airbags, and Tumbleweeds,blem, this algorithm computes the maximum fixed point (MFP) solution. The edge structure of the graph represents possible control flows in the program. In this paper, we present a new, graph-free algorithm for computing the MFP solution. The experimental implementation of the algorithm was applied t作者: 脆弱帶來(lái) 時(shí)間: 2025-3-31 05:53
https://doi.org/10.1007/978-0-387-47289-8s, or general purpose processors with media extensions. In addition data compression techniques which are vital for embedded system applications result in code operating on subword level as well. Performing analysis on word level, however, is too coarse grain missing opportunities for optimizations.作者: 沒(méi)有貧窮 時(shí)間: 2025-3-31 10:41 作者: 自愛(ài) 時(shí)間: 2025-3-31 13:46 作者: compose 時(shí)間: 2025-3-31 21:26
Springer Tracts in Modern Physicssible to decompile it back to Java source. Many such decompilers have been developed and the conventional wisdom is that decompiling Java bytecode is relatively simple. This may be true when decompiling bytecode produced directly from a specific compiler, most often Sun’s javac compiler. In this cas作者: colostrum 時(shí)間: 2025-3-31 21:55 作者: 無(wú)所不知 時(shí)間: 2025-4-1 03:08 作者: Deadpan 時(shí)間: 2025-4-1 07:50
Flux-Deformed Neumann–Rosochatius System language provides novel high-level representations to improve programmer productivity and program robustness within the streaming domain. At the same time, the StreamIt compiler aims to improve the performance of streaming applications via stream-specific analyses and optimizations. In this paper, 作者: 防止 時(shí)間: 2025-4-1 11:49 作者: 出來(lái) 時(shí)間: 2025-4-1 17:42 作者: monologue 時(shí)間: 2025-4-1 21:25
https://doi.org/10.1007/978-3-319-96020-3egister-constrained architectures like the Intel x86. Our allocator relies on static single assignment form, which simplifies data flow analysis and tends to produce short live intervals. It makes use of lifetime holes and instruction weights to improve the quality of the allocation. Our measurement作者: floaters 時(shí)間: 2025-4-2 01:25
https://doi.org/10.1007/978-1-4842-2571-4educed cache activity and less power consumption. The purpose of this paper is to evaluate global variable promotion in the context of ILP scheduling and estimate its potential as a software technique for reducing cache power consumption. We measured the frequency and distribution of accesses to glo作者: 恩惠 時(shí)間: 2025-4-2 03:27
https://doi.org/10.1007/978-1-4842-2571-4g periods of time for reducing static power dissipation by idle functional units using power gating [.],[.]. The compiler identifies program regions in which functional units are expected to be idle and communicates this information to the hardware by issuing directives for turning units off at entr
