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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

43 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

31 篇 工学
- 27 篇 计算机科学与技术...
- 19 篇 软件工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
15 篇 理学
- 15 篇 数学
4 篇 教育学
- 4 篇 教育学
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

5 篇 languages
3 篇 performance
3 篇 algorithms
3 篇 computer languag...
2 篇 safety
2 篇 static analysis
2 篇 atomicity
2 篇 semantics
2 篇 verification
2 篇 concurrent progr...
2 篇 formal verificat...
2 篇 strong isolation
2 篇 transactional me...
1 篇 object oriented ...
1 篇 quantitative ana...
1 篇 fuzzy logic
1 篇 deoptimization
1 篇 end-user authori...
1 篇 experimentation
1 篇 operator scaling

机构

2 篇 carnegie mellon ...
1 篇 centre for quant...
1 篇 univ sci & techn...
1 篇 queen mary unive...
1 篇 tecnologico de m...
1 篇 adlink technol i...
1 篇 interchain fdn z...
1 篇 ozyegin univ uic...
1 篇 microsoft resear...
1 篇 cornell univ dep...
1 篇 univ calif san d...
1 篇 logicblox inc. a...
1 篇 clever cloud nan...
1 篇 department of co...
1 篇 university of il...
1 篇 munich universit...
1 篇 texas a&m univer...
1 篇 ucl dept comp sc...
1 篇 princeton univ p...
1 篇 harvard univ div...

作者

2 篇 welc adam
2 篇 shpeisman tatian...
2 篇 honarmand nima
2 篇 adve sarita v.
2 篇 heumann stephen
2 篇 adve vikram s.
1 篇 william smith
1 篇 brglez f
1 篇 aehlig klaus
1 篇 murtagh thomas p...
1 篇 narayan shravan
1 篇 smith william
1 篇 fredrik dahlqvis...
1 篇 ruggieri cristin...
1 篇 li rui
1 篇 wand mitchell
1 篇 alexandra silva
1 篇 bueergisser pete...
1 篇 brown fraser
1 篇 r.u. parrazales

语言

46 篇 英文

检索条件"任意字段=38th Symposium on Principles of Programming Languages"

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

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

详细简洁

排序：

POPL'11 - Proceedings of the 38th Annual ACM SIGPLAN-SIGACT symposium on principles of programming languages

POPL'11 - Proceedings of the 38th Annual ACM SIGPLAN-SIGACT ...

引用

38th Annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL'11

ISBN: (纸本)9781450304900

the proceedings contain 51 papers. the topics discussed include: verified squared: does critical software deserve verified tools?;points-to analysis with efficient strong updates;pick your contexts well: understanding object-sensitivity - the making of a precise and scalable pointer analysis;learning minimal abstractions;static analysis of multi-staged programs via unstaging translation;static analysis of interrupt-driven programs synchronized via the priority ceiling protocol;a parametric segmentation functor for fully automatic and scalable array content analysis;step-indexed kripke models over recursive worlds;a shape analysis for optimizing parallel graph programs;correct blame for contracts: no more scapegoating;generative type abstraction and type-level computation;a separation logic for refining concurrent objects;modular reasoning for deterministic parallelism;and expressive modular fine-grained concurrency specification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Static Analysis of Multi-Staged Programs via Unstaging Translation 11

Static Analysis of Multi-Staged Programs via Unstaging Trans...

引用

38th symposium on principles of programming languages

作者： Choi, Wontae Aktemur, Baris Yi, Kwangkeun Tatsuta, Makoto Seoul Natl Univ Seoul 151 South Korea Ozyegin Univ UICU Istanbul Turkey Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781450304900

Static analysis of multi-staged programs is challenging because the basic assumption of conventional static analysis no longer holds: the program text itself is no longer a fixed static entity, but rather a dynamically constructed value. this article presents a semantic-preserving translation of multi-staged call-by-value programs into unstaged programs and it static analysis framework based on this translation. the translation is semantic-preserving in that every small-step reduction of a multi-staged program is simulated by the evaluation of its unstaged version. thanks to this translation we can analyze multi-staged programs with existing static analysis techniques that have been developed for conventional unstaged programs: we first apply the unstaging translation, then we apply conventional static analysis to the unstaged version, and finally we cast the analysis results back in terms of the original staged program. Our translation handles staging constructs that have been evolved to be useful in practice (typified in Lisp's quasi-quotation): open code as values, unrestricted operations on references and intentional variable-capturing substitutions. this article omits references for which we refer the reader to our companion technical report.

关键词： Multi-staged languages Static analysis Unstaging translation Semantics preservation Abstract interpretation Projection

来源：评论

学校读者我要写书评

暂无评论

the Design of Kodu: A Tiny Visual programming Language for Children on the Xbox 360 11

The Design of Kodu: A Tiny Visual Programming Language for C...

引用

38th symposium on principles of programming languages

作者： MacLaurin, Matthew Microsoft FUSE Labs Redmond WA USA

ISBN: (纸本)9781450304900

Kodu is a relatively new programming language (1) designed specifically for young children to learn through independent exploration. Kodu seeks to lower the barrier to entry for new programmers by presenting a radically simplified programming model which revertheless has significant expressive power (2). Kodu is integrated in a real-time 3D gaming environment and is designed to compete with modern console games in terms of intuitive user interface and graphical production values. In this paper we will review key tradeoffs made in the design of the programming language and illustrate how it is one of very few languages designed using user interface design principles and methodologies, to the e dent that the blend of subjective and objective factors considered in the language design(1) have succeeded in presenting a model of programming which is uniquely approachable and creatively empowering for non-technical users.

关键词： games game programming 3d user interface end-user authoring K12 programming programming early education Kodu Boku

来源：评论

学校读者我要写书评

暂无评论

A Separation Logic for Refining Concurrent Objects 11

A Separation Logic for Refining Concurrent Objects

引用

38th symposium on principles of programming languages

作者： Turon, Aaron Wand, Mitchell Northeastern Univ Boston MA USA

ISBN: (纸本)9781450304900

Fine-grained concurrent data structures are crucial for gaining performance from multiprocessing, but their design is a subtle art. Recent literature has made large strides in verifying these data structures, using either atomicity refinement or separation logic with rely-guarantee reasoning. In this paper we show how the ownership discipline of separation logic can be used to enable atomicity refinement, and we develop a new rely-guarantee method that is localized to the definition a a data structure. We present the first semantics of separation logic that is sensitive to atomicity, and show how to control this sensitivity through ownership. the result is a logic that enables compositional reasoning about atomicity and interference, even for programs that use fine-grained synchronization and dynamic memory allocation.

关键词： rely-guarantee formal verification concurrent programming refinement atomicity shared-memory concurrency

来源：评论

学校读者我要写书评

暂无评论

Automating String Processing in Spreadsheets Using Input-Output Examples 11

Automating String Processing in Spreadsheets Using Input-Out...

引用

38th symposium on principles of programming languages

作者： Gulwani, Sumit Microsoft Res Redmond WA USA

ISBN: (纸本)9781450304900

We describe the design of a string programming/expression language that supports restricted forms of regular expressions, conditionals and loops. the language is expressive enough to represent a wide variety of string manipulation tasks that end-users struggle with. We describe an algorithm based on several novel concepts for synthesizing a desired program in this language from input-output examples. the synthesis algorithm is very efficient taking a fraction of a second for various benchmark examples. the synthesis algorithm is interactive and has several desirable features: it can rank multiple solutions and has fast convergence, it can detect noise in the user input, it supports an active interaction model wherein the user is prompted to provide outputs on inputs that may have multiple computational interpretations. the algorithm has been implemented as an interactive add-in for Microsoft Excel spreadsheet system. the prototype tool has met the golden test it has synthesized part of itself, and has been used to solve problems beyond author's imagination.

关键词： Program Synthesis User Intent programming by Example (PBE) Version Space Algebra Spreadsheet programming String Manipulation

来源：评论

学校读者我要写书评

暂无评论

Complexity of Pattern-based Verification for Multithreaded Programs 11

Complexity of Pattern-based Verification for Multithreaded P...

引用

38th symposium on principles of programming languages

作者： Esparza, Javier Ganty, Pierre Tech Univ Munich Fak Informat D-8000 Munich Germany

ISBN: (纸本)9781450304900

Pattern-based verification checks the correctness of the program executions that follow a given pattern, a regular expression over the alphabet of program transitions of the form w(1)* ... w(n)*. For multithreaded programs, the alphabet of the pattern is given by the synchronization operations be tween threads. We study the complexity of pattern-based verification for abstracted multithreaded programs in which, as usual in program analysis, conditions have been replaced by nondeterminism (the technique works also for boolean programs). While unrestricted verification is undecidable for abstracted multithreaded programs with recursive procedures and PSPACE-complete for abstracted multithreaded while-programs, we show that pattern-based verification is NP-complete for both classes. We then conduct a multiparameter analysis in which we study the complexity in the number of threads, the number of procedures per thread, the size of the procedures, and the size of the pattern. We first show that no algorithm for pattern-based verification can be polynomial in the number of threads, procedures per thread, or the size of the pattern (unless P=NP). then, using recent results about Parikh images of regular languages and semilinear sets, we present an algorithm exponential in the number of threads, procedures per thread, and size of the pattern, but polynomial in the size of the procedures.

关键词： concurrent programming safety context-free languages

来源：评论

学校读者我要写书评

暂无评论

Correct Blame for Contracts No More Scapegoating 11

Correct Blame for Contracts No More Scapegoating

引用

38th symposium on principles of programming languages

作者： Dimoulas, Christos Findler, Robert Bruce Flanagan, Cormac Felleisen, Matthias Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781450304900

Behavioral software contracts supplement interface information with logical assertions. A rigorous enforcement of contracts provides useful feedback to developers if it signals contract violations as soon as they occur and if it assigns blame to violators with precise explanations. Correct blame assignment gets programmers started with the debugging process and can significantly decrease the time needed to discover and fix bugs. Sadly the literature on contracts lacks a framework for making statements about the correctness of blame assignment and for validating such statements. this paper fills the gap and uses the framework to demonstrate how one of the proposed semantics for higher-order contracts satisfies this criteria and another semantics occasionally assigns blame to the wrong module. Concretely, the paper applies the framework to the lax enforcement of dependent higher-order contracts and the picky one. A higher-order dependent contract specifies constraints for the domain and range of higher-order functions and also relates arguments and results in auxiliary assertions. the picky semantics ensures that the use of arguments in the auxiliary assertion satisfies the domain contracts ant the lax one does not. While the picky semantics discovers more contract violations than the lax one, it occasionally blames the wrong module. Hence the paper also introduces a third semantic!,, dubbed indy, which fixes the problems of the picky semantics without giving up its advantages.

关键词： Higher-order programming Behavioral Contracts Blame Assignment

来源：评论

学校读者我要写书评

暂无评论

Robin Milner 1934-2010: Verification, languages, and concurrency 38

Robin Milner 1934-2010: Verification, languages, and concurr...

引用

38th Annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL 2011

作者： Gordon, Andrew D. Harper, Robert Harrison, John Jeffrey, Alan Sewell, Peter Microsoft Research United States Carnegie Mellon University United States Intel United States Bell Labs United States University of Cambridge United Kingdom

来源：评论

学校读者我要写书评

暂无评论

Dynamic Inference of Static Types for Ruby 11

Dynamic Inference of Static Types for Ruby

引用

38th symposium on principles of programming languages

作者： An, Jong-hoon (David) Chaudhuri, Avik Foster, Jeffrey S. Hicks, Michael Epic Syst Corp Verona WI USA

ISBN: (纸本)9781450304900

there have beet several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Pert. In our experience, however, such type inference systems are extremely difficult to develop, because dynamic languages are typically complex, poorly specified, and include features., such as eval and reflection, that are hard to analyze. In this paper, we introduce constraint-based dynamic type inference, a technique that infers static types based on dynamic program executions. In our approach, we wrap each run-time value to associate it with a type variable, and the wrapper generates constraints on this type variable when the wrapped value is used. this technique avoids many of the often overly conservative approximations of static tools, at. constraints are generated based on how values are used during actual program runs. Using wrappers is also easy to implement, sine:: we need only write a constraint resolution algorithm and a transformation to introduce the wrappers. the best part is that: we can ea: our cake too: our algorithm will infer sound types as long as it observes every path through each method body note that the number :if such paths may be dramatically smaller than the number of paths through tie program as a whole. We have developed Rubydust, an implementation of our algorithm for Ruby. Rubydust takes advantage of Ruby's dynamic features to implement wrappers as a language library. We applied Rubydust to a number of small programs and found it to be both easy to use and useful: Rubydust discovered 1 real type error, and all other inferred types were correct and readable.

关键词： Dynamic type inference static types Ruby dynamic languages

来源：评论

学校读者我要写书评

暂无评论

Multivariate Amortized Resource Analysis 11

Multivariate Amortized Resource Analysis

引用

38th symposium on principles of programming languages

作者： Hoffmann, Jan Aehlig, Klaus Hofmann, Martin Univ Munich D-80539 Munich Germany

ISBN: (纸本)9781450304900

We study the problem of automatically analyzing the worst-case resource usage a procedures with several arguments. Existing automatic analyses based or. amortization, or sized types bound the resource usage or result site of such a procedure by a sum of unary functions of the sizes of the arguments. In this paper we generalize this to arbitrary multivariate polynomial functions thus allowing bounds of the form inn which had to be grossly overestimated t y m(2) + n(2) before. Our framework even encompasses bounds like Sigma(i,j <= n) m(i)m(j) where the m(i) are the sizes of the entries of a list of length n. this allows us for the first time to derive useful resource bounds for operations on matrices that are represented as lists of lists and to considerably improve founds on other super-linear operations on lists such as longest common subsequence and removal of duplicates from lists of lists. Furthermore, resource bounds are now closed under composition which improves accuracy of the analysis of composed programs which some or all of the components exhibit super-linear resource or she behavior. the analysis is based or, a novel multivariate amortized resource analysis. We present it in form of a type system for a simple first-order functional language with lists and trees, prove soundness, and describe automatic type inference based on linear programming. We have experimentally validated the automatic analysis on a wide range of examples from functional programming with lists and trees. the obtained bounds were compared with actual resource consumption. All bounds were asymptotically tight, and the constants were close or even identical to the optimal ones.

关键词： Functional programming Static Analysis Amortized Analysis Resource Consumption Quantitative Analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：