Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Equality saturation: a new approach to optimization
Optimizations in a traditional compiler are applied sequentially, with each optimization
destructively modifying the program to produce a transformed program that is then passed to …
destructively modifying the program to produce a transformed program that is then passed to …
[کتاب][B] Multiprocessor systems-on-chips
Modern system-on-chip (SoC) design shows a clear trend toward integration of multiple
processor cores on a single chip. Designing a multiprocessor system-on-chip (MPSOC) …
processor cores on a single chip. Designing a multiprocessor system-on-chip (MPSOC) …
Configurable software verification: Concretizing the convergence of model checking and program analysis
In automatic software verification, we have observed a theoretical convergence of model
checking and program analysis. In practice, however, model checkers are still mostly …
checking and program analysis. In practice, however, model checkers are still mostly …
[کتاب][B] The compiler design handbook: optimizations and machine code generation
YN Srikant, P Shankar - 2002 - taylorfrancis.com
The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …
beginning. Add embedded systems, multiple memory banks, highly pipelined units …
Optimizing data structures in high-level programs: New directions for extensible compilers based on staging
High level data structures are a cornerstone of modern programming and at the same time
stand in the way of compiler optimizations. In order to reason about user-or library-defined …
stand in the way of compiler optimizations. In order to reason about user-or library-defined …
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning
that their transformations are always semantics-preserving. We first present a domain …
that their transformations are always semantics-preserving. We first present a domain …
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be
automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses …
automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses …
Feldspar: A domain specific language for digital signal processing algorithms
A new language, Feldspar, is presented, enabling high-level and platform-independent
description of digital signal processing (DSP) algorithms. Feldspar is a pure functional …
description of digital signal processing (DSP) algorithms. Feldspar is a pure functional …
Verification artifacts in cooperative verification: Survey and unifying component framework
The goal of cooperative verification is to combine verification approaches in such a way that
they work together to verify a system model. In particular, cooperative verifiers provide …
they work together to verify a system model. In particular, cooperative verifiers provide …
Program transformation with scoped dynamic rewrite rules
The applicability of term rewriting to program transformation is limited by the lack of control
over rule application and by the context-free nature of rewrite rules. The first problem is …
over rule application and by the context-free nature of rewrite rules. The first problem is …