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

Classification of security properties in a Linda-like process algebra

SCIENCE OF COMPUTER programming 2006年第1期63卷 16-38页

作者： Aldini, Alessandro Univ Urbino Carlo Bo Ist Sci & Tecnol Informaz Urbino Italy

We provide a classification of noninterference-based security properties for the formal analysis of secure information flow in concurrent and distributed systems. This is done in the setting of a process algebra modeling some Linda coordination primitives (asynchronous communication and read operation). For this purpose, we define relaxed notions of behavioural equivalence that take into account the observational power of the external observer. The resulting taxonomy is compared with analogous security definitions based on synchronous communication models, thus emphasizing the influence of the Linda coordination model upon the expressivity of the security properties, by giving a new intuition to the relative merits. (c) 2006 Elsevier B.V. All rights reserved.

关键词： information flow analysis noninterference properties coordination model process algebra behavioural equivalence

来源：评论

学校读者我要写书评

暂无评论

Fast and flexible instruction selection with on-demand tree-parsing automata 06

Fast and flexible instruction selection with on-demand tree-...

引用

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

作者： Ertl, M. Anton Casey, Kevin Gregg, David TU Wien Austria Trinity College Dublin Ireland Institut für Computersprachen Technische Universität Wien Argentinierstraße 8 A-1040 Wien Austria

ISBN: (纸本)1595933743

Tree parsing as supported by code generator generators like BEG, burg, iburg, lburg and ml-burg is a popular instruction selection method. There are two existing approaches for implementing tree parsing: dynamic programming, and tree-parsing automata;each approach has its advantages and disadvantages. We propose a new implementation approach that combines the advantages of both existing approaches: we start out with dynamic programming at compile time, but at every step we generate a state for a tree-parsing automaton, which is used the next time a tree matching the state is found, turning the instruction selector into a fast tree-parsing automaton. We have implemented this approach in the Gforth code generator. The implementation required little effort and reduced the startup time of Gforth by up to a factor of 2.5. Copyright © 2006 ACM.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Refinement-based context-sensitive points-to analysis for Java 06

Refinement-based context-sensitive points-to analysis for Ja...

引用

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

作者： Sridharan, Manu Bodík, Rastislav University of California Berkeley United States

ISBN: (纸本)1595933743

We present a scalable and precise context-sensitive points-to analysis with three key properties: (1) filtering out of unrealizable paths, (2) a context-sensitive heap abstraction, and (3) a context-sensitive call graph. Previous work [21] has shown that all three properties are important for precisely analyzing large programs, e.g., to show safety of downcasts. Existing analyses typically give up one or more of the properties for scalability. We have developed a refinement-based analysis that succeeds by simultaneously refining handling of method calls and heap accesses, allowing the analysis to precisely analyze important code while entirely skipping irrelevant code. The analysis is demanddriven and client-driven, facilitating refinement specific to each queried variable and increasing scalability. In our experimental evaluation, our analysis proved the safety of 61% more casts than one of the most precise existing analyses across a suite of large benchmarks. The analysis checked the casts in under 13 minutes per benchmark (taking less than 1 second per query) and required only 35MB of memory, far less than previous approaches. Copyright © 2006 ACM.

关键词： Context sensitive languages

来源：评论

学校读者我要写书评

暂无评论

The Atomos ∑ transactional programming language 06

The Atomos ∑ transactional programming language

引用

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

作者： Carlstrom, Brian D. McDonald, Austen Chafi, Hassan Chung, Jaewoong Minh, Chi Cao Kozyrakis, Christos Olukotun, Kunle Computer Systems Laboratory Stanford University United States

ISBN: (纸本)1595933743

Atomos is the first programming language with implicit transactions, strong atomicity, and a scalable multiprocessor implementation. Atomos is derived from Java, but replaces its synchronization and conditional waiting constructs with simpler transactional *** Atomos watch statement allows programmers to specify fine-grained watch sets used with the Atomos retry conditional waiting statement for efficient transactional conflict-driven wakeup even in transactional memory systems with a limited number of transactional contexts. Atomos supports open-nested transactions, which are necessary for building both scalable application programs and virtual machine *** implementation of the Atomos scheduler demonstrates the use of open nesting within the virtual machine and introduces the concept of transactional memory violation handlers that allow programs to recover from data dependency violations without rolling *** programming examples are given to demonstrate the usefulness of transactional programming primitives. Atomos and Java are compared through the use of several benchmarks. The results demonstrate both the improvements in parallel programming ease and parallel program performance provided by Atomos. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

LOCKSMITH: Context-sensitive correlation analysis for race detection 06

LOCKSMITH: Context-sensitive correlation analysis for race d...

引用

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

作者： Pratikakis, Polyvios Foster, Jeffrey S. Hicks, Michael University of Maryland College Park United States

ISBN: (纸本)1595933743

One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a tool called LOCKSMITH for detecting data races in C programs by looking for violations of this pattern. We call the relationship between locks and the locations they protect consistent correlation, and the core of our technique is a novel constraint-based analysis that infers consistent correlation context-sensitively, using the results to check that locations are properly guarded by locks. We present the core of our algorithm for a simple formal language > which we have proven sound, and discuss how we scale it up to an algorithm that aims to be sound for all of C. We develop several techniques to improve the precision and performance of the analysis, including a sharing analysis for inferring thread locality;existential quantification for modeling locks in data structures;and heuristics for modeling unsafe features of C such as type casts. When applied to several benchmarks, including multi-threaded servers and Linux device drivers, LOCKSMITH found several races while producing a modest number of false alarm. Copyright © 2006 ACM.

关键词： Context sensitive grammars

来源：评论

学校读者我要写书评

暂无评论

A framework for unrestricted whole-program optimization 06

A framework for unrestricted whole-program optimization

引用

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

作者： Triantafyllis, Spyridon Bridges, Matthew J. Raman, Easwaran Ottoni, Guilherme August, David I. Department of Computer Science Princeton University United States

ISBN: (纸本)1595933743

Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather than optimization goals, arbitrarily constraining code transformations. Techniques, such as aggressive inlining and interprocedural optimization, have been developed to alleviate this problem, but, due to code growth and compile time issues, these can be applied only *** paper introduces the Procedure Boundary Elimination (PBE) compilation framework, which allows unrestricted whole-program optimization. PBE allows all intra-procedural optimizations and analyses to operate on arbitrary subgraphs of the program, regardless of the original procedure boundaries and without resorting to inlining. In order to control compilation time, PBE also introduces novel extensions of region formation and encapsulation. PBE enables targeted code specialization, which recovers the specialization benefits of inlining while keeping code growth in check. This paper shows that PBE attains better performance than inlining with half the code growth. Copyright © 2006 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Algorithm specialization in generic programming: Challenges of constrained generics in C++ 06

Algorithm specialization in generic programming: Challenges ...

引用

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

作者： Järvi, Jaakko Gregor, Douglas Willcock, Jeremiah Lumsdaine, Andrew Siek, Jeremy Texas A and M University United States Indiana University United States Rice University United States

ISBN: (纸本)1595933743

Generic programming has recently emerged as a paradigm for developing highly reusable software libraries, most notably in C++. We have designed and implemented a constrained generics extension for C++ to support modular type checking of generic algorithms and to address other issues associated with unconstrained generics. To be as broadly applicable as possible, generic algorithms are defined with minimal requirements on their inputs. At the same time, to achieve a high degree of efficiency, generic algorithms may have multiple implementations that exploit features of specific classes of inputs. This process of algorithm specialization relies on non-local type information and conflicts directly with the local nature of modular type checking. In this paper, we review the design and implementation of our extensions for generic programming in C++, describe the issues of algorithm specialization and modular type checking in detail, and discuss the important design tradeoffs in trying to accomplish *** present the particular design that we chose for our implementation, with the goal of hitting the sweet spot in this interesting design space. Copyright © 2006 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Eventrons: A safe programming construct for high-frequency hard real-time applications 06

Eventrons: A safe programming construct for high-frequency h...

引用

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

作者： Spoonhower, Daniel Auerbach, Joshua Bacon, David F. Cheng, Perry Grove, David Carnegie Mellon University United States IBM Research

ISBN: (纸本)1595933743

While real-time garbage collection has achieved worst-case latencies on the order of a millisecond, this technology is approaching its practical limits. For tasks requiring extremely low latency, and especially periodic tasks with frequencies above 1 KHz, Java programmers must currently resort to the NoHeapRealtimeThread construct of the Real-Time Specification for Java. This technique requires expensive run-time checks, can result in unpredictable low-level exceptions, and inhibits communication with the rest of the garbage-collected application. We present Eventrons, a programming construct that can arbitrarily preempt the garbage collector, yet guarantees safety and allows its data to be visible to the garbage-collected heap. Eventrons are a strict subset of Java, and require no run-time memory access checks. Safety is enforced using a data-sensitive analysis and simple run-time support with extremely low overhead. We have implemented Eventrons in IBM's J9 Java virtual machine, and present experimental results in which we ran Eventrons at frequencies up to 22 KHz (a 45 s period). Across 10 million periods, 99.997% of the executions ran within 10 ss of their deadline, compared to 99.999% of the executions of the equivalent program written in C. Copyright © 2006 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Profile-guided proactive garbage collection for locality optimization 06

Profile-guided proactive garbage collection for locality opt...

引用

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

作者： Chen, Wen-Ke Bhansali, Sanjay Chilimbi, Trishul Gao, Xiaofeng Chuang, Weihaw Microsoft Research One Microsoft Way Redmond WA 98052 United States Dept. of Computer Science and Engineering University of California at San Diego San Diego CA 92093 United States

ISBN: (纸本)1595933743

Many applications written in garbage collected languages have large dynamic working sets and poor data locality. We present a new system for continuously improving program data locality at run time with low overhead. Our system proactively reorganizes the heap by leveraging the garbage collector and uses profile information collected through a low-overhead mechanism to guide the reorganization at run time. The key contributions include making a case that garbage collection should be viewed as a proactive technique for improving data locality by triggering garbage collection for locality optimization independently of normal garbage collection for space, combining page and cache locality optimization in the same system, and demonstrating that sampling provides sufficiently detailed data access information to guide both page and cache locality optimization with low runtime overhead. We present experimental results obtained by modifying a commercial, state-of-the-art garbage collector to support our claims. Independently triggering garbage collection for locality optimization significantly improved optimizations benefits. Combining page and cache locality optimizations in the same system provided larger average execution time improvements (17%) than either alone (page 8%, cache 7%). Finally, using sampling limited profiling overhead to less than 3%, on average. Copyright © 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Practical dynamic software updating for C 06

Practical dynamic software updating for C

引用

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

作者： Neamtiu, Iulian Hicks, Michael Stoyle, Gareth Oriol, Manuel University of Maryland United States University of Cambridge United Kingdom ETH Zurich Switzerland

ISBN: (纸本)1595933743

Software updates typically require stopping and restarting an application, but many systems cannot afford to halt service, or would prefer not to. Dynamic software updating (DSU) addresses this difficulty by permitting programs to be updated while they run. DSU is appealing compared to other approaches for on-line upgrades because it is quite general and requires no redundant hardware. The challenge is in making DSU practical: it should be flexible, and yet safe, efficient, and easy to *** this paper, we present Ginseng, a DSU implementation for C that aims to meet this challenge. We compile programs specially so that they can be dynamically patched, and generate most of a dynamic patch automatically. Ginseng performs a series of analyses that when combined with some simple runtime support ensure that an update will not violate type-safety while guaranteeing that data is kept up-to-date. We have used Ginseng to construct and dynamically apply patches to three substantial open-source server programs - -Very Secure FTP daemon, OpenSSH sshd daemon, and GNU Zebra. In total, we dynamically patched each program with three years' worth of releases. Though the programs changed substantially, the majority of updates were easy to generate. Performance experiments show that all patches could be applied in less than 5 ms, and that the overhead on application throughput due to updating support ranged from 0 to at most 32%. Copyright © 2006 ACM.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：