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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

515 篇 会议
52 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

524 篇 工学
- 521 篇 软件工程
- 325 篇 计算机科学与技术...
- 25 篇 控制科学与工程
- 7 篇 信息与通信工程
- 3 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 生物医学工程（可授...
80 篇 理学
- 73 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 地质学
- 1 篇 生物学
36 篇 管理学
- 23 篇 管理科学与工程(可...
- 18 篇 工商管理
- 16 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

87 篇 design
74 篇 languages
66 篇 performance
50 篇 computer program...
38 篇 algorithms
37 篇 computer program...
31 篇 experimentation
24 篇 reliability
24 篇 verification
23 篇 program synthesi...
22 篇 probabilistic pr...
19 篇 java programming...
17 篇 object oriented ...
15 篇 functional progr...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 language
11 篇 measurement
11 篇 programming lang...

机构

12 篇 carnegie mellon ...
9 篇 univ michigan an...
9 篇 univ wisconsin m...
9 篇 princeton univ p...
8 篇 univ penn philad...
8 篇 purdue univ w la...
8 篇 stanford univ st...
8 篇 univ washington ...
8 篇 univ texas austi...
7 篇 mit cambridge ma...
6 篇 microsoft res re...
6 篇 swiss fed inst t...
6 篇 yale univ new ha...
6 篇 harvard univ cam...
6 篇 cornell univ ith...
5 篇 ibm research
5 篇 microsoft resear...
4 篇 carnegie mellon ...
4 篇 microsoft res re...
4 篇 univ calif davis...

作者

7 篇 dillig isil
6 篇 august david i.
6 篇 gulwani sumit
5 篇 grossman dan
5 篇 aiken alex
5 篇 vechev martin
5 篇 bacon david f.
5 篇 su zhendong
5 篇 lam monica s.
5 篇 chlipala adam
5 篇 myers andrew c.
5 篇 walker david
5 篇 mansinghka vikas...
4 篇 mckinley kathryn...
4 篇 wang xinyu
4 篇 nakatani t
4 篇 cheng perry
4 篇 adl-tabatabai al...
4 篇 gehr timon
4 篇 lueh guei-yuan

语言

547 篇 英文
20 篇 其他

检索条件"任意字段=2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 05"

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

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

详细简洁

排序：

CONCURRIT: A Domain Specific language for Reproducing Concurrency Bugs

CONCURRIT: A Domain Specific Language for Reproducing Concur...

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Elmas, Tayfun Burnim, Jacob Necula, George Sen, Koushik Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781450320146

We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of thread schedules to explore in order to find a schedule exhibiting the bug. Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. We implemented CONCURRIT as an embedded DSL in C++, which uses manual or automatic source instrumentation to partially control the scheduling of the software under test. Using CONCURRIT, we were able to write concise tests to reproduce concurrency bugs in a variety of benchmarks, including the Mozilla's Spider-Monkey JavaScript engine, Memcached, Apache's HTTP server, and MySQL.

关键词： Concurrency Errors Domain-Specific languages Software Testing

来源：评论

学校读者我要写书评

暂无评论

Practical Partial Evaluation for High-Performance Dynamic language Runtimes 2017

Practical Partial Evaluation for High-Performance Dynamic La...

引用

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

作者： Wurthinger, Thomas Wimmer, Christian Humer, Christian Woess, Andreas Stadler, Lukas Seaton, Chris Duboscq, Gilles Simon, Doug Grimmer, Matthias Oracle Labs Zurich Switzerland Johannes Kepler Univ Linz Inst Syst Software Linz Austria

ISBN: (纸本)9781450349888

Most high-performance dynamic language virtual machines duplicate language semantics in the interpreter, compiler, and runtime system. This violates the principle to not repeat yourself. In contrast, we define languages solely by writing an interpreter. The interpreter performs specializations, e.g., augments the interpreted program with type information and profiling information. Compiled code is derived automatically using partial evaluation while incorporating these specializations. This makes partial evaluation practical in the context of dynamic languages: It reduces the size of the compiled code while still compiling all parts of an operation that are relevant for a particular program. When a speculation fails, execution transfers back to the interpreter, the program re-specializes in the interpreter, and later partial evaluation again transforms the new state of the interpreter to compiled code. We evaluate our approach by comparing our implementations of JavaScript, Ruby, and R with best-inclass specialized production implementations. Our general-purpose compilation system is competitive with production systems even when they have been heavily optimized for the one language they support. For our set of benchmarks, our speedup relative to the V8 JavaScript VM is 0.83x, relative to JRuby is 3.8x, and relative to GNU R is 5x.

关键词： dynamic languages virtual machine language implementation optimization partial evaluation

来源：评论

学校读者我要写书评

暂无评论

Quipper: A Scalable Quantum programming language

Quipper: A Scalable Quantum Programming Language

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Green, Alexander S. Lumsdaine, Peter LeFanu Ross, Neil J. Selinger, Peter Valiron, Benoit Dalhousie Univ Halifax NS B3H 3J5 Canada Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450320146

The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

关键词： Quipper Quantum programming languages

来源：评论

学校读者我要写书评

暂无评论

Automated Feedback Generation for Introductory programming Assignments

Automated Feedback Generation for Introductory Programming A...

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Singh, Rishabh Gulwani, Sumit Solar-Lezama, Armando MIT CSAIL Cambridge MA USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450320146

We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that students might make. Using this information, the system automatically derives minimal corrections to student's incorrect solutions, providing them with a measure of exactly how incorrect a given solution was, as well as feedback about what they did wrong. We introduce a simple language for describing error models in terms of correction rules, and formally define a rule-directed translation strategy that reduces the problem of finding minimal corrections in an incorrect program to the problem of synthesizing a correct program from a sketch. We have evaluated our system on thousands of real student attempts obtained from the Introduction to programming course at MIT (6.00) and MITx (6.00x). Our results show that relatively simple error models can correct on average 64% of all incorrect submissions in our benchmark set.

关键词： Automated Grading Computer-Aided Education Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

language support for regions 01

Language support for regions

引用

acm sigplan conference on programming language design and implementation (pldi)

作者： Gay, D Aiken, A Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

ISBN: (纸本)9781581134148

Region-based memory management systems structure memory by grouping objects in regions under program control. Memory is reclaimed by deleting regions, freeing all objects stored therein. Our compiler for C with regions, RC, prevents unsafe region deletions by keeping a count of references to each region. Using type annotations that make the structure of a program's regions more explicit, we reduce the overhead of reference counting from a maximum of 27% to a maximum of 11% on a suite of realistic benchmarks. We generalise these annotations in a region type system whose main novelty is the use of existentially quantified abstract regions to represent pointers to objects whose region is partially or totally unknown. A distribution of RC is available at http://***/(similar to)dgay/***. gz.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

PADS: A domain-specific language for processing ad hoc data

PADS: A domain-specific language for processing ad hoc data

引用

conference on programming language design and implementation

作者： Fisher, K Gruber, R AT&T Labs Res Florham Pk NJ 07932 USA Google Mountain View CA USA

PADS is a declarative data description language that allows data analysts to describe both the physical layout of ad hoc data sources and semantic properties of that data. From such descriptions, the PADS compiler generates libraries and tools for manipulating the data, including parsing routines, statistical profiling tools, translation programs to produce well-behaved formats such as XML or those required for loading relational databases, and tools for running XQueries over raw PADS data sources. The descriptions are concise enough to serve as "living" documentation while flexible enough to describe most of the ASCII, binary, and Cobol formats that we have seen in practice. The generated parsing library provides for robust, application-specific error handling.

关键词： data description language domain-specific languages

来源：评论

学校读者我要写书评

暂无评论

Getting F-Bounded Polymorphism into Shape 14

Getting F-Bounded Polymorphism into Shape

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Greenman, Ben Muehlboeck, Fabian Tate, Ross Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450327848

We present a way to restrict recursive inheritance without sacrificing the benefits of F-bounded polymorphism. In particular, we distinguish two new concepts, materials and shapes, and demonstrate through a survey of 13.5 million lines of open-source generic-Java code that these two concepts never actually overlap in practice. With this Material-Shape Separation, we prove that even naive type-checking algorithms are sound and complete, some of which address problems that were unsolvable even under the existing proposals for restricting inheritance. We illustrate how the simplicity of our design reflects the design intuitions employed by programmers and potentially enables new features coming into demand for upcoming programming languages.

关键词： Algorithms design languages Materials Shapes Separation Subtyping F-Bounded Polymorphism Variance Decidability Joins Higher-Kinded Types

来源：评论

学校读者我要写书评

暂无评论

Simple objects for standard ML 96

Simple objects for standard ML

引用

acm sigplan 96 conference on programming language design and implementation

作者： Reppy, J Riecke, J AT&T Research Bell Laboratories

ISBN: (纸本)9780897917957

We propose a new approach to adding objects to Standard ML (SML) based on explicit declarations of object types, object constructors, and subtyping relationships, with a generalization of the SML case statement to a ''typecase'' on object types. The language, called Object ML (OML), has a type system that conservatively extends the SML type system, preserves sound static typing, and permits type inference. The type system sacrifices some of the expressiveness found in recently proposed schemes, but has the virtue of simplicity. We give examples of how features found in other object-oriented languages can be emulated in OML, discuss the formal properties of OML, and describe some implementation issues.

关键词： programming language design object-oriented programming functional programming Standard ML

来源：评论

学校读者我要写书评

暂无评论

Checking Race Freedom via Linear programming 08

Checking Race Freedom via Linear Programming

引用

acm sigplan conference on programming language design and implementation

作者： Terauchi, Tachio Tohoku Univ Sendai Miyagi 980 Japan

ISBN: (纸本)9781595938602

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modem linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs.

关键词： Fractional Capabilities Linear programming

来源：评论

学校读者我要写书评

暂无评论

Reconciling Exhaustive Pattern Matching with Objects

Reconciling Exhaustive Pattern Matching with Objects

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Isradisaikul, Chinawat Myers, Andrew C. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781450320146

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting;however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

关键词： JMatch pattern matching named constructor equality constructor matching specification exhaustiveness redundancy modal abstraction Java data abstraction subtyping design Verification languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：