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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

31 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

31 篇 工学
- 31 篇 计算机科学与技术...
- 30 篇 软件工程
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
18 篇 理学
- 14 篇 数学
- 3 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
8 篇 管理学
- 5 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理
2 篇 教育学
- 2 篇 教育学
1 篇 法学
- 1 篇 法学

主题

11 篇 computer program...
3 篇 computer program...
2 篇 runtime
2 篇 security of data
2 篇 context sensitiv...
2 篇 java programming...
2 篇 dynamic programm...
1 篇 object oriented ...
1 篇 associate constr...
1 篇 programming prof...
1 篇 data security
1 篇 access control
1 篇 lattices
1 篇 cross-lingual co...
1 篇 cross-lingual in...
1 篇 automatic progra...
1 篇 computer securit...
1 篇 optimization
1 篇 linear programmi...
1 篇 computer languag...

机构

2 篇 carnegie mellon ...
2 篇 ibm research
1 篇 harvard universi...
1 篇 chinese univ hon...
1 篇 school of electr...
1 篇 school of electr...
1 篇 department of co...
1 篇 university of ca...
1 篇 university of ma...
1 篇 microsoft resear...
1 篇 university of ve...
1 篇 tu wien austria
1 篇 computer systems...
1 篇 computer science...
1 篇 department of co...
1 篇 computer science...
1 篇 university of ca...
1 篇 department of el...
1 篇 university of ma...
1 篇 university of pe...

作者

3 篇 hicks michael
2 篇 smith scott f.
1 篇 liu yanhong a.
1 篇 erlingsson úlfar
1 篇 spoonhower danie...
1 篇 mcdaniel patrick
1 篇 polakow jeff
1 篇 ahmed el-mahdy
1 篇 bridges matthew ...
1 篇 raman easwaran
1 篇 cheng perry
1 篇 stoyle gareth
1 篇 bhansali sanjay
1 篇 liu michael yang...
1 篇 hristova katia
1 篇 siek jeremy
1 篇 unno hiroshi
1 篇 rothamel tom
1 篇 blelloch guy e.
1 篇 casey kevin

语言

34 篇 英文

检索条件"任意字段=PLAS 2006 - 2006 Programming Languages and Analysis for Security Workshop"

共 34 条记录，以下是11-20 订阅

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

详细简洁

排序：

Certified in-lined reference monitoring on .NET

Certified in-lined reference monitoring on .NET

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Hamlen, Kevin W. Morrisett, Greg Schneider, Fred B. Cornell University United States Harvard University United States

ISBN: (纸本)1595933743

Mobile is an extension of the .NET Common Intermediate Language that supports certified In-Lined Reference Monitoring. Mobile programs have the useful property that if they are well-typed with respect to a declared security policy, then they are guaranteed not to violate that security policy when executed. Thus, when an In-Lined Reference Monitor (IRM) is expressed in Mobile, it can be certified by a simple type-checker to eliminate the need to trust the producer of the IRM. security policies in Mobile are declarative, can involve unbounded collections of objects allocated at runtime, and can regard infinite-length histories of security events exhibited by those objects. The prototype Mobile implementation enforces properties expressed by finite-state security automata - one automaton for each security-relevant object-and can type-check Mobile programs in the presence of exceptions, finalizers, concurrency, and non-termination. Executing Mobile programs requires no change to existing .NET virtual machine implementations, since Mobile programs consist of normal managed CIL code with extra typing annotations stored in .NET attributes. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Specifying distributed trust management in LolliMon

Specifying distributed trust management in LolliMon

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Polakow, Jeff Skalka, Christian Harvey Mudd College United States University of Vermont United States

ISBN: (纸本)1595933743

We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework. LolliMon possesses features that make it well-suited to this application, including rigorous logical foundations, an expressive formula language, strong typing, and saturation as a proof resolution strategy. We specify certificate chain discovery in fall RT for authorization in a distributed environment where certificates may be stored non-locally and selective retrieval is necessary. The uniform LolliMon specification of authorization and certificate chain discovery eases formal reasoning about the system, and scales to a rich collection of trust management features. The executable LolliMon specification also serves as a prototype implementation. Copyright © 2006 ACM.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Object capabilities for security

Object capabilities for security

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Wagner, David Computer Science Division University of California Berkeley United States

ISBN: (纸本)1595933743

Existing systems often do a poor job of meeting the principle of least privilege. I will discuss how object capability systems and language-based methods can help address this shortcoming. In language-based object capability systems, an object reference is treated as a capability;unforgeability of references ensures unforgeability of capabilities;and all privileges are expressed as capabilities in this way. This makes it possible to decompose the system into distrusting "privilege-separated" components, providing each component with the least privilege it needs to do its job;to reason about the privileges and powers available to various program elements, often in a local (modular) way;and to avoid common pitfalls, such as confused deputy and TOCTTOU vulnerabilities. I will attempt to introduce the audience to some work in this area that is perhaps not so widely known, and I will describe some work in progress to construct a subset of Java, called Joe-E, that is intended to enable capability-style programming using a programming syntax that is familiar to Java programmers.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Trusted declassification: High-level policy for a security-typed language

Trusted declassification: High-level policy for a security-t...

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Hicks, Boniface King, Dave McDaniel, Patrick Hicks, Michael Penn State University University of Maryland

ISBN: (纸本)1595933743

security-typed languages promise to be a powerful tool with which provably secure software applications may be developed. Programs written in these languages enforce a strong, global policy of noninterference which ensures that high-security data will not be observable on low-security channels. Because noninterference is typically too strong a property, most programs use some form of declassification to selectively leak high security information, e.g. when performing a password check or data encryption. Unfortunately, such a declassification is often expressed as an operation within a given program, rather than as part of a global policy, making reasoning about the security implications of a policy more difficult. In this paper, we propose a simple idea we call trusted declassification in which special declassifier functions are specified as part of the global policy. In particular, individual principals declaratively specify which declassifies they trust so that all information flows implied by the policy can be reasoned about in absence of a particular program. We formalize our approach for a Java-like language and prove a modified form of noninterference which we call noninterference modulo trusted methods. We have implemented our approach as an extension to Jif and provide some of our experience using it to build a secure e-mail client. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Combining type-based analysis and model checking for finding counterexamples against non-interference

Combining type-based analysis and model checking for finding...

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Unno, Hiroshi Kobayashi, Naoki Yonezawa, Akinori University of Tokyo Japan Tohoku University Japan

ISBN: (纸本)1595933743

Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often reject safe programs as ill-typed. Accordingly, users have to check whether the rejected programs indeed have insecure flows. To remedy this problem, we propose a method for automatically rinding a counterexample of secure information flow (input states that actually lead to leakage of secret information). Our method is a novel combination of type-based analysis and model checking;Suspicious execution paths (that may cause insecure information flow) are first found by using the result of a type-based information flow analysis, and then a model checker is used to check whether the paths are indeed unsafe. We have formalized and implemented the method. The result of preliminary experiments shows that our method can often find counterexamples faster than a method using a model checker alone. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Precise alias analysis for static detection of web application vulnerabilities

Precise alias analysis for static detection of web applicati...

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Jovanovic, Nenad Kruegel, Christopher Kirda, Engin Secure Systems Lab. Technical University of Vienna Austria

ISBN: (纸本)1595933743

The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applications have grown as well. Since manual code reviews are time-consuming, error-prone and costly, the need for automated solutions has become evident. In this paper, we address the problem of vulnerable web applications by means of static source code analysis. To this end, we present a novel, precise alias analysis targeted at the unique reference semantics commonly found in scripting languages. Moreover, we enhance the quality and quantity of the generated vulnerability reports by employing a novel, iterative two-phase algorithm for fast and precise resolution of file inclusions. We integrated the presented concepts into Pixy [16], a high-precision static analysis tool aimed at detecting cross-site scripting vulnerabilities in PHP scripts. To demonstrate the effectiveness of our techniques, we analyzed three web applications and discovered 106 vulnerabilities. Both the high analysis speed as well as the low number of generated false positives show that our techniques can be used for conducting effective security audits. Copyright © 2006 ACM.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Efficient type inference for secure information flow

Efficient type inference for secure information flow

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Hristova, Katia Rothamel, Tom Liu, Yanhong A. Stoller, Scott D. Computer Science Department State University of New York Stony Brook NY 11794 United States

ISBN: (纸本)1595933743

This paper describes the design, analysis, and implementation of an efficient algorithm for information flow analysis expressed using a type system. Given a program and an environment of security classes for information accessed by the program, the algorithm checks whether the program is well typed, i.e., there is no information of higher security classes flowing into places of lower security classes according to a lattice of security classes, by inferring the highest or lowest security class as appropriate for each program node. We express the analysis as a set of Datalog-like rules based on the typing and subtyping rules, and we use a systematic method to generate specialized algorithms and data structures directly from the Datalog-like rules. The generated implementation traverses the program multiple times and uses a combination of linked and indexed data structures to represent program nodes, environments, and types. The time complexity of the algorithm is linear in the size of the input program, times the height of the lattice of security classes, plus a small overhead for preprocessing the security classes. This complexity is confirmed through our prototype implementation and experimental evaluation on code generated from high-level specifications for real systems. Copyright © 2006 ACM.

关键词： security of data

来源：评论

学校读者我要写书评

暂无评论

Empirical relation between coupling and attackability in software systems: A case study on DOS

Empirical relation between coupling and attackability in sof...

引用

plas 2006 - 2006 programming languages and analysis for security workshop

作者： Liu, Michael Yanguo Traore, Issa Department of Electrical and Computer Engineering University of Victoria STN CSC PO Box 3055 Victoria BC V8W 3P6 Canada

ISBN: (纸本)1595933743

Over the last decades, software quality attributes such as maintainability, reliability, and understandability have been widely studied. In contrast, less attention has been paid to the field of software security. Attackability is a concept proposed recently in the research literature to measure the extent that a software system or service could be the target of successful attacks. Like most external attributes, attackability is to some extent disconnected from the internal of software products. To improve the quality of software products we need to be able to affect its internal features. So, for attackability measures to be useful for software products enhancement, we need to identify related internal software attributes. We study in this paper the empirical relationship between attackability as an external software quality attribute with coupling as an internal software attribute. Specifically, we use a case study based on denial of service (DOS) attacks conducted against a on line medical record keeping system. Through regression analysis, we establish that there is a strong correlation between attackability and coupling. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Effective static race detection for Java 06

Effective static race detection for Java

引用

ACM SIGPLAN Conference on programming Language Design and Implementation, PLDI 2006 - plas 2006: 2006 programming languages and analysis for security workshop

作者： Naik, Mayur Aiken, Alex Whaley, John Computer Science Department Stanford University United States

ISBN: (纸本)1595933743

We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pairs of memory accesses potentially involved in a race. We have implemented our technique and applied it to a suite of multi-threaded Java programs. Our experiments show that it is precise, scalable, and useful, reporting tens to hundreds of serious and previously unknown concurrency bugs in large, widely-used programs with few false alarms. Copyright © 2006 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

An experimental analysis of self-adjusting computation 06

An experimental analysis of self-adjusting computation

引用

ACM SIGPLAN Conference on programming Language Design and Implementation, PLDI 2006 - plas 2006: 2006 programming languages and analysis for security workshop

作者： Acar, Umut A. Blelloch, Guy E. Blume, Matthias Tangwongsan, Kanat Toyota Technological Institute Japan Carnegie Mellon University United States

ISBN: (纸本)1595933743

Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining these approaches to effectively dynamize a wide range of applications. Toward this end various theoretical results were given. In this paper we describe the implementation of a library based on these ideas, and present experimental results on the efficiency of this library on a variety of applications. The results of the experiments indicate that the approach is effective in practice, often requiring orders of magnitude less time than recomputing the output from scratch. We believe this is the first experimental evidence that incremental computation of any type is effective in practice for a reasonably broad set of applications. Copyright © 2006 ACM.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：