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

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

来源：评论

学校读者我要写书评

暂无评论

Accurate garbage collection in an uncooperative environment

引用

acm sigplan NOTICES 2003年第2期38卷 256-262页

作者： Henderson, F Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia

Previous attempts at garbage collection in uncooperative environments have generally used conservative or mostly-conservative approaches. We describe a technique for doing fully type-accurate garbage collection in an uncooperative environment, using a "shadow stack" to link structs of pointer-containing variables, together with the data or code needed to trace them. We have implemented this in the Mercury compiler, which generates C code, and present preliminary performance data on the overheads of this technique. We also show how this technique can be extended to handle multithreaded applications.

关键词： algorithms design experimentation measurement performance reliability languages garbage collection programming language implementation multithreading C

来源：评论

学校读者我要写书评

暂无评论

The GNAT implementation of controlled types

The GNAT implementation of controlled types

引用

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

作者： Comar, Cyrille Dismukes, Gary Gasperoni, Franco Ada Core Technologies 73 Fifth Avenue New YorkNY10003 United States Ada Core Technologies 10397 Avenida Magnifica San DiegoCA92131 United States Telecom Paris-ENST Dep. INF 46 rue Barrault Paris Cedex 1375634 France

ISBN: (纸本)0897917057

This paper discusses the implementation model for supporting Ada 95 controlled types in the GNAT compiler [1]. After reviewing the semantics of controlled types, we outline the associated implementation problems and describe their solution in GNAT. The design addresses the management of controlled operations on various entities, including dynamically allocated objects, transient objects (function results and aggregates), and composite objects containing controlled components. The interaction of the controlled type features with exceptions is also covered. Finally, we discuss alternative implementation approaches and possible enhancements to the current model. © 1995 acm.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

design OF A FLEXIBLE DISTRIBUTED TESTBED FOR COMMUNICATION SYSTEMS.

DESIGN OF A FLEXIBLE DISTRIBUTED TESTBED FOR COMMUNICATION S...

引用

proceedings of the Twenty-First Annual Hawaii International conference on System Sciences. Volume II: Software Track.

作者： Thoet, William Hauser, James Baker, Dennis Jaycor Jaycor

ISBN: (纸本)0818608420

The structure and design of a simulation testbed for communication systems are described. The testbed, which is called the Distributed Simulation and Prototyping Testbed (DSPT), models the physical-layer activities of communication networks with a design that facilitates the addition of higher-layer protocols either as part of the simulation program itself or as prototype software that can execute concurrently with the simulation on a separate machine. As is typical of R&D systems, the DSPT requirements have evolved with the projects that it supports. The author shows some of the benefits of developing software using the object-oriented methodology in the dynamic R&D environment. The design involved extensions to the Simula programming language, which were easily implemented using Simula's class inheritance capability. The author explores these extensions and discusses further needs of the Simula language that appeared during the implementation of the DPST.

关键词： TELECOMMUNICATION SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reconciling Exhaustive Pattern Matching with Objects 13

Reconciling Exhaustive Pattern Matching with Objects

引用

acm sigplan conference on programming language design and implementation

作者： Chinawat Isradisaikul Andrew C. Myers Department of Computer Science Cornell University

ISBN: (纸本)9781450320146

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting; however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

关键词： JMatch Pattern matching Named constructor Equality constructor Matching specification Exhaustiveness Redundancy Modal abstraction Java Data abstraction Subtyping design Verification languages

来源：评论

学校读者我要写书评

暂无评论

Towards a Discipline of Dynamic programming 32

Towards a Discipline of Dynamic Programming

引用

32. Jahrestagung der Gesellschaft fur Informatik, Informatik bewegt, INFORMATIK 2002 - 32nd Annual conference of the German Informatics Society, Informatics Moves, INFORMATIK 2002

作者： Giegerich, Robert Meyer, Carsten Steffen, Peter Faculty of Technology Bielefeld University Postfach 10 01 31 Bielefeld33501 Germany

ISBN: (纸本)3885793482

Dynamic programming is a classic programming technique, applicable in a wide variety of domains, like stochastic systems analysis, operations research, combinatorics of discrete structures, flow problems, parsing ambiguous languages, or biosequence analysis. Yet, heretofore no methodology was available guiding the design of such algorithms. The matrix recurrences that typically describe a dynamic programming algorithm are difficult to construct, error-prone to implement, and almost impossible to debug. This article introduces an algebraic style of dynamic programming over sequence data. We define its formal framework including a formalization of Bellman's principle. We suggest a language for algorithm design on a convenient level of abstraction. We outline three ways of implementation, including an embedding in a lazy functional language. The workings of the new method are illustrated by a series of examples from diverse areas of computer science. © 2002 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Extreme programming of multi-agent systems

Extreme Programming of multi-agent systems

引用

proceedings of the 1st International Joint conference on Autonomous Agents and Multiagent Systems, AAMAS 2002

作者： Knublauch, Holger Res. Inst. for Appl. Knowledge Proc. FAW Helmholtzstr. 16 89081 Ulm Germany

ISBN: (纸本)9781581134803

The complexity of communication scenarios between agents make multi-agent systems difficult to build. Most of the existing Agent-Oriented Software Engineering methodologies face this complexity by guiding the developers through a rather waterfall-based process with a series of intermediate modeling artifacts. While these methodologies lead to executable prototypes relatively late and are expensive when requirements change, we explore a rather evolutionary approach with explicit support for change and rapid feedback. In particular, we apply Extreme programming, a modern agile methodology from object-oriented software technology, for the design and implementation of multi-agent systems. The only modeling artifacts that are being maintained in our approach are a process model with which domain experts and developers design and communicate agent application scenarios, and the executable agent source code including automated test cases. We have successfully applied our approach for the development of a prototypical multi-agent system for clinical information logistics.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

programming Ad-hoc Networks of mobile and resource-constrained devices

引用

acm sigplan NOTICES 2005年第6期40卷 249-260页

作者： Ni, Y Kremer, U Stere, A Iftode, L Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA

Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architecture poses new design challenges in programming models, languages, compilers, and runtime systems. This paper discusses SpatialViews, a high-level language designed for programming mobile devices connected through a wireless ad-hoc network. SpatialViews allows specification of virtual networks with nodes providing desired services and residing in interesting spaces. These nodes are discovered dynamically with user-specified time constraints and quality of result (QoR). The programming model supports "best-effort" semantics, i.e., different executions of the same program may result in "correct" answers of different quality. It is the responsibility of the compiler and runtime system to produce a high-quality answer for the particular network and resource conditions encountered during program execution. Four applications, which exercise different features of the SpatialViews language, are presented to demonstrate the expressiveness of the language and the efficiency of the compiler generated code. The applications are an application that collects and aggregates sensor data in network, an application that performs dynamic service installation, a mobile camera application that supports computation offloading for image understanding, and an augmented-reality (AR) Pacman game. The efficiency of the compiler generated code is verified through simulation and physical measurements. The reported results show that SpatialViews is an expressive and effective language for ad-hoc networks. In addition, compiler optimizations can significantly improve response times and energy consumption.

关键词： Ad-hoc Networks MANET location-awareness service discovery quality of result

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：