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

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

作者： Stichnoth, James M. Lueh, Guei-Yuan Cierniak, Michal Intel Corp Santa Clara United States

A high-performance implementation of a Java Virtual Machine requires a compiler to translate Java bytecodes into native instructions, as well as an advanced garbage collector (e.g., copying or generational). When the Java heap is exhausted and the garbage collector executes, the compiler must report to the garbage collector all live object references contained in physical registers and stack locations. Typical compilers only allow certain instructions (e.g., call instructions and backward branches) to be GC-safe;if GC happens at some other instruction, the compiler may need to advance execution to the next GC-safe point. Until now, no one has ever attempted to make every compiler-generated instruction GC-safe, due to the perception that recording this information would require too much space. This kind of support could improve the GC performance in multithreaded applications. We show how to use simple compression techniques to reduce the size of the GC map to about 20% of the generated code size, a result that is competitive with the best previously published results. In addition, we extend the work of Agesen, Detlefs, and Moss, regarding the so-called `JSR Problem' (the single exception to Java's type safety property), in a way that eliminates the need for extra runtime overhead in the generated code.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Experience with CST: programming and implementation

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 101-109页

作者： Horwat, Waldemar Chien, Andrew A. Dally, William J. MIT United States

CST is a programming language based on Smalltalk-802 that supports concurrency using locks, asynchronous messages, and distributed objects. In this paper, we describe CST: the language and its implementation. Example programs and initial programming experience with CST are described. Our implementation of CST generates native code for the J-machine, a fine-grained concurrent computer. Some compiler optimizations developed in conjunction with that implementation are also described.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

An instance of the application download pattern: The SPAIDS software loadera/erifier domain analysis and implementation

An instance of the application download pattern: The SPAIDS ...

引用

1997 conference on TRI-Ada, TRI-Ada 1997

作者： Riley, John D. Dungari, Sangiv Pritchett, William DCS Corporation 1330 Braddock Place AlexandriaVA22314 United States WarrenMI48397-5000 United States

ISBN: (纸本)0897919815

The requirement to obtain application software from an external source and correctly load on a potentially embedded target is a common problem in many domains. For example, a growing solution in an internet environment is the use of a Java "applet" loaded to a target Java Virtual Machine (JVM) implementation. Another applicable domain is embedded systems particularly Avionic and Vehicular Control software. Similar problems are common to all these domains. These include accessing an appropriate communications medium, authenticating that the application software is virus and tamper free, and verifying the load has occurred without error. We identify this 'as the Application Download Pattern. In the Vehicular Electronics (Vetronics) field this problem is referred to as the Software Loader/Verifier problem. We describe the SPAIDS Software Loader/Verifier (SUV) project, place it in the context of the general application download pattern, and then relate lessons learned in the SUV analysis and implementation to the general problem. The domain analysis is expressed using the Unified Modeling language Version 1.0 (UML). The implementation directly expresses the UML model making substantial use of the Object Oriented features of Ada 95. 1. Background - The SPAIDS SL/V Project When software was first introduced to Army Ground Combat Vehicles, an accessory, the Software Loader/Verifier (SUV) was introduced to load the battlefield system software into the vehicle. As the Ground Combat Vehicle (GCV) domain has grown with various types of vehicles manufactured to support specialized missions, multiple versions of the SLA' have emerged. Each type of Army GCV has its own SL/V associated with it This has resulted in specialized training for each type of SL/V, multiple baselines of software, high maintenance costs and a large number of total units to maintain. The objective of the SPAIDS SUV project is to perform domain analysis of various platforms, to generate domain specific softw

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

The DaCapo benchmarks: Java benchmarking development and analysis 06

The DaCapo benchmarks: Java benchmarking development and ana...

引用

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

作者： Blackburn, Stephen M. Garner, Robin Hoffmann, Chris Khang, Asjad M. Mckinley, Kathryn S. Bentzur, Rotem Diwan, Amer Feinberg, Daniel Frampton, Daniel Guyer, Samuel Z. Hirzel, Martin Hosking, Antony Jump, Maria Lee, Han Moss, J.Eliot B. Phansalkar, Aashish Stefanoví, Darko VanDrunen, Thomas Von Dincklage, Daniel Wiedermann, Ben Intel Australian National University University of Massachusetts Amherst University of Texas Austin University of New Mexico University of Colorado Tufts IBM TJ Watson Research Center Purdue University Wheaton College

ISBN: (纸本)1595933484

Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still use methodologies developed for C, C++, and Fortran. SPEC, the dominant purveyor of benchmarks, compounded this problem by institutionalizing these methodologies for their Java benchmark suite. This paper recommends benchmarking selection and evaluation methodologies, and introduces the DaCapo benchmarks, a set of open source, client-side Java benchmarks. We demonstrate that the complex interactions of (1) architecture, (2) compiler, (3) virtual machine, (4) memory management, and (5) application require more extensive evaluation than C, C++, and Fortran which stress (4) much less, and do not require (3). We use and introduce new value, time-series, and statistical metrics for static and dynamic properties such as code complexity, code size, heap composition, and pointer mutations. No benchmark suite is definitive, but these metrics show that DaCapo improves over SPEC Java in a variety of ways, including more complex code, richer object behaviors, and more demanding memory system requirements. This paper takes a step towards improving methodologies for choosing and evaluating benchmarks to foster innovation in system design and implementation for Java and other managed languages. Copyright © 2006 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

EventScript: An event-processing language based on regular expressions with actions

引用

acm sigplan NOTICES 2008年第7期43卷 111-120页

作者： Cohen, Norman H. Kalleberg, Karl Trygve IBM Thomas J Watson Res Ctr Hawthorne NY USA Univ Bergen N-5020 Bergen Norway

EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.

关键词： algorithms performance design experimentation languages theory event processing regular expressions reactive programs sensors actuators

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Transformations on Hierarchically Structured Data

引用

acm sigplan NOTICES 2016年第6期51卷 508-521页

作者： Yaghmazadeh, Navid Klinger, Christian Dillig, Isil Chaudhuri, Swarat Univ Texas Austin Austin TX 78712 USA Univ Freiburg Freiburg Germany Rice Univ Houston TX 77251 USA

This paper presents a new approach for synthesizing transformations on tree-structured data, such as Unix directories and XML documents. We consider a general abstraction for such data, called hierarchical data trees (HDTs) and present a novel example-driven synthesis algorithm for HDT transformations. Our central insight is to reduce the problem of synthesizing tree transformers to the synthesis of list transformations that are applied to the paths of the tree. The synthesis problem over lists is solved using a new algorithm that combines SMT solving and decision tree learning. We have implemented our technique in a system called HADES and show that HADES can automatically synthesize a variety of interesting transformations collected from online forums.

关键词： languages Program synthesis programming by example data transformations

来源：评论

学校读者我要写书评

暂无评论

Active information systems, from object-oriented design to Ada 95

Active information systems, from object-oriented design to A...

引用

1996 conference on TRI-Ada: Disciplined Software Development with Ada, TRI-Ada 1996

作者： Bari, M. Gabrini, P. Rolland, C. Zeroual, C.K. Labo MASI - CNRS UA 818 University of Pierre and Marie Curie Paris France CRIM 1801 McGill College avenue MontrealQC Canada University of Paris 1-Sorbonne Paris Cedex 05F-7523 1 France DMI University of Sherbrooke SherbrookeQC Canada University of Paris XII France

ISBN: (纸本)0897918088

We present an object-oriented design model and its mapping to Ada 95 in order to build Active Information Systems. This represents part of a methodology based, for each step of the software life cycle, on a model and a step-by-step process. Thus, analysis is based on (1) an extended Entity/Relationship model for the static aspects and (2) an event-driven model for the dynamic aspects, design is based on a particular object-oriented model and implementation is based on Ada. The main benefit of this approach is to achieve traceability and to foster reuse and weak coupling between software components. © 1996 acm.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Mace: language support for building distributed systems

引用

acm sigplan NOTICES 2007年第6期42卷 179-188页

作者： Killian, Charles Anderson, James W. Braud, Ryan Jhala, Ranjit Vahdat, Amin Univ Calif San Diego La Jolla CA 92093 USA

Building distributed systems is particularly difficult because of the asynchronous, heterogeneous, and failure-prone environment where these systems must run. Tools for building distributed systems must strike a compromise between reducing programmer effort and increasing system efficiency. We present Mace, a C++ language extension and source-to-source compiler that translates a concise but expressive distributed system specification into a C++ implementation. Mace overcomes the limitations of low-level languages by providing a unified framework for networking and event handling, and the limitations of high-level languages by allowing programmers to write program components in a controlled and structured manner in C++. By imposing structure and restrictions on how applications can be written, Mace supports debugging at a higher level, including support for efficient model checking and causal-path debugging. Because Mace programs compile to C++, programmers can use existing C++ tools, including optimizers, profilers, and debuggers to analyze their systems.

关键词： languages reliability performance Mace domain specific languages model checking debugging distributed systems concurrency event driven programming

来源：评论

学校读者我要写书评

暂无评论

A certified type-preserving compiler from lambda calculus to assembly language

引用

acm sigplan NOTICES 2007年第6期42卷 54-65页

作者： Chlipala, Adam Univ Calif Berkeley Berkeley CA 94720 USA

We present a certified compiler from the simply-typed lambda calculus to assembly language. The compiler is certified in the sense that it comes with a machine-checked proof of semantics preservation, performed with the Coq proof assistant. The compiler and the terms of its several intermediate languages are given dependent types that guarantee that only well-typed programs are representable. Thus, type preservation for each compiler pass follows without any significant "proofs" of the usual kind. Semantics preservation is proved based on denotational semantics assigned to the intermediate languages. We demonstrate how working with a type-preserving compiler enables type-directed proof search to discharge large parts of our proof obligations automatically.

关键词： languages verification compiler verification interactive proof assistants dependent types denotational semantics

来源：评论

学校读者我要写书评

暂无评论

The JastAdd Extensible Java Compiler

引用

acm sigplan NOTICES 2007年第10期42卷 1-17页

作者： Ekman, Torbjorn Hedin, Gorel Univ Oxford Programming Tools Grp Oxford England Lund Univ Dept Comp Sci S-22100 Lund Sweden

The JastAdd Extensible Java Compiler is a high quality Java compiler that is easy to extend in order to build static analysis tools for Java, and to extend Java with new language constructs. It is built modularly, with a Java 1.4 compiler that is extended to a Java 5 compiler. Example applications that are built as extensions include an alternative backend that generates Jimple, an extension of Java with AspectJ constructs, and the implementation of a pluggable type system for non-null checking and inference. The system is implemented using JastAdd, a declarative Java-like language. We describe the compiler architecture, the major design ideas for building and extending the compiler, in particular, for dealing with complex extensions that affect name and type analysis. Our extensible compiler compares very favorably concerning quality, speed and size with other extensible Java compiler frameworks. It also compares favorably in quality and size compared with traditional non-extensible Java compilers, and it runs within a factor of three compared to javac.

关键词： design languages OOP compilers extensibility declarative frameworks modularity Java

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：