检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,986 篇 会议
753 篇 期刊文献

馆藏范围

2,739 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,567 篇 工学
- 2,321 篇 计算机科学与技术...
- 1,909 篇 软件工程
- 332 篇 电气工程
- 159 篇 电子科学与技术（可...
- 135 篇 信息与通信工程
- 128 篇 控制科学与工程
- 38 篇 机械工程
- 38 篇 生物工程
- 23 篇 建筑学
- 21 篇 光学工程
- 20 篇 土木工程
- 19 篇 材料科学与工程（可...
- 19 篇 化学工程与技术
- 15 篇 动力工程及工程热...
- 14 篇 仪器科学与技术
- 12 篇 安全科学与工程
- 10 篇 力学（可授工学、理...
687 篇 理学
- 556 篇 数学
- 77 篇 物理学
- 41 篇 生物学
- 40 篇 系统科学
- 35 篇 统计学（可授理学、...
- 19 篇 化学
302 篇 管理学
- 201 篇 管理科学与工程(可...
- 111 篇 图书情报与档案管...
- 88 篇 工商管理
22 篇 经济学
- 21 篇 应用经济学
19 篇 教育学
- 19 篇 教育学
14 篇 法学
- 12 篇 社会学
8 篇 医学
3 篇 农学
2 篇 文学
1 篇 艺术学

主题

2,739 篇 program compiler...
56 篇 compilers
42 篇 embedded systems
29 篇 java
27 篇 computer archite...
26 篇 parallel process...
25 篇 c language
23 篇 software enginee...
23 篇 program diagnost...
23 篇 formal specifica...
22 篇 parallel program...
21 篇 parallel archite...
21 篇 formal verificat...
19 篇 software tools
19 篇 multiprocessing ...
18 篇 programming
18 篇 code generation
17 篇 program processo...
16 篇 unified modeling...
15 篇 optimisation

机构

12 篇 carnegie mellon ...
11 篇 eth zurich
10 篇 inria
9 篇 university of ed...
8 篇 university of ed...
8 篇 peking universit...
8 篇 purdue universit...
7 篇 stanford univers...
7 篇 microsoft resear...
7 篇 univ nova lisboa...
7 篇 microsoft resear...
6 篇 microsoft resear...
6 篇 google
5 篇 university of sc...
5 篇 shanghai jiao to...
5 篇 meta ai united s...
5 篇 department of co...
5 篇 tsinghua univers...
5 篇 syracuse univ sy...
5 篇 univ maryland de...

作者

14 篇 amarasinghe sama...
13 篇 eigenmann rudolf
10 篇 patrignani marco
9 篇 hwu wen-mei w.
9 篇 kjolstad fredrik
9 篇 cohen albert
9 篇 gomes luis
8 篇 kandemir m
8 篇 tseng chau-wen
8 篇 hendren laurie j...
8 篇 cummins chris
8 篇 padua david
8 篇 chambers craig
8 篇 kennedy ken
7 篇 leather hugh
7 篇 kasahara hironor...
7 篇 eggers susan j.
7 篇 banerjee prithvi...
7 篇 nicolau alexandr...
7 篇 appel andrew w.

语言

2,540 篇 英文
170 篇 其他
15 篇 中文
6 篇 日文
3 篇 葡萄牙文
2 篇 德文
2 篇 法文
1 篇 西班牙文
1 篇 塞尔维亚文

检索条件"主题词=Program compilers"

共 2739 条记录，以下是31-40 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Towards Realistic Results for Instrumentation-Based Profilers for JIT-Compiled Systems 21

Towards Realistic Results for Instrumentation-Based Profiler...

引用

21st ACM SIGPLAN International Conference on Managed programming Languages and Runtimes (MPLR)

作者： Burchell, Humphrey Larose, Octave Marr, Stefan Univ Kent Canterbury Kent England

ISBN: (纸本)9798400711183

Profilers are crucial tools for identifying and improving application performance. However, for language implementations with just-in-time (Jff) compilation, e.g., for Java and JavaScript, instrumentation-based profilers can have significant overheads and report unrealistic results caused by the instrumentation. In this paper, we examine state-of-the-art instrumentation based profilers for Java to determine the realism of their results. We assess their overhead, the effect on compilation time, and the generated bytecode. We found that the profiler with the lowest overhead increased run time by 82x. Additionally, we investigate the realism of results by testing a profiler's ability to detect whether inlining is enabled, which is an important compiler optimization. Our results document that instrumentation can alter program behavior so that performance observations are unrealistic, i.e., they do not reflect the performance of the uninstrumented program. As a solution, we sketch late-compiler-phase-based instrumentation for just-in-time compilers, which gives us the precision of instrumentation-based profiling with an overhead that is multiple magnitudes lower than that of standard instrumentation-based profilers, with a median overhead of 23.3% (min. 1.4%, max. 41644 By inserting probes late in the compilation process, we avoid interfering with compiler optimizations, which yields more realistic results.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

On the Benefits of Knowledge Compilation for Feature-Model Analyses 24

On the Benefits of Knowledge Compilation for Feature-Model A...

引用

28th International Systems and Software Product Line Conference (SPLC)

作者： Sundermann, Chico Kuiter, Elias Hess, Tobias Raab, Heiko Krieter, Sebastian Thuem, Thomas Univ Ulm Ulm Germany Univ Magdeburg Magdeburg Germany Paderborn Univ Paderborn Germany

ISBN: (纸本)9798400705939

In practice, feature models often have up-to thousands of features and, thus, are typically infeasible to analyze manually. Hence, many different analyses have been proposed which often rely on multiple computationally complex computations, such as solving SAT or #SAT problems. Knowledge compilation is the process of compiling the original input into a computationally more advantageous format, such as BDDs. The upfront compilation effort is subsequently amortized by faster computations on the target format. In our work, we examine the benefits of applying knowledge compilation for feature-model analysis with three major contributions. First, we classify existing feature-model analyses regarding the underlying computational problems. Second, we perform a survey to collect available knowledge-compilation languages and inspect their capabilities with respect to the identified feature-model analyses. Third, we gather and empirically evaluate available knowledge compilers on industrial feature models.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

Verified Validation for Affine Scheduling in Polyhedral Compilation 18th

Verified Validation for Affine Scheduling in Polyhedral Comp...

引用

18th International Conference on Theoretical Aspects of Software Engineering (TASE)

作者： Li, Xuyang Liang, Hongjin Feng, Xinyu Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China

ISBN: (纸本)9783031646256;9783031646263

Structural nested loops can be abstracted into polyhedral models, based on which one can perform aggressive loop optimizations;however, the optimizations are often heuristic and complex, and therefore error-prone. Meanwhile, verified compilers, though rigorously correct, still miss powerful optimizing transformations and therefore produce less efficient code than industrial ones. To bridge this gap, this work provides a general verified validation framework based on Bernstein's conditions for affine scheduling, the core component of polyhedral optimization techniques. It is parameterized over the concrete definitions and proofs of the instruction language to be reusable. As shown in our evaluation, the framework is flexible enough to support both existing verified compilers like CompCert and existing polyhedral compilers like Pluto. The result is fully mechanized in the Coq proof assistant.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

Mangrove: A Scalable Framework for Folding-Based SNARKs 44th

Mangrove: A Scalable Framework for Folding-Based SNARKs

引用

44th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO)

作者： Nguyen, Wilson Datta, Trisha Chen, Binyi Tyagi, Nirvan Boneh, Dan Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9783031684029;9783031684036

We present a framework for building efficient folding-based SNARKs. First we develop a new "uniformizing" compiler for NP statements that converts any poly-time computation to a sequence of identical simple steps. The resulting uniform computation is especially well-suited to be processed by a folding-based IVC scheme. Second, we develop two optimizations to folding-based IVC. The first reduces the recursive overhead of the IVC by restructuring the relation to which folding is applied. The second employs a "commit-and-fold" strategy to further simplify the relation. Together, these optimizations result in a folding-based SNARK that has a number of attractive features. First, the scheme uses a constant-size transparent common reference string (CRS). Second, the prover has (i) low memory footprint, (ii) makes only two passes over the data, (iii) is highly parallelizable, and (iv) is concretely efficient. Microbenchmarks indicate that proving time is competitive with leading monolithic SNARKs, and significantly faster than other streaming SNARKs. For 2(24) (2(32)) gates, the Mangrove prover is estimated to take 2 minutes (8 hours) with peak memory usage approximately 390 MB (800 MB) on a laptop(1) ((1)The full version of this work is available online at [43].).

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

SoK: On the Effectiveness of Control-Flow Integrity in Practice 18

SoK: On the Effectiveness of Control-Flow Integrity in Pract...

引用

18th USENIX WOOT Conference on Offensive Technologies (WOOT)

作者： Becker, Lucas Hollick, Matthias Classen, Jiska Tech Univ Darmstadt Darmstadt Germany Univ Potsdam Hasso Plattner Inst Potsdam Germany

ISBN: (纸本)9781939133434

Complex programs written in memory-unsafe languages tend to contain memory corruption bugs. Adversaries commonly employ code-reuse attacks to exploit these bugs. Control-flow Integrity (CFI) enforcement schemes try to prevent such attacks from achieving arbitrary code execution. Developers can apply these schemes to existing code bases by setting compiler flags, requiring less effort than rewriting code in memory-safe languages. Although many works propose CFI schemes and attacks against them, they paid little attention to schemes deployed to end-users. We provide a systematic categorization and overview of actively used CFI solutions. We then conduct a large-scale binary analysis on 33 Android images of seven vendors and two Windows builds for different hardware architectures to study CFI utilization in practice. We analyzed over 77,000 files on the Android images. We found that depending on the variant, up to 94% of binaries and 93% of libraries are unprotected. All analyzed binaries depend on unprotected libraries, therefore rendering CFI enforcement ineffective. Further, we look at the development of CFI coverage over time on Android and find it stagnating. CFI roll-out is closer to complete on the Windows builds, but not all files are protected yet (2.63% unprotected). Consequently, our results show that the adoption of CFI protection is lacking, putting devices at risk. Additionally, our results highlight a large gap between the state of the art in research and the reality of deployed systems.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

MonoNN: Enabling a New Monolithic Optimization Space for Neural Network Inference Tasks on Modern GPU-Centric Architectures 18

MonoNN: Enabling a New Monolithic Optimization Space for Neu...

引用

18th USENIX Symposium on Operating Systems Design and Implementation (OSDI)

作者： Zhuang, Donglin Zheng, Zhen Xia, Haojun Qiu, Xiafei Bai, Junjie Lin, Wei Song, Shuaiwen Leon Univ Sydney Camperdown NSW Australia Alibaba Grp Hangzhou Peoples R China

ISBN: (纸本)9781939133403

In this work, we reveal that the kernel-by-kernel execution scheme in the existing machine learning optimizing compilers is no longer effective in fully utilizing hardware resources provided by the advances of modern GPU architectures. Specifically, such scheme suffers from severe non-computation overhead and off-chip memory traffic, making the optimization efforts from the state-of-the-art compiler techniques greatly attenuated on the newer generations of GPUs. To address this emerging challenge, we propose MonoNN, the first machine learning optimizing compiler that enables a new monolithic design and optimization space for common static neural network (NN) inference tasks on a single GPU. MonoNN can accommodate an entire neural network into a single GPU kernel, drastically reducing non-computation overhead and providing further fine-grained optimization opportunities from the newly formed monolithic optimization space. Most importantly, MonoNN identifies the resource incompatibility issue between various NN operators as the key design bottleneck for creating such a monolithic optimization space. Then MonoNN effectively tackles it by systematically exploring and exploiting the parallelism compensation strategy and resource trade-offs across different types of NN computations, and by proposing a novel schedule-independent group tuning technique to significantly shrink the extremely large tuning space. Finally, MonoNN provides a compiler implementation that incorporates our proposed optimizations and automatically generates highly efficient kernel code. Extensive evaluation on a set of popular production inference tasks demonstrates that MonoNN achieves an average speedup of 2.01x over the state-of-the-art frameworks and compilers. Specifically, MonoNN outperforms TVM, TensorRT, XLA, and AStitch by up to 7.3x, 5.9x, 1.7x and 2.9x in terms of end-to-end inference performance, respectively. MonoNN source code is publicly available at https://***/AlibabaResearch/

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

Secure Synthesis of Distributed Cryptographic Applications 37

Secure Synthesis of Distributed Cryptographic Applications

引用

37th IEEE Computer Security Foundations Symposium (CSF)

作者： Acay, Cosku Gancher, Joshua Recto, Rolph Myers, Andrew C. Cornell Univ Ithaca NY 14850 USA Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9798350362046;9798350362039

Developing secure distributed systems is difficult, and even harder when advanced cryptography must be used to achieve security goals. Following prior work, we advocate using secure program partitioning to synthesize cryptographic applications: instead of implementing a system of communicating processes, the programmer implements a centralized, sequential program, which is automatically compiled into a secure distributed version that uses cryptography. While this approach is promising, formal results for the security of such compilers are limited in scope. In particular, no security proof yet simultaneously addresses subtleties essential for robust, efficient applications: multiple cryptographic mechanisms, malicious corruption, and asynchronous communication. In this work, we develop a compiler security proof that handles these subtleties. Our proof relies on a novel unification of simulation-based security, information-flow control, choreographic programming, and sequentialization techniques for concurrent programs. While our proof targets hybrid protocols, which abstract cryptographic mechanisms as idealized functionalities, our approach offers a clear path toward leveraging Universal Composability to obtain end-to-end, modular security results with fully instantiated cryptographic mechanisms. Finally, following prior observations about simulation-based security, we prove that our result guarantees robust hyperproperty preservation, an important criterion for compiler correctness that preserves all source-level security properties in target programs.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

StepCoder: Improving Code Generation with Reinforcement Learning from Compiler Feedback 62

StepCoder: Improving Code Generation with Reinforcement Lear...

引用

62nd Annual Meeting of the Association-for-Computational-Linguistics (ACL) / Student Research Workshop (SRW)

作者： Dou, Shihan Liu, Yan Jia, Haoxiang Zhou, Enyu Xiong, Limao Shan, Junjie Huang, Caishuang Wang, Xiao Fan, Xiaoran Xi, Zhiheng Zhou, Yuhao Ji, Tao Zheng, Rui Zhang, Qi Gui, Tao Huang, Xuanjing Fudan Univ Sch Comp Sci Shanghai Peoples R China Huazhong Univ Sci & Technol Wuhan Peoples R China KTH Royal Inst Technol Stockholm Sweden Fudan Univ Inst Modern Languages & Linguist Shanghai Peoples R China Shanghai Collaborat Innovat Ctr Intelligent Visua Shanghai Peoples R China

ISBN: (纸本)9798891760943

The advancement of large language models (LLMs) has significantly propelled the field of code generation. Previous work integrated reinforcement learning (RL) with compiler feedback for exploring the output space of LLMs to enhance code generation quality. However, the lengthy code generated by LLMs in response to complex human requirements makes RL exploration a challenge. Also, since the unit tests may not cover the complicated code, optimizing LLMs by using these unexecuted code snippets is ineffective. To tackle these challenges, we introduce StepCoder, a novel RL framework for code generation, consisting of two main components: CCCS addresses the exploration challenge by breaking the long sequences code generation task into a Curriculum of Code Completion Subtasks, while FGO only optimizes the model by masking the unexecuted code segments to provide Fine-Grained Optimization. In addition, we furthermore construct the APPS+ dataset for RL training, which is manually verified to ensure the correctness of unit tests. Experimental results show that our method improves the ability to explore the output space and outperforms state-of-the-art approaches in corresponding benchmarks(1).

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

Divide and Surrender: Exploiting Variable Division Instruction Timing in HQC Key Recovery Attacks 33

Divide and Surrender: Exploiting Variable Division Instructi...

引用

33rd USENIX Security Symposium

作者： Schroeder, Robin Leander Gast, Stefan Guo, Qian Fraunhofer SIT Darmstadt Germany Fraunhofer Austria Vienna Austria Graz Univ Technol Graz Austria Lund Univ Lund Sweden

ISBN: (纸本)9781939133441

We uncover a critical side-channel vulnerability in the Hamming Quasi-Cyclic (HQC) round 4 optimized implementation arising due to the use of the modulo operator. In some cases, compilers optimize uses of the modulo operator with compiletime known divisors into constant-time Barrett reductions. However, this optimization is not guaranteed: for example, when a modulo operation is used in a loop the compiler may emit division (div) instructions which have variable execution time depending on the numerator. When the numerator depends on secret data, this may yield a timing side-channel. We name vulnerabilities of this kind Divide and Surrender (DaS) vulnerabilities. For processors supporting Simultaneous Multithreading (SMT) we propose a new approach called DIV-SMT which enables precisely measuring small division timing variations using scheduler and/or execution unit contention. We show that using only 100 such side-channel traces we can build a Plaintext-Checking (PC) oracle with above 90% accuracy. Our approach might also prove applicable to other instances of the DaS vulnerability, such as KyberSlash. We stress that exploitation with DIV-SMT requires co-location of the attacker on the same physical core as the victim. We then apply our methodology to HQC and present a novel way to recover HQC secret keys faster, achieving an 8fold decrease in the number of idealized oracle queries when compared to previous approaches. Our new PC oracle attack uses our newly developed Zero Tester method to quickly determine whether an entire block of bits contains only zero-bits. The Zero Tester method enables the DIV-SMT powered attack on HQC-128 to complete in under 2 minutes on our targeted AMD Zen2 machine.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

PFHaD: Page Fault Handler Assisted Defense Against Data-Oriented Attacks 3rd

PFHaD: Page Fault Handler Assisted Defense Against Data-Orie...

引用

3rd International Conference on Advances in Computing Research, ACR 2025

作者： Zhang, Tianning Huang, Hao School of Computer Jiangsu University of Science and Technology Zhenjiang China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9783031876462

As memory corruption vulnerabilities evolve, attackers have shifted focus from traditional control-flow attacks to non-control data attacks, which manipulate data influencing a program′s behavior without altering its control flow. This shift bypasses conventional defenses like Control Flow Integrity (CFI), posing new security risks. In response, we propose a novel defense mechanism called Page Fault Handler-assisted Defense (PFHaD). PFHaD leverages hardware page faults to protect critical data in memory, providing robust defense against non-control data attacks with minimal performance overhead. Unlike traditional defenses, PFHaD also prevents information leakage by making critical data pages inaccessible. The solution does not require modifications to hardware, compilers, or operating systems, making it ideal for commercial-off-the-shelf (COTS) software. Experimental results demonstrate that PFHaD effectively mitigates a wide range of non-control data attacks while maintaining low performance impact, offering a scalable and efficient solution to modern memory corruption threats. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： program compilers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共274页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：