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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

71 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

59 篇 工学
- 57 篇 软件工程
- 48 篇 计算机科学与技术...
- 4 篇 控制科学与工程
- 3 篇 信息与通信工程
- 1 篇 光学工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 纺织科学与工程
- 1 篇 生物工程
- 1 篇 安全科学与工程
11 篇 理学
- 8 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 5 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

5 篇 design
3 篇 program synthesi...
3 篇 languages
3 篇 probabilistic pr...
3 篇 software design
3 篇 java programming...
3 篇 programming by e...
3 篇 programming lang...
2 篇 object oriented ...
2 篇 experimentation
2 篇 performance
2 篇 compilers
2 篇 modules
2 篇 intel ixa
2 篇 parallel program...
2 篇 java
2 篇 register allocat...
2 篇 bank assignment
2 篇 composition
2 篇 end-user program...

机构

3 篇 univ michigan an...
3 篇 carnegie mellon ...
3 篇 univ penn philad...
2 篇 university of to...
2 篇 kyushu institute...
2 篇 kyushu universit...
2 篇 univ chicago il ...
2 篇 univ calif santa...
2 篇 univ texas austi...
1 篇 programming tool...
1 篇 google ca united...
1 篇 univ wisconsin d...
1 篇 univ southern ca...
1 篇 mpi sws saarbruc...
1 篇 univ wisconsin m...
1 篇 radboud univ nij...
1 篇 network speed te...
1 篇 institute for co...
1 篇 university of ma...
1 篇 university of tw...

作者

2 篇 wang xinyu
2 篇 sherwood timothy
2 篇 fursin grigori
2 篇 chong frederic t...
2 篇 alur rajeev
2 篇 hardekopf ben
2 篇 dillig isil
1 篇 milano matthew
1 篇 blinn andrew
1 篇 tao runzhou
1 篇 kashyap vineeth
1 篇 pailoor shankara
1 篇 campagna giovann...
1 篇 fedorova alexand...
1 篇 collins nick
1 篇 sewe andreas
1 篇 lerner sorin
1 篇 best micah j.
1 篇 f.r.m. barnes
1 篇 ekman torbjorn

语言

71 篇 英文

检索条件"任意字段=Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 71 条记录，以下是1-10 订阅

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

详细简洁

排序：

PLDI 2021 - proceedings of the 42nd acm sigplan International conference on programming language design and implementation

PLDI 2021 - Proceedings of the 42nd ACM SIGPLAN Internationa...

引用

42nd acm sigplan International conference on programming language design and implementation, PLDI 2021

ISBN: (纸本)9781450383912

The proceedings contain 87 papers. The topics discussed include: incremental whole-program analysis in datalog with lattices;revamping hardware persistency models: view-based and axiomatic persistency models for intel-x86 and armv8;repairing serializability bugs in distributed database programs via automated schema refactoring;Gleipnir: toward practical error analysis for quantum programs;transfinite iris: resolving an existential dilemma of step-indexed separation logic;Perceus: garbage free reference counting with reuse;unleashing the hidden power of compiler optimization on binary code difference: an empirical study;RefinedC: automating the foundational verification of C code with refined ownership types;and wire sorts: a language abstraction for safe hardware composition.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2024 32nd IEEE/acm International conference on Program Comprehension, ICPC 2024

Proceedings - 2024 32nd IEEE/ACM International Conference on...

引用

32nd IEEE/acm International conference on Program Comprehension, ICPC 2024

ISBN: (纸本)9798400705861

The proceedings contain 46 papers. The topics discussed include: exploring and improving code completion for test code;on the generalizability of deep learning-based code completion across programming language versions;ESGen: commit message generation based on edit sequence of code change;capturing and understanding the drift between design, implementation, and documentation;towards summarizing code snippets using pre-trained transformers;improving AST-level code completion with graph retrieval and multi-field attention;HyperCRX: a browser extension for insights into GitHub projects and developers;innovating coding: evaluating the impact of innovative thinking in programming;and MESIA: understanding and leveraging supplementary nature of method-level comments for automatic comment generation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A pred-LL(*) Parsable Typed Higher-Order Macro System for Architecture Description languages 2023

A pred-LL(*) Parsable Typed Higher-Order Macro System for Ar...

引用

22nd acm sigplan International conference on Generative programming - Concepts and Experiences (GPCE)

作者： Hochrainer, Christoph Krall, Andreas TU Wien Vienna Austria

ISBN: (纸本)9798400704062

Macro systems are powerful language extension tools for Architecture Description languages (ADLs). Their generative power in combination with the simplicity of specification languages allows for a substantial reduction of repetitive specification sections. This paper explores how the introduction of function- and record types in a template-based macro system impacts the specification of ADLs. We present design and implementation of a pattern-based syntax macro system for the Vienna Architecture Description language (VADL). The macro system is directly integrated into the language and is analyzed at parse time using a context-sensitive predLL(*) parser. The usefulness of the macro system is illustrated by some typical macro application design patterns. The effectiveness is shown by a detailed evaluation of the Instruction Set Architecture (ISA) specification of five different processor architectures. The observed specification reduction can be up to 90 times, leading to improved maintainability, readability and runtime performance of the specifications.

关键词： macro system higher-order macros pattern-based generative programming architecture description language

来源：评论

学校读者我要写书评

暂无评论

Compiling Stan to Generative Probabilistic languages and Extension to Deep Probabilistic programming 2021

Compiling Stan to Generative Probabilistic Languages and Ext...

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Baudart, Guillaume Burroni, Javier Hirzel, Martin Mandel, Louis Shinnar, Avraham PSL Univ Ecole Normale Super INRIA Paris Paris France UMass Amherst Amherst MA USA IBM Res MIT IBM Watson AI Lab Armonk NY USA

ISBN: (纸本)9781450383912

Stan is a probabilistic programming language that is popular in the statistics community, with a high-level syntax for expressing probabilistic models. Stan differs by nature from generative probabilistic programming languages like Church, Anglican, or Pyro. This paper presents a comprehensive compilation scheme to compile any Stan model to a generative language and proves its correctness. We use our compilation scheme to build two new backends for the Stanc3 compiler targeting Pyro and NumPyro. Experimental results show that the NumPyro backend yields a 2.3x speedup compared to Stan in geometric mean over 26 benchmarks. Building on Pyro we extend Stan with support for explicit variational inference guides and deep probabilistic models. That way, users familiar with Stan get access to new features without having to learn a fundamentally new language.

关键词： Probabilistic programming Semantics Stan Pyro

来源：评论

学校读者我要写书评

暂无评论

SPPL: Probabilistic programming with Fast Exact Symbolic Inference 2021

SPPL: Probabilistic Programming with Fast Exact Symbolic Inf...

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Saad, Feras A. Rinard, Martin C. Mansinghka, Vikash K. MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450383912

We present the Sum-Product Probabilistic language (SPPL), a new probabilistic programming language that automatically delivers exact solutions to a broad range of probabilistic inference queries. SPPL translates probabilistic programs into sum-product expressions, a new symbolic representation and associated semantic domain that extends standard sum-product networks to support mixed-type distributions, numeric transformations, logical formulas, and pointwise and set-valued constraints. We formalize SPPL via a novel translation strategy from probabilistic programs to sum-product expressions and give sound exact algorithms for conditioning on and computing probabilities of events. SPPL imposes a collection of restrictions on probabilistic programs to ensure they can be translated into sum-product expressions, which allow the system to leverage new techniques for improving the scalability of translation and inference by automatically exploiting probabilistic structure. We implement a prototype of SPPL with a modular architecture and evaluate it on benchmarks the system targets, showing that it obtains up to 3500x speedups over state-of-the-art symbolic systems on tasks such as verifying the fairness of decision tree classifiers, smoothing hidden Markov models, conditioning transformed random variables, and computing rare event probabilities.

关键词： probabilistic programming symbolic execution

来源：评论

学校读者我要写书评

暂无评论

An Efficient Interpreter for Datalog by De-specializing Relations 2021

An Efficient Interpreter for Datalog by De-specializing Rela...

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Hu, Xiaowen Zhao, David Jordan, Herbert Scholz, Bernhard Univ Sydney Sch Comp Sci Sydney NSW Australia Univ Innsbruck Innsbruck Austria

ISBN: (纸本)9781450383912

Datalog is becoming increasingly popular as a standard tool for a variety of use cases. Modern Datalog engines can achieve high performance by specializing data structures for relational operations. For example, the Datalog engine Souffle achieves high performance with a synthesizer that specializes data structures for relations. However, the synthesizer cannot always be deployed, and a fast interpreter is required. This work introduces the design and implementation of the Souffle Tree Interpreter (STI). Key for the performance of the STI is the support for fast operations on relations. We obtain fast operations by de-specializing data structures so that they can work in a virtual execution environment. Our new interpreter achieves a competitive performance slowdown between 1.32 and 5.67x when compared to synthesized code. If compile time overheads of the synthesizer are also considered, the interpreter can be 6.46x faster on average for the first run.

关键词： Interpreter implementation Datalog Engine Static Data Structure

来源：评论

学校读者我要写书评

暂无评论

CompCertO: Compiling Certified Open C Components 2021

CompCertO: Compiling Certified Open C Components

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Koenig, Jeremie Shao, Zhong Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781450383912

Since the introduction of CompCert, researchers have been refining its language semantics and correctness theorem, and used them as components in software verification efforts. Meanwhile, artifacts ranging from CPU designs to network protocols have been successfully verified, and there is interest in making them interoperable to tackle end-to-end verification at an even larger scale. Recent work shows that a synthesis of game semantics, refinement-based methods, and abstraction layers has the potential to serve as a common theory of certified components. Integrating certified compilers to such a theory is a critical goal. However, none of the existing variants of CompCert meets the requirements we have identified for this task. CompCertO extends the correctness theorem of CompCert to characterize compiled program components directly in terms of their interaction with each other. Through a careful and compositional treatment of calling conventions, this is achieved with minimal effort.

关键词： Compositional Compiler Correctness Game Semantics Simulation Convention language Interface

来源：评论

学校读者我要写书评

暂无评论

Example-Guided Synthesis of Relational Queries 2021

Example-Guided Synthesis of Relational Queries

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Thakkar, Aalok Naik, Aaditya Sands, Nathaniel Alur, Rajeev Naik, Mayur Raghothaman, Mukund Univ Penn Philadelphia PA 19104 USA Univ Southern Calif Los Angeles CA 90007 USA

ISBN: (纸本)9781450383912

Program synthesis tasks are commonly specified via input-output examples. Existing enumerative techniques for such tasks are primarily guided by program syntax and only make indirect use of the examples. We identify a class of synthesis algorithms for programming-by-examples, which we call Example-Guided Synthesis (EGS), that exploits latent structure in the provided examples while generating candidate programs. We present an instance of EGS for the synthesis of relational queries and evaluate it on 86 tasks from three application domains: knowledge discovery, program analysis, and database querying. Our evaluation shows that EGS outperforms state-of-the-art synthesizers based on enumerative search, constraint solving, and hybrid techniques in terms of synthesis time, quality of synthesized programs, and ability to prove unrealizability.

关键词： programming by example Example-Guided Synthesis

来源：评论

学校读者我要写书评

暂无评论

Quantum Abstract Interpretation 2021

Quantum Abstract Interpretation

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Yu, Nengkun Palsberg, Jens Univ Technol Sydney CQSI FEIT Sydney NSW Australia Univ Calif Los Angeles UCLA Comp Sci Dept Los Angeles CA USA UCLA Challenge Inst Quantum Computat Los Angeles CA USA

ISBN: (纸本)9781450383912

In quantum computing, the basic unit of information is a qubit. Simulation of a general quantum program takes exponential time in the number of qubits, which makes simulation infeasible beyond 50 qubits on current supercomputers. So, for the understanding of larger programs, we turn to static techniques. In this paper, we present an abstract interpretation of quantum programs and we use it to automatically verify assertions in polynomial time. Our key insight is to let an abstract state be a tuple of projections. For such domains, we present abstraction and concretization functions that form a Galois connection and we use them to define abstract operations. Our experiments on a laptop have verified assertions about the Bernstein-Vazirani, GHZ, and Grover benchmarks with 300 qubits.

关键词： quantum programming scalability abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

Scooter & Sidecar: A Domain-Specific Approach to Writing Secure Database Migrations 2021

Scooter & Sidecar: A Domain-Specific Approach to Writing Sec...

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Renner, John Sanchez-Stern, Alex Brown, Fraser Lerner, Sorin Stefan, Deian Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781450383912

Web applications often handle large amounts of sensitive user data. Modern secure web frameworks protect this data by (1) using declarative languages to specify security policies alongside database schemas and (2) automatically enforcing these policies at runtime. Unfortunately, these frameworks do not handle the very common situation in which the schemas or the policies need to evolve over time-and updates to schemas and policies need to be performed in a carefully coordinated way. Mistakes during schema or policy migrations can unintentionally leak sensitive data or introduce privilege escalation bugs. In this work, we present a domain-specific language (Scooter) for expressing schema and policy migrations, and an associated SMT-based verifier (Sidecar) which ensures that migrations are secure as the application evolves. We describe the design of Scooter and Sidecar and show that our framework can be used to express realistic schemas, policies, and migrations, without giving up on runtime or verification performance.

关键词： database migration verification secure ORM domain-specific language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：