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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

660 篇 会议
97 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

666 篇 工学
- 648 篇 软件工程
- 434 篇 计算机科学与技术...
- 20 篇 控制科学与工程
- 7 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 电子科学与技术（可...
- 2 篇 光学工程
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 电气工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 农业工程
170 篇 理学
- 167 篇 数学
- 8 篇 统计学（可授理学、...
- 2 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
75 篇 管理学
- 55 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 4 篇 工商管理
4 篇 法学
- 2 篇 法学
- 2 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

234 篇 languages
153 篇 theory
121 篇 computer program...
106 篇 verification
53 篇 algorithms
48 篇 design
30 篇 computer program...
28 篇 object oriented ...
26 篇 reliability
23 篇 functional progr...
22 篇 high level langu...
22 篇 security
21 篇 performance
19 篇 programming theo...
19 篇 logic programmin...
18 篇 semantics
14 篇 computer systems...
14 篇 type systems
14 篇 concurrency
13 篇 separation logic

机构

15 篇 univ penn philad...
12 篇 carnegie mellon ...
11 篇 univ cambridge c...
11 篇 carnegie mellon ...
8 篇 princeton univ p...
7 篇 microsoft res re...
6 篇 inria rocquencou...
5 篇 inria
5 篇 univ of glasgow ...
5 篇 univ london impe...
5 篇 indiana univ blo...
5 篇 microsoft resear...
5 篇 microsoft resear...
5 篇 tel aviv univ il...
5 篇 university of pe...
5 篇 stanford univ st...
5 篇 univ london impe...
5 篇 cornell univ ith...
5 篇 univ edinburgh e...
4 篇 univ wisconsin m...

作者

11 篇 jones simon peyt...
11 篇 walker david
10 篇 leroy xavier
9 篇 pierce benjamin ...
9 篇 felleisen matthi...
9 篇 harper robert
9 篇 gordon andrew d.
9 篇 abadi martin
8 篇 cardelli luca
7 篇 palsberg jens
7 篇 sagiv mooly
7 篇 calcagno cristia...
7 篇 wadler philip
7 篇 morrisett greg
6 篇 riecke jon g.
6 篇 odersky martin
6 篇 hicks michael
6 篇 fournet cedric
6 篇 kobayashi naoki
5 篇 strub pierre-yve...

语言

690 篇 英文
61 篇 其他
6 篇 中文

检索条件"任意字段=ACM Singplan-sigact Symposium on Principles of Programming Languages"

共 757 条记录，以下是291-300 订阅

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

详细简洁

排序：

Variance analyses from invariance analyses 07

Variance analyses from invariance analyses

引用

34th acm SIGPLAN-sigact symposium on principles of programming languages

作者： Berdine, Josh Chawdhary, Aziem Cook, Byron Distefano, Dino O'Hearn, Peter Microsoft Res Redmond WA 98052 USA Univ London Queen Mary Coll London WC1E 7HU England

ISBN: (纸本)9781595935755

An invariance assertion for a program location l is a statement that always holds at l during execution of the program. Program invariance analyses infer invariance assertions that can be useful when trying to prove safety properties. We use the term variance assertion to mean a statement that holds between any state at l and any previous state that was also at l. This paper is concerned with the development of analyses for variance assertions and their application to proving termination and liveness properties. We describe a method of constructing program variance analyses from invariance analyses. If we change the underlying invariance analysis, we get a different variance analysis. We describe several applications of the method, including variance analyses using linear arithmetic and shape analysis. Using experimental results we demonstrate that these variance analyses give rise to a new breed of termination provers which are competitive with and sometimes better than today's state-of-the-art termination provers.

关键词： verification reliability languages formal verification software model checking program analysis liveness termination

来源：评论

学校读者我要写书评

暂无评论

Lightweight fusion by fixed point promotion 07

Lightweight fusion by fixed point promotion

引用

34th acm SIGPLAN-sigact symposium on principles of programming languages

作者： Ohori, Atsushi Sasano, Isao Tohoku Univ Res Inst Elect Commun Sendai Miyagi 980 Japan

ISBN: (纸本)9781595935755

This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features: it works for general recursive functions on general algebraic data types;it does not produce extra runtime overhead (except for possible code size increase due to the success of fusion);and it is readily incorporated in standard inlining optimization. This is achieved by extending the ordinary inlining process with a new fusion law that transforms a term of the form f circle (fix *** x. E) to a new fixed point term fix *** x.E' by promoting the function f through the fixed point operator. This is a sound syntactic transformation rule that is not sensitive to the types of f and g. This property makes our method applicable to wide range of functions including those with multi-parameters in both curried and uncurried forms. Although this method does not guarantee any form of completeness, it fuses typical examples discussed in the literature and others that involve accumulating parameters, either in the foldl-like specific forms or in general recursive forms, without any additional machinery. In order to substantiate our claim, we have implemented our method in a compiler. Although it is preliminary, it demonstrates practical feasibility of this method.

关键词： languages theory fusion inlining fixed point

来源：评论

学校读者我要写书评

暂无评论

Specialization of CML message-passing primitives 07

Specialization of CML message-passing primitives

引用

34th acm SIGPLAN-sigact symposium on principles of programming languages

作者： Reppy, John Xiao, Yingqi Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781595935755

Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous operations. This mechanism allows programmers to encapsulate complicated communication and synchronization protocols as first-class abstractions, which encourages a modular style of programming where the underlying channels used to communicate with a given thread are hidden behind data and type abstraction. While CML has been in active use for well over a decade, little attention has been paid to optimizing CML programs. In this paper, we present a new program analysis for statically-typed higher-order concurrent languages that enables the compile-time specialization of communication operations. This specialization is particularly important in a multiprocessor or multicore setting, where the synchronization overhead for general-purpose operations are high. Preliminary results from a prototype that we have built demonstrate that specialized channel operations are much faster than the general-purpose operations. Our analysis technique is modular (i.e., it analyzes and optimizes a single unit of abstraction at a time), which plays to the modular style of many CML programs. The analysis consists of three steps: the first is a type-sensitive control-flow analysis that uses the program's type-abstractions to compute more precise results. The second is the construction of an extended control-flow graph using the results of the CFA. The last step is an iterative analysis over the graph that approximates the usage patterns of known channels. Our analysis is designed to detect special patterns of use, such as one-shot channels, fan-in channels, and fan-out channels. We have proven the safety of our analysis and state those results.

关键词： languages performance ML concurrent languages message passing static analysis

来源：评论

学校读者我要写书评

暂无评论

Cork: Dynamic memory leak detection for garbage-collected languages 07

Cork: Dynamic memory leak detection for garbage-collected la...

引用

34th acm SIGPLAN-sigact symposium on principles of programming languages

作者： Jump, Maria McKinley, Kathryn S. Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9781595935755

A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap growth, degrading performance and resulting in program crashes after perhaps days or weeks of execution. Prior approaches for detecting memory leaks rely on heap differencing or detailed object statistics which store state proportional to the number of objects in the heap. These overheads preclude their use on the same processor for deployed long-running applications. This paper introduces a dynamic heap-summarization technique based on type that accurately identifies leaks, is space efficient (adding less than 1% to the heap), and is time efficient (adding 2.3% on average to total execution time). We implement this approach in Cork which utilizes dynamic type information and garbage collection to summarize the live objects in a type points-from graph (TPFG) whose nodes (types) and edges (references between types) are annotated with volume. Cork compares TPFGs across multiple collections, identifies growing data structures, and computes a type slice for the user. Cork is accurate: it identifies systematic heap growth with no false positives in 4 of 15 benchmarks we tested. Cork's slice report enabled us (non-experts) to quickly eliminate growing data structures in SPECjbb2000 and Eclipse, something their developers had not previously done. Cork is accurate, scalable, and efficient enough to consider using online.

关键词： memory leak detection memory leaks runtime analysis dynamic garbage collection

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 33rd acm SIGPLAN-sigact symposium on principles of programming languages, POPL 2006

Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Prin...

引用

33rd acm SIGPLAN-sigact symposium on principles of programming languages, POPL'06

The proceedings contain 34 papers. The topics discussed include: formal certification of a compiler back-end or: programming a compiler with a proof assistant;decidability and proof systems for language-based noninterference relations;on flow-sensitive security types;a logic for information flow in object-oriented programs;polymorphic regular tree types and patterns;verifying properties of well-founded linked lists;small bisimulations for reasoning about higher-order imperative programs;a fixpoint calculus for local and global program flows;the next mainstream programming language: a game developer’s perspective;n-synchronous Kahn networks — a relaxed model of synchrony for real-time systems;compiler-directed channel allocation for saving power in on-chip networks;and a polymorphic modal type system for lisp-like multi-staged languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Conference Record of POPL 2006: 33rd acm SIGPLAN-sigact symposium on principles of programming languages

Conference Record of POPL 2006: 33rd ACM SIGPLAN-SIGACT Symp...

引用

ISBN: (纸本)1595930272

The proceedings contain 35 papers. The topics discussed include: the next 700 data description languages;a hierarchical model of data locality;formal certification of a compiler back-end or: programming a compiler with a proof assistant;decidability and proof systems for language based noninterference relations;verifying properties of well-founded linked lists;small bisimulations for reasoning about higher-order imperative programs;the next mainstream programming language;adventures in time and space;compiler-directed channel allocation for saving power in on-chip networks;modular set-based analysis form contracts;stratified type inference for generalized algebraic data types;why dependent types matter;a virtual class calculus;frame rules from answer types for code pointers;protecting representation with effect encapsulation;and a verifiable SSA program representation for aggressive compiler optimization.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The Scala experiment - Can we provide better language support for component systems?

The Scala experiment - Can we provide better language suppor...

引用

33rd symposium on principles of programming languages

作者： Odersky, M EPFL Switzerland

No abstract available

关键词： languages

来源：评论

学校读者我要写书评

暂无评论

Environment analysis via ΔCFA 06

Environment analysis via ΔCFA

引用

33rd symposium on principles of programming languages

作者： Might, M Shivers, O Georgia Inst Technol Atlanta GA 30332 USA

We describe a new program-analysis framework, based on CPS and procedure-string abstractions, that can handle critical analyses which the k-CFA framework cannot. We present the main theorems concerning correctness, sh... 详细信息

ISBN: (纸本)9781595930279

关键词： languages delta-CFA program analysis flow analysis environment analysis functional languages lambda calculus super-beta inlining CPS continuations

来源：评论

学校读者我要写书评

暂无评论

A polymorphic modal type system for Lisp-like multi-staged languages 06

A polymorphic modal type system for Lisp-like multi-staged l...

引用

33rd acm SIGPLAN-sigact symposium on principles of programming languages, POPL'06

作者： Kim, Ik-Soon Yi, Kwangkeun Calcagno, Cristiano Seoul National University Korea Republic of Imperial College United Kingdom

ISBN: (纸本)1595930272

This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-quotation system). The combination is meaningful because ML is a practical higher-order, impure, and typed language, while Lisp's quasi-quotation system has long evolved to comply with the demands from multi-staged programming practices. Our type system supports open code, unrestricted operations on references, intentional variable-capturing substitution as well as capture-avoiding substitution, and lifting values into code, whose combination escaped all the previous systems. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Simplifying reductions 06

Simplifying reductions

引用

33rd symposium on principles of programming languages

作者： Gautam Rajopadhye, S Colorado State Univ Rennes France IRISA Rennes France

ISBN: (纸本)9781595930279

We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benchmarks are ACLs. They often contain reductions: associative and commutative operators applied to a collection of values. They also often exhibit reuse: intermediate values computed or used at different index points being identical. We develop various techniques to automatically exploit reuse to simplify the computational complexity of evaluating reductions. Finally, we present an algorithm for the optimal application of such simplifications resulting in an equivalent specification with minimum complexity.

关键词： algorithms languages equational programming polyhedral model incremental computation program transformation loop optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共76页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：