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

proceedings of the Twenty-Third Annual Hawaii International conference on System Sciences. Volume 1: Architecture Track

作者： Tenazas, R.A. Concepcion, A.I. Villafuerte, R.M. Software Brewers Inc Makati Philippines

ISBN: (纸本)0818620099

The authors present the Delphi project, which deals with the design and implementation of a software engineering environment (SEE) to enhance software productivity, in particular, one that targets information systems (IS) for business data processsing problems. A set of specification languages was designed to specify the IS in a modular manner. Collectively, these languages are called the data processing specification outlining language (DPSOL). DPSOL is customizable, executable, extensible, and translatable and can be used in rapid prototyping or in automatic translation to a target 3GL/environment. The authors present the expressive power of DPSOL to specify the IS, and its automated process of checking referential integrity and computational consistency. The approach is translational (using templates) instead of transformational. It was found that templating is a powerful concept in automatic programming, at least for IS. The templates can be edited and modified to generate customized 3GL source code. Moreover, documentation can also be automatically generated.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

ICE™ and ICE/T™: Tools to assist in compiler design and implementation 04

ICE™ and ICE/T™: Tools to assist in compiler design and im...

引用

Working Group Reports from ITiCSE on Innovation and Technology in Computer Science Education, ITiCSE-WGR '04

作者： Boyer, Truman Parks Chitsaz, Mohsen Department of Computer Science Frostburg State University Frostburg MD 21532 United States

ISBN: (纸本)9781450377942

ICE (Intermediate Code Engine) and ICE/T (ICE/Translator) are compiler back ends that execute on a Java Virtual Machine (JVM). They allow the student to complete a working compiler quickly and can execute on any platform that supplies a JVM. ICE is a quadruple interpreter that executes ICE code directly, and includes an assembler, which a builder can use to side-step most symbol management issues. ICE/T is a translator that accepts ICE assembly code as input, and generates an equivalent Java class file as output. This paper advocates the use of these tools in compiler implementation courses.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Latte: A language, Compiler, and Runtime for Elegant and Efficient Deep Neural Networks

引用

acm sigplan NOTICES 2016年第6期51卷 209-223页

作者： Truong, Leonard Barik, Rajkishore Totoni, Ehsan Liu, Hai Markley, Chick Fox, Armando Shpeisman, Tatiana Univ Calif Berkeley Intel Labs Berkeley CA USA Intel Labs Berkeley CA USA Univ Calif Berkeley Berkeley CA USA

Deep neural networks (DNNs) have undergone a surge in popularity with consistent advances in the state of the art for tasks including image recognition, natural language processing, and speech recognition. The computationally expensive nature of these networks has led to the proliferation of implementations that sacrifice abstraction for high performance. In this paper, we present Latte, a domain-specific language for DNNs that provides a natural abstraction for specifying new layers without sacrificing performance. Users of Latte express DNNs as ensembles of neurons with connections between them. The Latte compiler synthesizes a program based on the user specification, applies a suite of domain-specific and general optimizations, and emits efficient machine code for heterogeneous architectures. Latte also includes a communication runtime for distributed memory data-parallelism. Using networks described using Latte, we demonstrate 3-6x speedup over Caffe (C++/MKL) on the three state-of-the-art ImageNet models executing on an Intel Xeon E5-2699 v3 x86 CPU.

关键词： Deep Learning Neural Networks Domain Specific language Compiler Optimization

来源：评论

学校读者我要写书评

暂无评论

Valgrind: A framework for heavyweight dynamic binary instrumentation

引用

acm sigplan NOTICES 2007年第6期42卷 89-100页

作者： Nethercote, Nicholas Seward, Julian Natl ICT Australia Melbourne Vic Australia OpenWorks LLP Cambridge England

Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance;little attention has been paid to their capabilities. As a result, we believe the potential of DBI has not been fully exploited. In this paper we describe Valgrind, a DBI framework designed for building heavyweight DBA tools. We focus on its unique support for shadow values - a powerful but previously little-studied and difficult-to-implement DBA technique, which requires a tool to shadow every register and memory value with another value that describes it. This support accounts for several crucial design features that distinguish Valgrind from other DBI frameworks. Because of these features, lightweight tools built with Valgrind run comparatively slowly, but Valgrind can be used to build more interesting, heavyweight tools that are difficult or impossible to build with other DBI frameworks such as Pin and DynamoRIO.

关键词： design performance experimentation Valgrind Memcheck dynamic binary instrumentation dynamic binary analysis shadow values

来源：评论

学校读者我要写书评

暂无评论

P: Safe Asynchronous Event-Driven programming 13

P: Safe Asynchronous Event-Driven Programming

引用

acm sigplan conference on programming language design and implementation

作者： Ankush Desai Vivek Gupta Ethan Jackson Shaz Qadeer Sriram Rajamani Damien Zufferey Microsoft IST Austria

ISBN: (纸本)9781450320146

We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhandled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.

关键词： Domain-specific language Device driver Event-driven programming State machine Verification Systematic testing state machines Computer personnel event-driven programming Verification device drivers Phosphorus Executable code Device Programmer Component application-specific language language Microsoft Windows(software)

来源：评论

学校读者我要写书评

暂无评论

Fast Algorithms for Dyck-CFL-Reachability with Applications to Alias Analysis 13

Fast Algorithms for Dyck-CFL-Reachability with Applications ...

引用

acm sigplan conference on programming language design and implementation

作者： Qirun Zhang Michael R. Lyu Hao Yuan Zhendong Su The Chinese University of Hong Kong BOPU Technologies University of California

ISBN: (纸本)9781450320146

The context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practice, many program analyses, especially pointer analyses, adopt a restricted version of CFL-reachability, Dyck-CFL-reachability, and compute on edge-labeled bidirected graphs. Solving the all-pairs Dyck-CFL-reachability on such bidirected graphs is expensive. For a bidirected graph with n nodes and m edges, the traditional dynamic programming style algorithm exhibits a subcubic time complexity for the Dyck language with k kinds of parentheses. When the underlying graphs are restricted to bidirected trees, an algorithm with O(n log n log k) time complexity was proposed recently. This paper studies the Dyck-CFL-reachability problems on bidirected trees and graphs. In particular, it presents two fast algorithms with O(n) and O(n + m log m) time complexities on trees and graphs respectively. We have implemented and evaluated our algorithms on a state-of-the-art alias analysis for Java. Results on standard benchmarks show that our algorithms achieve orders of magnitude speedup and consume less memory.

关键词： Dyck-CFL-reachability Alias analysis Algorithms design Experimentation languages algorithms language experimentation analysis programme complexity classes Parentheses logs logarithm (log)

来源：评论

学校读者我要写书评

暂无评论

The exo VM system for automatic VM and application reduction

引用

acm sigplan NOTICES 2007年第6期42卷 352-362页

作者： Titzer, Ben L. Auerbach, Joshua Bacon, David F. Palsberg, Jens Univ Calif Los Angeles Compilers Grp Los Angeles CA 90025 USA

Embedded systems pose unique challenges to Java application developers and virtual machine designers. Chief among these challenges is the memory footprint of both the virtual machine and the applications that run within it. With the rapidly increasing set of features provided by the Java language, virtual machine designers are often forced to build custom implementations that make various tradeoffs between the footprint of the virtual machine and the subset of the Java language and class libraries that are supported. In this paper, we present the Exo VM, a system in which an application is initialized in a fully featured virtual machine, and then the code, data, and virtual machine features necessary to execute it are packaged into a binary image. Key to this process is feature analysis, a technique for computing the reachable code and data of a Java program and its implementation inside the VM simultaneously. The Exo VM reduces the need to develop customized embedded virtual machines by reusing a single VM infrastructure and automatically eliding the implementation of unused Java features on a per-program basis. We present a constraint-based instantiation of the analysis technique, an implementation in IBM's J9 Java VM, experiments evaluating our technique for the EEMBC benchmark suite, and some discussion of the individual costs of some of Java's features. Our evaluation shows that our system can reduce the non-heap memory allocation of the virtual machine by as much as 75%. We discuss VM and language design decisions that our work shows are important in targeting embedded systems, supporting the long-term goal of a common VM infrastructure spanning from motes to large servers.

关键词： pre-initialization embedded systems persistence dead code elimination static compilation static analysis VM design VM modularity feature analysis

来源：评论

学校读者我要写书评

暂无评论

Non-null references by default in the Java Modeling language

Non-null references by default in the Java Modeling Language

引用

2005 conference on Specification and Verification of Component-Based Systems, SAVCBS 2005

作者： Chalin, Patrice Rioux, Frédéric Dept. of Computer Science and Software Engineering Dependable Software Research Group Concordia University 1455 de Maisonneuve Blvd. West MontréalQCH3G 1M8 Canada

ISBN: (纸本)1595933719

Based on our experiences and those of our peers, we hypothesized that in Java code, the majority of declarations that are of reference types are meant to be non-null. Unfortunately, the Java Modeling language (JML), like most interface specification and object-oriented programming languages, assumes that such declarations are possibly-null by default. As a consequence, developers need to write specifications that are more verbose than necessary in order to accurately document their module interfaces. In practice, this results in module interfaces being left incompletely and inaccurately specified. In this paper we present the results of a study that confirms our hypothesis. Hence, we propose an adaptation to JML that preserves its language design goals and that allows developers to specify that declarations of reference types are to be interpreted as non-null by default. We explain how this default is safer and results in less writing on the part of specifiers than null-by-default. The paper also reports on an implementation of the proposal in some of the JML tools. © 2005 acm.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

design and verification of real-time systems 2

Design and verification of real-time systems

引用

2nd International conference on Software Engineering, ICSE 1976

作者： Phillips, Jorge V. Bredt, Thomas H. Artificial Intelligence Laboratory Stanford University United States Digitai Systems Laboratory Stanford University Hewlett-Packard Company United States

This paper presents a methodology for the design and verification of a class of real-time systems frequently encountered in applications of digital control. These methodologies are described in the form of a design and informal verification of a system used for navigation control of airborne vehicles. The high reliability standards required for such tasks suggest the use of fault-tolerant hardware and software. A design is presented for both an abstract version of the system running in an ideal environment and for a version running in a non-ideal fault-prone one. A specification language for real-time systems is developed as an extension of the programming language PASCAL, that provides for concise and clear system descriptions while preserving the degree of efficiency and portability needed to qualify as a practical high-level system implementation language. An informal verification of both designs is given. © 1976 IEEE Computer Society. All rights reserved.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Reasoning about continuations with control effects

引用

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

作者： Jouvelot, Pierre Gifford, David K. Ecole des Mines France

We present a new static analysis method for first-class continuations that uses an effect system to classify the control domain behavior of expressions in a typed polymorphic language. We introduce two new control effects, goto and comefrom, that describe the control flow properties of expressions. An expression that does not have a goto effect is said to be continuation following because it will always call its passed return continuation. An expression that does not have a comefrom effect is said to be continuation discarding because it will never preserve its return continuation for later use. Unobservable control effects can be masked by the effect system. Control effect soundness theorems guarantee that the effects computed statically by the effect system are a conservative approximation of the dynamic behavior of an expression.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：