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

13th International conference on Architectural Support for programming languages and Operating Systems

作者： Li, Man-Lap Ramachandran, Pradeep Sahoo, Swarup K. Adve, Sarita V. Adve, Vikram S. Zhou, Yuanyuan Univ Illinois Dept Comp Sci Urbana IL 61801 USA

ISBN: (纸本)9781595939586

With continued CMOS scaling, future shipped hardware will be increasingly vulnerable to in-the-field faults. To be broadly deployable, the hardware reliability solution must incur low overheads, precluding use of expensive redundancy. We explore a cooperative hardware-software solution that watches for anomalous software behavior to indicate the presence of hardware faults. Fundamental to such a solution is a characterization of how hardware faults in different micro architectural structures of a modern processor propagate through the application and OS. This paper aims to provide such a characterization, resulting in identifying low-cost detection methods and providing guidelines for implementation of the recovery and diagnosis components of such a reliability solution. We focus on hard faults because they are increasingly important and have different system implications than the much studied transients. We achieve our goals through fault injection experiments with a micro architecture-level full system timing simulator. Our main results are: (1) we are able to detect 95% of the unmasked faults in 7 out of 8 studied micro architectural structures with simple detectors that incur zero to little hardware overhead;(2) over 86% of these detections are within latencies that existing hardware checkpointing schemes can handle, while others require software checkpointing;and (3) a surprisingly large fraction of the detected faults corrupt OS state, but almost all of these are detected with latencies short enough to use hardware checkpointing, thereby enabling OS recovery in virtually all such cases.

关键词： reliability experimentation design error detection architecture permanent fault fault injection

来源：评论

学校读者我要写书评

暂无评论

Finding application errors and security flaws using PQL: A program query language

Finding application errors and security flaws using PQL: A p...

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Martin, Michael Livshits, Benjamin Lam, Monica S. Computer Science Department Stanford University

A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules, An important class of design rules deals with sequences of events associated with a set of related objects. This paper presents a language called PQL (Program Query language) that allows programmers to express such questions easily in an application-specific context. A query looks like a code excerpt corresponding to the shortest amount of code that would violate a design rule. Details of the target application's precise implementation are abstracted away. The programmer may also specify actions to perform when a match is found, such as recording relevant information or even correcting an erroneous execution on the fly. We have developed both static and dynamic techniques to find solutions to PQL queries, Our static analyzer finds all potential matches conservatively using a context-sensitive, flow-insensitive, inclusion-based pointer alias analysis, Static results are also useful in reducing the number of instrumentation points for dynamic analysis. Our dynamic analyzer instruments the source program to catch all violations precisely as the program runs and to optionally perform user-specified actions. We have implemented the techniques described in this paper and found 206 errors in 6 large real-world open-source Java applications containing a total of nearly 60,000 classes. These errors are important security flaws, resource leaks, and violations of consistency invariants. The combination of static and dynamic analysis proves effective at addressing a wide range of debugging and program comprehension queries. We have found that dynamic analysis is especially suitable for preventing errors such as security vulnerabilities at runtime. Copyright 2005 acm.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

OO techniques applied to a real-time, embedded, spaceborne application

OO techniques applied to a real-time, embedded, spaceborne a...

引用

21st Annual acm sigplan conference on Object-oriented programming Systems, languages, and Applications, OOPSLA 2006

作者： Murray, Alexander T. Shahabuddin, Mohammad Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Drive Pasadena CA 91109

ISBN: (纸本)159593491X

Though Object-Oriented Analysis, design, and languages have become the dominant practices in many, or most, domains of software engineering, concerns about complexity, size, and performance in the embedded, real-time software domain have led to a prevalent view that OO technology is not suitable for the domain. We challenge this view through a successful application of OOA, OOD, and C++ (including STL) in the embedded, real-time flight software in an Earth-orbiting science instrument named Aquarius (see [1]). We've found that OOA and OOD with UML actually enhance communication with systems and hardware engineers. We also found that C++, thoughtfully used, need not lead to code bloat, and that its performance is every bit as good as that of C. We egin with an overview of the requirements and describe our overall use of UML modeling, followed by a discussion of the use of UML for Object-Oriented Analysis with use cases. Then the application of UML for high-level and detailed design, the use of frameworks supporting a component architecture and multi-platform execution, and code generation from UML detailed design are described. We also present the use of UML for organizing and designing and documenting our verification and test environment and scenarios, and using HTML, generated by our UML tool, for all documentation and for requirement traceability. Finally, we discuss the use of C++ as the implementation language, and give an overview of status and work metrics.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Escape analysis on lists

Escape analysis on lists

引用

acm sigplan '92 conference on programming language design and implementation, PLDI 1992

作者： Park, Young Gil Goldberg, Benjamin New York Univ New York City NY United States

ISBN: (纸本)0897914759

Higher order functional programs constantly allocate objects dynamically. These objects are typically cons cells, closures, and records and are generally allocated in the heap and reclaimed later by some garbage collection process. This paper describes a compile time analysis, called escape analysis, for determining the lifetime of dynamically created objects in higher order functional programs, and describes optimizations that can be performed, based on the analysis, to improve storage allocation and reclamation of such objects. In particular, our analysis can be applied to programs manipulating lists, in which case optimizations can be performed to allow cons cells in spines of lists to be either reclaimed immediately or reused without incurring any garbage collection overhead. In a previous paper on escape analysis, we had left open the problem of performing escape analysis on lists. Escape analysis simply determines when the argument (or some part of the argument) to a function call is returned by that call. This simple piece of information turns out to be sufficiently powerful to allow stack allocation of objects, compile-time garbage collection, reduction of run-time storage reclamation overhead, and other optimizations that are possible when the lifetimes of objects can be computed statically. Our approach is to define a high-level non-standard semantics that, in many ways, is similar to the standard semantics and captures the escape behavior caused by the constructs in a functional language. The advantage of our analysis lies in its conceptual simplicity and portability (i.e. no assumption is made about an underlying abstract machine).

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

design and implementation of transactional constructs for C/C++ 08

Design and implementation of transactional constructs for C/...

引用

23rd acm conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 2008

作者： Ni, Yang Welc, Adam Adl-Tabatabai, Ali-Reza Bach, Moshe Berkowits, Sion Cownie, James Geva, Robert Kozhukow, Sergey Narayanaswamy, Ravi Olivier, Jeffrey Preis, Serguei Saha, Bratin Tal, Ady Tian, Xinmin Intel Corporation Santa Clara CA USA Intel Corporation Haifa Israel Intel Corporation Glasgow United Kingdom Intel Corporation Novosibirsk Russian Fed. Intel Corporation Champaign IL USA Intel Coporation Novosibirsk Russian Fed.

ISBN: (纸本)9781605582153

This paper presents a software transactional memory system that introduces first-class C++ language constructs for transactional programming. We describe new C++ language extensions, a production-quality optimizing C++ compiler that translates and optimizes these extensions, and a high-performance STM runtime library. The transactional language constructs support C++ language features including classes, inheritance, virtual functions, exception handling, and templates. The compiler automatically instruments the program for transactional execution and optimizes TM overheads. The runtime library implements multiple execution modes and implements a novel STM algorithm that supports both optimistic and pessimistic concurrency control. The runtime switches a transaction's execution mode dynamically to improve performance and to handle calls to precompiled functions and I/O libraries. We present experimental results on 8 cores (two quad-core CPUs) running a set of 20 non-trivial parallel programs. Our measurements show that our system scales well as the numbers of cores increases and that our compiler and runtime optimizations improve scalability. Copyright © 2008 acm.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Experience report: Functional programming in C-Rules

引用

acm sigplan NOTICES 2007年第9期42卷 25-28页

作者： Wazny, Jeremy Constraint Technol Int Melbourne Vic 3000 Australia

C-Rules is a business rules management system developed by Constraint Technologies International(1) (CTI), designed for use in transportation problems. Users define rules describing various aspects of a problem, such as solution costs and legality, which are then queried from a host application, typically an optimising solver. At its core, C-Rules provides a functional expression language which affords users both power and flexibility when formulating rules. In this paper we will describe our experiences of using functional programming both at the end-user level, as well as at the implementation level. We highlight some of the benefits we, and the product's users, have enjoyed from the decision to base our rule system on features such as: higher-order functions, referential transparency, and static, polymorphic typing. We also outline some of our experiences in using Haskell to build an efficient compiler for the core language.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Static single assignment form for machine code

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 204-214页

作者： Leung, Allen George, Lal New York Univ New York NY United States

Static Single Assignment (SSA) is an effective intermediate representation in optimizing compilers. However, traditional SSA form and optimizations are not applicable to programs represented as native machine instructions because the use of dedicated registers imposed by calling conventions, the runtime system, and target architecture must be made explicit. We present a simple scheme for converting between programs in machine code and in SSA, such that references to dedicated physical registers in machine code are preserved. Our scheme ignores all output- and anti-dependences imposed by physical registers while a program is in SSA form, but inserts compensation code during machine code reconstruction if any naming requirements have been violated. By resolving all mismatches between the two representations in separate phases, we are able to utilize existing SSA algorithms unaltered to perform machine code optimizations.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

The composition of abstractions: Evolution of software component design with Ada 95

The composition of abstractions: Evolution of software compo...

引用

International conference on TRI-Ada 1995: Ada's Role in Global Markets: Solutions for a Changing Complex World, TRI-Ada 1995

作者： Kempe, Magnus Swiss Federal Institute of Technology in Lausanne Software Engineering Laboratory EPFL-DI-LGL LausanneCH-1015 Switzerland

ISBN: (纸本)0897917057

Ada 95 adds many new, powerful constructs to the ones Ada 83 already offered. From the perspective of a designer and implementor of Ada software components, this should encourage an evolution in the architecture of component families, and from the perspective of the user the improvements must be understood. This paper describes evolutionary issues in designing reusable components, indicates potential directions to update the matrix of component properties, and examines some general design options and problems. Finally, a sample family of components is presented as a case study. The conclusion is that Ada 95 helps solve many advanced and complex issues in the design and implementation of adaptable software components, benefitting both designers and users of reusable component libraries. © 1995 acm.

关键词： Chemical analysis

来源：评论

学校读者我要写书评

暂无评论

LaSEWeb: Automating Search Strategies over Semi-structured Web Data 14

LaSEWeb: Automating Search Strategies over Semi-structured W...

引用

20th acm SIGKDD International conference on Knowledge Discovery and Data Mining (KDD)

作者： Polozov, Oleksandr Gulwani, Sumit Univ Washington Seattle WA 98195 USA Microsoft Res Mountain View CA USA

ISBN: (纸本)9781450329569

We show how to programmatically model processes that humans use when extracting answers to queries (e.g., "Who invented typewriter?", "List of Washington national parks") from semi-structured Web pages returned by a search engine. This modeling enables various applications including automating repetitive search tasks, and helping search engine developers design micro-segments of factoid questions. We describe the design and implementation of a domain-specific language that enables extracting data from a webpage based on its structure, visual layout, and linguistic patterns. We also describe an algorithm to rank multiple answers extracted from multiple webpages. On 100,000+ queries (across 7 micro-segments) obtained from Bing logs, our system LASEWEB answered queries with an average recall of 71%. Also, the desired answer(s) were present in top-3 suggestions for 95%+ cases.

关键词： Semi-structured data domain-specific languages structure extraction Web programming question answering

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability

A practical type system and language for reference immutabil...

引用

19th conference on Object-Oriented programming, Systems, languages, and Applications

作者： Birka, A Ernst, MD MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. The abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. The type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. This paper describes the design and implementation of Javari, including the type-checking rules for the language. This paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： type system verification immutability readonly mutable Javari Java const

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：