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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,112 篇 工学
- 1,037 篇 软件工程
- 800 篇 计算机科学与技术...
- 48 篇 控制科学与工程
- 43 篇 电气工程
- 36 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 5 篇 生物工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 农业工程
141 篇 理学
- 117 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 物理学
- 4 篇 化学
89 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 28 篇 工商管理
15 篇 教育学
- 15 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

180 篇 design
167 篇 languages
103 篇 computer program...
99 篇 performance
59 篇 algorithms
49 篇 object oriented ...
49 篇 computer program...
45 篇 experimentation
45 篇 java programming...
39 篇 verification
35 篇 reliability
34 篇 java
32 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 software design
21 篇 theory
20 篇 concurrency
19 篇 domain-specific ...
18 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
12 篇 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 篇 microsoft res re...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
9 篇 microsoft resear...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...

作者

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

语言

1,204 篇 英文
82 篇 其他
1 篇 中文

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

共 1287 条记录，以下是141-150 订阅

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

详细简洁

排序：

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Polyglot programming 16

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Po...

引用

16th acm sigplan International conference on Managed programming languages and Runtimes (MPLR)

作者： Niephaus, Fabio Felgentreff, Tim Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Oracle Labs Potsdam Germany

ISBN: (纸本)9781450369770

Polyglot programming provides software developers with a broader choice in terms of software libraries and frameworks available for building applications. Previous research and engineering activities have focused on language interoperability and the design and implementation of fast polyglot runtimes. To make polyglot programming more approachable for developers, novel software development tools are needed that help them build polyglot applications. We believe a suitable prototyping platform helps to more quickly evaluate new ideas for such tools. In this paper we present GraalSqueak, a Squeak/Smalltalk virtual machine implementation for the GraalVM. We report our experience implementing GraalSqueak, evaluate the performance of the language and the programming environment, and discuss how the system can be used as a tooling platform for polyglot programming.

关键词： Squeak/Smalltalk virtual machines Truffle GraalVM polyglot programming tools live development

来源：评论

学校读者我要写书评

暂无评论

design and implementation of the uw illustrated compiler 88

Design and implementation of the uw illustrated compiler

引用

acm sigplan conference on programming language design and implementation, PLDI 1988

作者： Andrew, Kristy Henry, Robert R. Yamamoto, Wayne K. Computer Science Department FR-35 University of Washington SeattleWA98195 United States Computers MS ICO 05 CupminoCA95014 United States AT and T Bell Laboratories IHP2FS.40 ZLM Park Plaza NapervilleIL60566-7050 United States

ISBN: (纸本)0897912691

We have implemented an illustrated compiIer for a simple block structured language. The compiler graphically displays its control and data structures, and so gives its viewers an intuitive understanding of compiler organization and operation. The illustrations were planned by hand and display information naturally and concisely. © 1988 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Probabilistic programming with Programmable Inference 2018

Probabilistic Programming with Programmable Inference

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Mansinghka, Vikash K. Schaechtle, Ulrich Handa, Shivam Radul, Alexey Chen, Yutian Rinard, Martin MIT Cambridge MA 02139 USA Google DeepMind London England

ISBN: (纸本)9781450356985

We introduce inference metaprogramming for probabilistic programming languages, including new language constructs, a formalism, and the first demonstration of effectiveness in practice. Instead of relying on rigid black-box inference algorithms hard-coded into the language implementation as in previous probabilistic programming languages, inference metaprogramming enables developers to 1) dynamically decompose inference problems into subproblems, 2) apply inference tactics to subproblems, 3) alternate between incorporating new data and performing inference over existing data, and 4) explore multiple execution traces of the probabilistic program at once. Implemented tactics include gradient-based optimization, Markov chain Monte Carlo, variational inference, and sequental Monte Carlo techniques. Inference metaprogramming enables the concise expression of probabilistic models and inference algorithms across diverse fields, such as computer vision, data science, and robotics, within a single probabilistic programming language.

关键词： Probabilistic programming Semantics Inference

来源：评论

学校读者我要写书评

暂无评论

Temporal NetKAT 16

Temporal NetKAT

引用

37th acm sigplan conference on programming language design and implementation

作者： Beckett, Ryan Greenberg, Michael Walker, David Princeton Univ Princeton NJ 08544 USA Pomona Coll Claremont CA 91711 USA

ISBN: (纸本)9781450342612

Over the past 5-10 years, the rise of software-defined networking (SDN) has inspired a wide range of new systems, libraries, hypervisors and languages for programming, monitoring, and debugging network behavior. Oftentimes, these systems are disjoint-one language for programming and another for verification, and yet another for run-time monitoring and debugging. In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. As its name suggests, Temporal NetKAT is the synthesis of two formal theories: past-time (finite trace) linear temporal logic and (network) Kleene Algebra with Tests. Temporal predicates allow programmers to write down concise properties of a packet's path through the network and to make dynamic packet-forwarding, access control or debugging decisions on that basis. In addition to being useful for programming, the combined equational theory of LTL and NetKAT facilitates proofs of pathbased correctness properties. Using new, general, proof techniques, we show that the equational semantics is sound with respect to the denotational semantics, and, for a class of programs we call network-wide programs, complete. We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations.

关键词： Software-defined networking Network programming languages Domain-specific languages Kleene algebra with tests NetKAT Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Achieving High Coverage for Floating-Point Code via Unconstrained programming 2017

Achieving High Coverage for Floating-Point Code via Unconstr...

引用

38th acm sigplan conference on programming language design and implementation (PLDI)

作者： Fu, Zhoulai Su, Zhendong Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781450349888

Achieving high code coverage is essential in testing, which gives us confidence in code quality. Testing floating-point code usually requires painstaking efforts in handling floating-point constraints, e.g., in symbolic execution. This paper turns the challenge of testing floating-point code into the opportunity of applying unconstrained programming-the mathematical solution for calculating function minimum points over the entire search space. Our core insight is to derive a representing function from the floating-point program, any of whose minimum points is a test input guaranteed to exercise a new branch of the tested program. This guarantee allows us to achieve high coverage of the floating-point program by repeatedly minimizing the representing function. We have realized this approach in a tool called CoverMe and conducted an extensive evaluation of it on Sun's C math library. Our evaluation results show that CoverMe achieves, on average, 90.8% branch coverage in 6.9 seconds, drastically outperforming our compared tools: (1) Random testing, (2) AFL, a highly optimized, robust fuzzer released by Google, and (3) Austin, a state-of-the-art coverage-based testing tool designed to support floating-point code.

关键词： Unconstrained programming Representing Function CoverMe

来源：评论

学校读者我要写书评

暂无评论

Efficient and precise datarace detection for multithreaded object-oriented programs

Efficient and precise datarace detection for multithreaded o...

引用

conference on programming language design and implementation (PLDI 02)

作者： Choi, JD Lee, KW Loginov, A O'Callahan, R Sarkar, V Sridharan, M IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Washington Seattle WA 98195 USA Univ Wisconsin Madison WI 53706 USA MIT Cambridge MA 02139 USA

We present a novel approach to dynamic datarace detection for multithreaded object-oriented programs. Past techniques for on-the-fly datarace detection either sacrificed precision for performance, leading to many false positive datarace reports, or maintained precision but incurred significant overheads in the range of 3x to 30x. In contrast, our approach results in very few false positives and runtime overhead in the 13% to 42% range, making it both efficient and precise. This performance improvement is the result of a unique combination of complementary static and dynamic optimization techniques.

关键词： experimentation languages measurement performance dataraces race conditions debugging parallel programs synchronization multithreaded programming object-oriented programming static-dynamic co-analysis

来源：评论

学校读者我要写书评

暂无评论

Type-preserving Compilation for End-to-end Verification of Security Enforcement

Type-preserving Compilation for End-to-end Verification of S...

引用

acm sigplan conference on programming language design and implementation

作者： Chen, Juan Chugh, Ravi Swamy, Nikhil Microsoft Research United States University of California San Diego United States

ISBN: (纸本)9781450300193

A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in these languages are compiled without explicit security proofs, limiting their utility in settings where proofs are necessary, e.g., proof-carrying authorization. Others languages do include explicit proofs, but these are generally lambda calculi not intended for source programming, that must be further compiled to an executable form. A language suitable for source programming backed by a compiler that enables end-to-end verification is missing. In this paper, we present a type-preserving compiler that translates programs written in FINE, a source-level functional language with dependent refinements and affine types, to DCIL, a new extension of the .NET Common Intermediate language. FINE is type checked using an external SMT solver to reduce the proof burden on source programmers. We extract explicit LCF-style proof terms from the solver and carry these proof terms in the compilation to DCIL, thereby removing the solver from the trusted computing base. Explicit proofs enable DCIL to be used in a number of important scenarios, including the verification of mobile code, proof-carrying authorization, and evidence-based auditing. We report on our experience using FINE to build reference monitors for several applications, ranging from a plugin-based email client to a conference management server.

关键词： Security type systems dependent types bytecode languages functional programming authorization information flow mobile code security compilers

来源：评论

学校读者我要写书评

暂无评论

A provably sound TAL for back-end optimization 03

引用

conference on programming language design and implementation

作者： Chen, J Wu, DH Appel, AW Fang, H Princeton Univ Princeton NJ 08544 USA Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781581136623

Typed assembly languages provide a way to generate machine-checkable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed and implemented a low-level typed assembly language (LTAL) with a semantic model and established its soundness from the model. Compared to existing typed assembly languages, LTAL is more scalable and more secure;it has no macro instructions that hinder low-level optimizations such as instruction scheduling;its type constructors are expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code;and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.

关键词： languages verification typed assembly language proof-carrying code

来源：评论

学校读者我要写书评

暂无评论

Asynchronous exceptions in Haskell 01

Asynchronous exceptions in Haskell

引用

acm sigplan'01 conference on programming language design and implementation (PLDI)

作者： Marlow, S. Peyton Jones, S. Moran, A. Reppy, J. Microsoft Research Cambridge MA United States

ISBN: (纸本)9781581134148

Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely difficult to program with - so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.

关键词： Modula (programming language)

来源：评论

学校读者我要写书评

暂无评论

Generational stack collection and profile-driven pretenuring

Generational stack collection and profile-driven pretenuring

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Cheng, Perry Harper, Robert Lee, Peter Carnegie Mellon Univ Pittsburgh United States

Two techniques for improving garbage collection were presented, namely, generational stack collection and profile-driven pretenuring. The first is applicable to stack based implementations of functional languages while the second is useful for any generational collector. Both techniques were implemented in a generational collector used by the TIL compiler and have observed decreases in garbage collection times of as much as 70% and 30%, respectively.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：