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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,080 篇 会议
132 篇 期刊文献

馆藏范围

1,212 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,046 篇 工学
- 982 篇 软件工程
- 752 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 42 篇 电气工程
- 32 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 土木工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 冶金工程
- 2 篇 农业工程
126 篇 理学
- 106 篇 数学
- 12 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 物理学
- 5 篇 生物学
- 4 篇 化学
81 篇 管理学
- 48 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 26 篇 工商管理
12 篇 教育学
- 12 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
100 篇 computer program...
96 篇 performance
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
39 篇 verification
35 篇 java programming...
34 篇 reliability
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
17 篇 compilers
17 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
8 篇 sarkar vivek
7 篇 august david i.
7 篇 bacon david f.
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav

语言

1,134 篇 英文
77 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation"

共 1212 条记录，以下是71-80 订阅

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

详细简洁

排序：

RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types 2021

RefinedC: Automating the Foundational Verification of C Code...

引用

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

作者： Sammler, Michael Lepigre, Rodolphe Krebbers, Robbert Memarian, Kayvan Dreyer, Derek Garg, Deepak MPI SWS Saarbrucken Germany Radboud Univ Nijmegen Nijmegen Netherlands Univ Cambridge Cambridge England

ISBN: (纸本)9781450383912

Given the central role that C continues to play in systems software, and the difficulty of writing safe and correct C code, it remains a grand challenge to develop effective formal methods for verifying C programs. In this paper, we propose a new approach to this problem: a type system we call RefinedC, which combines ownership types (for modular reasoning about shared state and concurrency) with refinement types (for encoding precise invariants on C data types and Hoare-style specifications for C functions). RefinedC is both automated (requiring minimal user intervention) and foundational (producing a proof of program correctness in Coq), while at the same time handling a range of low-level programming idioms such as pointer arithmetic. In particular, following the approach of RustBelt, the soundness of the RefinedC type system is justified semantically by interpretation into the Coq-based Iris framework for higherorder concurrent separation logic. However, the typing rules of RefinedC are also designed to be encodable in a new "separation logic programmingz language we call Lithium. By restricting to a carefully chosen (yet expressive) fragment of separation logic, Lithium supports predictable, automatic, goal-directed proof search without backtracking. We demonstrate the effectiveness of RefinedC on a range of representative examples of C code.

关键词： C programming language separation logic ownership types refinement types proof automation Iris Coq

来源：评论

学校读者我要写书评

暂无评论

Improving on the Experience of Hand-Assembling Programs for Application-Specific Architectures 21

Improving on the Experience of Hand-Assembling Programs for ...

引用

5th International conference on the Art, Science, and Engineering of programming (programming)

作者： Piumarta, Ian Kyoto Univ Adv Sci Kyoto Japan

ISBN: (纸本)9781450389860

Creating an application-specific processor is an effective and popular way to solve many problems in embedded hardware design using FPGAs, ASICs, or custom silicon. programming these processors is complicated by the lack of toolchain support for creating the necessary binary code as part of hardware design, implementation, and evaluation. Hardware developers who cannot create their own ad-hoc assembler are left to hand-assemble their code into binary instructions which is both painful and error prone. We present a tool that supports the rapid creation of assemblers for application-specific processors. A single language is used to specify both instruction formats as collections of bit fields and the instantiation of those formats into sequences of binary instructions as a single, homogeneous activity that is designed to be as familiar and accessible to hardware designers as possible. The output from the tool can be used directly by hardware synthesis tools to initialise the program memory of an application-specific processor.

关键词： domain specific languages macro languages micro assemblers microcode embedded programming application specific processor implementation FPGA configuration memory

来源：评论

学校读者我要写书评

暂无评论

PM4VR: A Scriptable Parametric Modeling Interface for Conceptual Architecture design in VR 18

PM4VR: A Scriptable Parametric Modeling Interface for Concep...

引用

18th acm SIGGRAPH International conference on Virtual-Reality Continuum and its Applications in Industry, VRCAI 2022

作者： Li, Wanwan University of South Florida TampaFL United States

ISBN: (纸本)9798400700316

In this paper, we propose PM4VR, a novel scriptable parametric modeling interface for the Unity3D game engine which can be applied to VR-driven parametric modeling designs. By simplifying prevailing advanced programming languages such as C# and Java, we propose another programming language, named Java, to simplify the grammar and lower the programmer's learning curve. By implementing a series of advanced parametric modeling techniques, we integrate our Java compiler virtual machine with those functionalities which can facilitate interactive parametric modeling design process on the Unity3D game engine within immersive SteamVR environments. More specifically, in this paper, we introduce the Java programming language, explain the implementation details of Java compiler virtual machine, and discuss the experimental results of the interactive parametric modeling on conceptual architecture designs using PM4VR. Besides, a Supplementary Material with Java programming examples is included. © 2022 acm.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Data Structure Refinements from Integrity Constraints 2021

Synthesizing Data Structure Refinements from Integrity Const...

引用

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

作者： Pailoor, Shankara Wang, Yuepeng Wang, Xinyu Dillig, Isil Univ Texas Austin Austin TX 78712 USA Univ Penn Philadelphia PA 19104 USA Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781450383912

implementations of many data structures use several correlated fields to improve their performance;however, inconsistencies between these fields can be a source of serious program errors. To address this problem, we propose a new technique for automatically refining data structures from integrity constraints. In particular, consider a data structure D with fields F and methods M, as well as a new set of auxiliary fields F' that should be added to D. Given this input and an integrity constraint Phi relating F and F', our method automatically generates a refinement of.. that satisfies the provided integrity constraint. Our method is based on a modular instantiation of the CEGIS paradigm and uses a novel inductive synthesizer that augments top-down search with three key ideas. First, it computes necessary preconditions of partial programs to dramatically prune its search space. Second, it augments the grammar with promising new productions by leveraging the computed preconditions. Third, it guides top-down search using a probabilistic context-free grammar obtained by statically analyzing the integrity checking function and the original code base. We evaluated our method on 25 data structures from popular Java projects and show that our method can successfully refine 23 of them. We also compare our method against two state-of-the-art synthesis tools and perform an ablation study to justify our design choices. Our evaluation shows that (1) our method is successful at refining many data structure implementations in the wild, (2) it advances the state-of-the-art in synthesis, and (3) our proposed ideas are crucial for making this technique practical.

关键词： programming languages Program Synthesis Data structure refinement

来源：评论

学校读者我要写书评

暂无评论

HACCLE: Metaprogramming for Secure Multi-Party Computation 2021

HACCLE: Metaprogramming for Secure Multi-Party Computation

引用

20th acm sigplan International conference on Generative programming: Concepts and Experiences (GPCE)

作者： Bao, Yuyan Sundararajah, Kirshanthan Malik, Raghav Ye, Qianchuan Wagner, Christopher Jaber, Nouraldin Wang, Fei Ameri, Mohammad Hassan Lu, Donghang Seto, Alexander Delaware, Benjamin Samanta, Roopsha Kate, Aniket Garman, Christina Blocki, Jeremiah Letourneau, Pierre-David Meister, Benoit Springer, Jonathan Rompf, Tiark Kulkarni, Milind Univ Waterloo Waterloo ON Canada Purdue Univ W Lafayette IN 47907 USA Reservoir Labs New York NY USA

ISBN: (纸本)9781450391122

Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An important class of such cryptographic techniques is known as Secure Multi-Party Computation (MPC). Developing Secure MPC applications in realistic scenarios requires extensive knowledge spanning multiple areas of cryptography and systems. And while the steps to arrive at a solution for a particular application are often straightforward, it remains difficult to make the implementation efficient, and tedious to apply those same steps to a slightly different application from scratch. Hence, it is an important problem to design platforms for implementing Secure MPC applications with minimum effort and using techniques accessible to non-experts in cryptography. In this paper, we present the HACCLE (High Assurance Compositional Cryptography: languages and Environments) toolchain, specifically targeted to MPC applications. HACCLE contains an embedded domain-specific language Harpoon, for software developers without cryptographic expertise to write MPC-based programs, and uses Lightweight Modular Staging (LMS) for code generation. Harpoon programs are compiled into acyclic circuits represented in HACCLE's Intermediate Representation (HIR) that serves as an abstraction over different cryptographic protocols such as secret sharing, homomorphic encryption, or garbled circuits. implementations of different cryptographic protocols serve as different backends of our toolchain. The extensible design of HIR allows cryptographic experts to plug in new primitives and protocols to realize computation. And the use of standard metaprogramming techniques lowers the development effort significantly. We have implemented Harpoon and HACCLE, and used them to program interesting applications (e.g., secure auction) and key computation components of Secure MPC applications (e.g., matrix-vector multiplication and merg

关键词： metaprogramming domain-specific language secure multi-party computation

来源：评论

学校读者我要写书评

暂无评论

***: (A)Synchronous Reactive Web programming 2020

***: (A)Synchronous Reactive Web Programming

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Berry, Gerard Serrano, Manuel Coll France Paris France UCA INRIA Sophia Antipolis France

ISBN: (纸本)9781450376136

We present ***, a synchronous reactive language that adds synchronous concurrency and preemption to JavaScript. Inspired from Esterel, *** simplifies the programming of non-trivial temporal behaviors as found in complex web interfaces or IoT controllers and the cooperation between synchronous and asynchronous activities. *** is compiled into plain sequential JavaScript and executes on unmodified runtime environments. We use three examples to present and discuss ***: a simple web login form to introduce the language and show how it differs from JavaScript, and two real life examples, a medical prescription pillbox and an interactive music system that show why concurrency and preemption help programming such temporal applications.

关键词： Reactive programming Synchronous programming Web programming JavaScript

来源：评论

学校读者我要写书评

暂无评论

DynEx: Dynamic Code Synthesis with Structured design Exploration for Accelerated Exploratory programming 25

DynEx: Dynamic Code Synthesis with Structured Design Explora...

引用

proceedings of the 2025 CHI conference on Human Factors in Computing Systems

作者： Jenny GuangZhen Ma Karthik Sreedhar Vivian Liu Pedro A. Perez Sitong Wang Riya Sahni Lydia B Chilton Computer Science Department Columbia University New York New York USA Columbia University New York New York USA Columbia University New York City New York USA

ISBN: (纸本)9798400713941

Recent advancements in large language models have significantly expedited the process of generating front-end code. This allows users to rapidly prototype user interfaces and ideate through code, a process known as exploratory programming. However, existing LLM code generation tools focus more on technical implementation details rather than finding the right design given a particular problem. We present DynEx, an LLM-based method for design exploration in accelerated exploratory programming. DynEx introduces a technique to explore the design space through a structured design Matrix before creating the prototype with a modular, stepwise approach to LLM code generation. Code is generated sequentially, and users can test and approve each step before moving onto the next. A user study of 10 experts found that DynEx increased design exploration and enabled the creation of more complex and varied prototypes compared to a Claude Artifact baseline. We conclude with a discussion of the implications of design exploration for exploratory programming. © 2025 Copyright held by the owner/author(s). Publication rights licensed to acm.

关键词： code synthesis

来源：评论

学校读者我要写书评

暂无评论

λPSI: Exact Inference for Higher-Order Probabilistic Programs 2020

λPSI: Exact Inference for Higher-Order Probabilistic Progra...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Gehr, Timon Steffen, Samuel Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

We present lambda PSI, the first probabilistic programming language and system that supports higher-order exact inference for probabilistic programs with first-class functions, nested inference and discrete, continuous and mixed random variables. lambda PSI's solver is based on symbolic reasoning and computes the exact distribution represented by a program. We show that lambda PSI is practically effective-it automatically computes exact distributions for a number of interesting applications, from rational agents to information theory, many of which could so far only be handled approximately.

关键词： Probabilistic programming Exact Higher-order

来源：评论

学校读者我要写书评

暂无评论

Silq: A High-Level Quantum language with Safe Uncomputation and Intuitive Semantics 2020

Silq: A High-Level Quantum Language with Safe Uncomputation ...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Bichsel, Benjamin Baader, Maximilian Gehr, Timon Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.

关键词： Quantum language Uncomputation Semantics

来源：评论

学校读者我要写书评

暂无评论

The Essence of Bluespec A Core language for Rule-Based Hardware design 2020

The Essence of Bluespec A Core Language for Rule-Based Hardw...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Bourgeat, Thomas Pit-Claudel, Clement Chlipala, Adam Arvind MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450376136

The Bluespec hardware-description language presents a significantly higher-level view than hardware engineers are used to, exposing a simpler concurrency model that promotes formal proof, without compromising on performance of compiled circuits. Unfortunately, the cost model of Bluespec has been unclear, with performance details depending on a mix of user hints and opaque static analysis of potential concurrency conflicts within a design. In this paper we present Koika, a derivative of Bluespec that preserves its desirable properties and yet gives direct control over the scheduling decisions that determine performance. Koika has a novel and deterministic operational semantics that uses dynamic analysis to avoid concurrency anomalies. Our implementation includes Coq definitions of syntax, semantics, key metatheorems, and a verified compiler to circuits. We argue that most of the extra circuitry required for dynamic analysis can be eliminated by compile-time BSV-style static analysis.

关键词： HDL Semantics Compiler Correctness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共122页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：