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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是131-140 订阅

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

详细简洁

排序：

Sound Predictive Race Detection in Polynomial Time 12

Sound Predictive Race Detection in Polynomial Time

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Smaragdakis, Yannis Evans, Jacob M. Sadowski, Caitlin Yi, Jaeheon Flanagan, Cormac Univ Athens Athens Greece Univ Massachusetts Amherst MA 01003 USA Univ Calif Santa Cruz Santa Cruz CA 95064 USA

ISBN: (纸本)9781450310833

Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport's happens-before (HB) relation has served as the standard test for detecting races-other techniques, such as lockset-based approaches, fail to be sound, as they may falsely warn of races. This work introduces a new relation, causally-precedes (CP), which generalizes happens-before to observe more races without sacrificing soundness. Intuitively, CP tries to capture the concept of happens-before ordered events that must occur in the observed order for the program to observe the same values. What distinguishes CP from past predictive race detection approaches (which also generalize an observed execution to detect races in other plausible executions) is that CP-based race detection is both sound and of polynomial complexity. We demonstrate that the unique aspects of CP result in practical benefit. Applying CP to real-world programs, we successfully analyze server-level applications (e. g., Apache FtpServer) and show that traces longer than in past predictive race analyses can be analyzed in mere seconds to a few minutes. For these programs, CP race detection uncovers races that are hard to detect by repeated execution and HB race detection: a single run of CP race detection produces several races not discovered by 10 separate rounds of happens-before race detection.

关键词： languages Reliability Verification

来源：评论

学校读者我要写书评

暂无评论

A Mechanized Semantics for C++ Object Construction and Destruction, with Applications to Resource Management 12

A Mechanized Semantics for C++ Object Construction and Destr...

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Ramananandro, Tahina Dos Reis, Gabriel Leroy, Xavier INRIA Paris Rocquencourt Paris France Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9781450310833

We present a formal operational semantics and its Coq mechanization for the C++ object model, featuring object construction and destruction, shared and repeated multiple inheritance, and virtual function call dispatch. These are key C++ language features for high-level system programming, in particular for predictable and reliable resource management. This paper is the first to present a formal mechanized account of the metatheory of construction and destruction in C++, and applications to popular programming techniques such as "resource acquisition is initialization." We also report on irregularities and apparent contradictions in the ISO C++03 and C++11 standards.

关键词： languages Verification

来源：评论

学校读者我要写书评

暂无评论

A Language for Automatically Enforcing Privacy Policies 12

A Language for Automatically Enforcing Privacy Policies

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Yang, Jean Yessenov, Kuat Solar-Lezama, Armando MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781450310833

It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application's behavior adheres to policies about where sensitive values may flow. Unfortunately, privacy policies are difficult to manage because their global nature requires coordinated reasoning and enforcement. To address this problem, we describe a programming model that makes the system responsible for ensuring adherence to privacy policies. The programming model has two components: 1) core programs describing functionality independent of privacy concerns and 2) declarative, decentralized policies controlling how sensitive values are disclosed. Each sensitive value encapsulates multiple views;policies describe which views are allowed based on the output context. The system is responsible for automatically ensuring that outputs are consistent with the policies. We have implemented this programming model in a new functional constraint language named Jeeves. In Jeeves, sensitive values are introduced as symbolic variables and policies correspond to constraints that are resolved at output channels. We have implemented Jeeves as a Scala library using an SMT solver as a model finder. In this paper we describe the dynamic and static semantics of Jeeves and the properties about policy enforcement that the semantics guarantees. We also describe our experience implementing a conference management system and a social network.

关键词： languages security Language design run-time system privacy security

来源：评论

学校读者我要写书评

暂无评论

Formalizing the LLVM Intermediate Representation for Verified Program Transformations 12

Formalizing the LLVM Intermediate Representation for Verifie...

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Zhao, Jianzhou Nagarakatte, Santosh Martin, Milo M. K. Zdancewic, Steve Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA

ISBN: (纸本)9781450310833

This paper presents Vellvm (verified LLVM), a framework for reasoning about programs expressed in LLVM's intermediate representation and transformations that operate on it. Vellvm provides a mechanized formal semantics of LLVM's intermediate representation, its type system, and properties of its SSA form. The framework is built using the Coq interactive theorem prover. It includes multiple operational semantics and proves relations among them to facilitate different reasoning styles and proof techniques. To validate Vellvm's design, we extract an interpreter from the Coq formal semantics that can execute programs from LLVM test suite and thus be compared against LLVM reference implementations. To demonstrate Vellvm's practicality, we formalize and verify a previously proposed transformation that hardens C programs against spatial memory safety violations. Vellvm's tools allow us to extract a new, verified implementation of the transformation pass that plugs into the real LLVM infrastructure;its performance is competitive with the non-verified, ad-hoc original.

关键词： languages Verification Reliability LLVM Coq memory safety

来源：评论

学校读者我要写书评

暂无评论

A Type System for Borrowing Permissions 12

A Type System for Borrowing Permissions

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Naden, Karl Bocchino, Robert Aldrich, Jonathan Bierhoff, Kevin Carnegie Mellon Univ Pittsburgh PA 15213 USA Two Sigma Investments New York NY USA

ISBN: (纸本)9781450310833

In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of concurrency. To be usable, unique permissions must be borrowed - for example, one must be able to read a unique reference out of a field, use it for something, and put it back. While one can null out the field and later reassign it, this paradigm is ungainly and requires unnecessary writes, potentially hurting cache performance. Therefore, in practice borrowing must occur in the type system, without requiring memory updates. Previous systems support borrowing with external alias analysis and/or explicit programmer management of fractional permissions. While these approaches are powerful, they are also awkward and difficult for programmers to understand. We present an integrated language and type system with unique, immutable, and shared permissions, together with new local permissions that say that a reference may not be stored to the heap. Our system also includes change permissions such as unique >> unique and unique >> none that describe how permissions flow in and out of method formal parameters. Together, these features support common patterns of borrowing, including borrowing multiple local permissions from a unique reference and recovering the unique reference when the local permissions go out of scope, without any explicit management of fractions in the source language. All accounting of fractional permissions is done by the type system "under the hood." We present the syntax and static and dynamic semantics of a formal core language and state soundness results. We also illustrate the utility and practicality of our design by using it to express several realistic examples.

关键词： Design languages Theory Verification Types Permissions Borrowing Uniqueness Immutability

来源：评论

学校读者我要写书评

暂无评论

An Abstract Interpretation Framework for Termination 12

An Abstract Interpretation Framework for Termination

引用

39th Annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Cousot, Patrick Cousot, Radhia Ecole Normale Super CNRS Paris France NYU Courant Inst New York NY 10003 USA

ISBN: (纸本)9781450310833

Proof, verification and analysis methods for termination all rely on two induction principles: (1) a variant function or induction on data ensuring progress towards the end and (2) some form of induction on the program structure. The abstract interpretation design principle is first illustrated for the design of new forward and backward proof, verification and analysis methods for safety. The safety collecting semantics defining the strongest safety property of programs is first expressed in a constructive fixpoint form. Safety proof and checking/verification methods then immediately follow by fixpoint induction. Static analysis of abstract safety properties such as invariance are constructively designed by fixpoint abstraction (or approximation) to (automatically) infer safety properties. So far, no such clear design principle did exist for termination so that the existing approaches are scattered and largely not comparable with each other. For (1), we show that this design principle applies equally well to potential and definite termination. The trace-based termination collecting semantics is given a fixpoint definition. Its abstraction yields a fixpoint definition of the best variant function. By further abstraction of this best variant function, we derive the Floyd/Turing termination proof method as well as new static analysis methods to effectively compute approximations of this best variant function. For (2), we introduce a generalization of the syntactic notion of structural induction (as found in Hoare logic) into a semantic structural induction based on the new semantic concept of inductive trace cover covering execution traces by segments, a new basis for formulating program properties. Its abstractions allow for generalized recursive proof, verification and static analysis methods by induction on both program structure, control, and data. Examples of particular instances include Floyd's handling of loop cut-points as well as nested loops, Burstall's inter

关键词： languages Reliability Security Theory Verification Abstract Interpretation Induction Proof Safety Static analysis Variant function Verification Termination

来源：评论

学校读者我要写书评

暂无评论

Presentation of the SIGPLAN Distinguished Achievement Award to Sir Charles Antony Richard Hoare, FRS, FREng, FBCS and Interview 12

Presentation of the SIGPLAN Distinguished Achievement Award ...

引用

POPL '12

作者： Andrew P. Black Peter W. O'Hearn Portland State University Portland OR USA Queen Mary University of London London United Kingdom

Tony Hoare's long career in computing is studded with seminal engineering and scientific contributions to programming languages;his views on programming language design have been recognized as profound even by tho... 详细信息

ISBN: (纸本)9781450310833

关键词： verification reliability languages theory security

来源：评论

学校读者我要写书评

暂无评论

Session details: 7.B: functional programming 12

Session details: 7.B: functional programming

引用

Proceedings of the 39th annual acm SIGPLAN-sigact symposium on principles of programming languages

作者： Dimitrios Vytiniotis Microsoft Research

No abstract available.

ISBN: (纸本)9781450310833

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

programming languages for Programmable Networks 12

Programming Languages for Programmable Networks

引用

POPL '12

作者： Jennifer Rexford Princeton University Princeton NJ USA

ISBN: (纸本)9781450310833

Today's computer networks perform a bewildering array of tasks, from routing and access control, to traffic monitoring and load balancing. To support wireless users accessing services hosted in the cloud, enterprise and data-center networks are under increasing pressure to support client mobility, virtual-machine migration, resource isolation between cloud services, and energy-efficient operation. Yet, network administrators must configure the network through closed and proprietary interfaces to heterogeneous devices, such as routers, switches, firewalls, load balancers, network address translators, and intrusion detection systems. Not surprisingly, configuring these complex networks is expensive and error-prone, and innovation in network management proceeds at a snail's pace. During the past several years, the networking industry and research community have pushed for greater openness in networking software, and a clearer separation between networking devices and the software that controls them. This broad trend is known as Software Defined Networking (SDN). A hallmark of SDN is having an open interface for controller software running on a commodity computer to install packet-processing rules in the underlying switches. In particular, the OpenFlow protocol (see ***) has significant momentum. Many commercial switches support OpenFlow, and a number of campus, data-center, and backbone networks have deployed the new technology. With the emergence of open interfaces to network devices, the time is ripe to rethink the design of network software, to put networking on a stronger foundation and foster innovation in networked services. The programming languages community can play a vital role in this transformation, by creating languages, compilers, run-time systems, and testing and verification techniques that raise the level of abstraction for programming the network. In this talk, we give an overview of Software Defined Networking, and survey the early progr

关键词： software defined networking openflow network protocols

来源：评论

学校读者我要写书评

暂无评论

Linguistic foundations for bidirectional transformations: invited tutorial 12

Linguistic foundations for bidirectional transformations: in...

引用

Proceedings of the 31st acm SIGMOD-sigact-SIGAI symposium on principles of Database Systems

作者： Benjamin C. Pierce University of Pennsylvania Philadelphia PA USA

ISBN: (纸本)9781450312486

Computing is full of situations where two different structures must be "connected" in such a way that updates to each can be propagated to the other. This is a generalization of the classical view update problem, which has been studied for decades in the database community [11, 2, 22]; more recently, related problems have attracted considerable interest in other areas, including programming languages [42, 28, 34, 39, 4, 7, 33, 16, 1, 37, 35, 47, 49] software model transformation [43, 50, 44, 45, 12, 13, 14, 24, 25, 10, 51], user interfaces [38] and system configuration [36]. See [18, 17, 10, 30] for recent *** the fruits of this cross-pollination has been the development of a linguistic perspective on the problem. Rather than taking some view definition language as fixed (e.g., choosing some subset of relational algebra) and looking for tractable ways of "inverting" view definitions to propagate updates from view to source [9], we can directly design new bidirectional programming languages in which every expression defines a pair of functions mapping updates on one structure to updates on the other. Such structures are often called lenses [18].The foundational theory of lenses has been studied extensively [20, 47, 26, 32, 48, 40, 15, 31, 46, 41, 21, 27], and lens-based language designs have been developed in several domains, including strings [5, 19, 3, 36], trees [18, 28, 39, 35, 29], relations [6], graphs [23], and software models [43, 50, 44, 12, 13, 14, 24, 25, 8]. These languages share some common elements with modern functional languages---in particular, they come with very expressive type systems. In other respects, they are rather novel and *** tutorial surveys recent developments in the theory of lenses and the practice of bidirectional programming languages.

关键词： bidirectional programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共76页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：