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

acm sigplan NOTICES 2016年第6期51卷 296-309页

作者： Kent, Andrew M. Kempe, David Tobin-Hochstadt, Sam Indiana Univ Bloomington IN 47405 USA

We present a new type system combining occurrence typing- a technique previously used to type check programs in dynamically-typed languages such as Racket, Clojure, and JavaScript-with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical propositions from external theories. By building on occurrence typing, we can add our enriched type system as a natural extension of Typed Racket, reusing its core while increasing its expressiveness. The result is a well-tested type system with a conservative, decidable core in which types may depend on a small but extensible set of program terms. In addition to describing our design, we present the following: a formal model and proof of correctness;a strategy for integrating new theories, with specific examples including linear arithmetic and bitvectors;and an evaluation in the context of the full Typed Racket implementation. Specifically, we take safe vector operations as a case study, examining all vector accesses in a 56,000 line corpus of Typed Racket programs. Our system is able to prove that 50% of these are safe with no new annotations, and with a few annotations and modifications we capture more than 70%.

关键词： languages design Verification Refinement types occurrence typing Racket

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A design and Verification Methodology for Secure Isolated Regions

引用

acm sigplan NOTICES 2016年第6期51卷 665-681页

作者： Sinha, Rohit Costa, Manuel Lal, Akash Lopes, Nuno P. Rajamani, Sriram Seshia, Sanjit A. Vaswani, Kapil Univ Calif Berkeley Berkeley CA 94720 USA Microsoft Res London England Microsoft Res Bengaluru Karnataka India

Hardware support for isolated execution (such as Intel SGX) enables development of applications that keep their code and data confidential even while running on a hostile or compromised host. However, automatically verifying that such applications satisfy confidentiality remains challenging. We present a methodology for designing such applications in a way that enables certifying their confidentiality. Our methodology consists of forcing the application to communicate with the external world through a narrow interface, compiling it with runtime checks that aid verification, and linking it with a small runtime library that implements the interface. The runtime library includes core services such as secure communication channels and memory management. We formalize this restriction on the application as Information Release Confinement (IRC), and we show that it allows us to decompose the task of proving confidentiality into (a) one-time, human-assisted functional verification of the runtime to ensure that it does not leak secrets, (b) automatic verification of the application's machine code to ensure that it satisfies IRC and does not directly read or corrupt the runtime's internal state. We present/CONFIDENTIAL: a verifier for IRC that is modular, automatic, and keeps our compiler out of the trusted computing base. Our evaluation suggests that the methodology scales to real-world applications.

关键词： Enclave Programs Secure Computation Confidentiality Formal Verification

来源：评论

学校读者我要写书评

暂无评论

End-to-End Verification of Information-Flow Security for C and Assembly Programs

引用

acm sigplan NOTICES 2016年第6期51卷 648-664页

作者： Costanzo, David Shao, Zhong Gu, Ronghui Yale Univ New Haven CT 06520 USA

Protecting the confidentiality of information manipulated by a computing system is one of the most important challenges facing today's cybersecurity community. A promising step toward conquering this challenge is to formally verify that the end-to-end behavior of the computing system really satisfies various information-flow policies. Unfortunately, because today's system software still consists of both C and assembly programs, the end-to-end verification necessarily requires that we not only prove the security properties of individual components, but also carefully preserve these properties through compilation and cross-language linking. In this paper, we present a novel methodology for formally verifying end-to-end security of a software system that consists of both C and assembly programs. We introduce a general definition of observation function that unifies the concepts of policy specification, state indistinguishability, and whole-execution behaviors. We show how to use different observation functions for different levels of abstraction, and how to link different security proofs across abstraction levels using a special kind of simulation that is guaranteed to preserve state indistinguishability. To demonstrate the effectiveness of our new methodology, we have successfully constructed an end-to-end security proof, fully formalized in the Coq proof assistant, of a nontrivial operating system kernel (running on an extended CompCert x86 assembly machine model). Some parts of the kernel are written in C and some are written in assembly;we verify all of the code, regardless of language.

关键词： Verification Security Reliability languages design Information Flow Control Security Policy Specification Security-Preserving Simulation Program Verification Certified OS Kernels

来源：评论

学校读者我要写书评

暂无评论

Profile- Guided Meta-programming 15

Profile- Guided Meta-Programming

引用

36th acm sigplan conference on programming language design and implementation

作者： Bowman, William J. Miller, Swaha St-Amour, Vincent Dybvig, R. Kent Northeastern Univ Boston MA 02115 USA Cisco Syst Inc San Jose CA USA

ISBN: (纸本)9781450334686

Contemporary compiler systems such as GCC,. NET, and LLVM incorporate profile-guided optimizations (PGOs) on low-level intermediate code and basic blocks, with impressive results over purely static heuristics. Recent work shows that profile information is also useful for performing source-to-source optimizations via meta-programming. For example, using profiling information to inform decisions about data structures and algorithms can potentially lead to asymptotic improvements in performance. We present a design for profile-guided meta-programming in a general-purpose meta-programming system. Our design is parametric over the particular profiler and meta-programming system. We implement this design in two different meta-programming systems-the syntactic extensions systems of Chez Scheme and Racket- and provide several profile-guided meta-programs as usability case studies.

关键词： design Performance languages Optimization profiling profile-guided optimization PGO meta-programming

来源：评论

学校读者我要写书评

暂无评论

acm International conference Proceeding Series

ACM International Conference Proceeding Series

引用

8th Workshop on Network Simulator (ns-3), WNS3 2016

ISBN: (纸本)9781450342162

The proceedings contain 18 papers. The topics discussed include: design and implementation of the traffic control module in ns-3;implementation and evaluation of proportional integral controller enhanced (PIE) algorithm in ns-3;an implementation of scalable, Vegas, Veno, and YeAH congestion control algorithms in ns-3;TCP evaluation suite for ns-3;OFSwitch13: enhancing ns-3 with OpenFlow 1.3 support;analysis of programming language overhead in DCE;implementation and validation of an IEEE 802.11ah module for ns-3;implementation and evaluation of a WLAN IEEE 802.11ad model in ns-3;investigation and improvements to the OFDM Wi-Fi physical layer abstraction in ns-3;LL SimpleWireless: a controlled MAC/PHY wireless model to enable network protocol research;a realistic MAC and energy model for 802.15.4;a framework for end-to-end evaluation of 5G mmWave cellular networks in ns-3;ns-3 web-based user interface - power grid communications planning and modeling tool;getting Kodo: network coding for the ns-3 simulator;improving ns-3 emulation performance for fast prototyping of network protocols;ns-3 based framework for simulating communication based train control (CBTC) systems;implementation of 3d obstacle compliant mobility models for UAV networks in ns-3;and topology simulation for aeronautical communication protocols with ns-3 and DCE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Type-and-Example-Directed Program Synthesis 15

Type-and-Example-Directed Program Synthesis

引用

36th acm sigplan conference on programming language design and implementation

作者： Osera, Peter-Michael Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450334686

This paper presents an algorithm for synthesizing recursive functions that process algebraic datatypes. It is founded on proof-theoretic techniques that exploit both type information and input-output examples to prune the search space. The algorithm uses refinement trees, a data structure that succinctly represents constraints on the shape of generated code. We evaluate the algorithm by using a prototype implementation to synthesize more than 40 benchmarks and several non-trivial larger examples. Our results demonstrate that the approach meets or outperforms the state-of-the-art for this domain, in terms of synthesis time or attainable size of the generated programs.

关键词： languages Theory Functional programming Proof Search Program Synthesis Type Theory

来源：评论

学校读者我要写书评

暂无评论

Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO 15

Relaxing Safely: Verified On-the-Fly Garbage Collection for ...

引用

36th acm sigplan conference on programming language design and implementation

作者： Gammie, Peter Hosking, Antony L. Engelhardt, Kai Purdue Univ W Lafayette IN 47907 USA UNSW Sydney NSW Australia

ISBN: (纸本)9781450334686

We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency. The proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector. We couch the proof in a framework that system implementers will find appealing, with the fundamental components of the system specified in a simple and intuitive programming language. The abstract model is detailed enough for its correspondence with an assembly language implementation to be straightforward.

关键词： Algorithms design languages Reliability Verification formal verification machine-checked proof relaxed memory TSO

来源：评论

学校读者我要写书评

暂无评论

Asynchronous programming, analysis and testing with state machines 15

Asynchronous programming, analysis and testing with state ma...

引用

proceedings of the 36th acm sigplan conference on programming language design and implementation

作者： Deligiannis, Pantazis Donaldson, Alastair F. Ketema, Jeroen Lal, Akash Thomson, Paul Imperial College London United Kingdom Microsoft Research India

ISBN: (纸本)9781450334686

programming efficient asynchronous systems is challenging because it can often be hard to express the design declaratively, or to defend against data races and interleaving-dependent assertion violations. Previous work has only addressed these challenges in isolation, by either designing a new declarative language, a new data race detection tool or a new testing technique. We present P#, a language for high-reliability asynchronous programming co-designed with a static data race analysis and systematic concurrency testing infrastructure. We describe our experience using P# to write several distributed protocols and port an industrial-scale system internal to Microsoft, showing that the combined techniques, by leveraging the design of P#, are effective in finding bugs. © 2015 acm.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

Input Responsiveness: Using Canary Inputs to Dynamically Steer Approximation

引用

acm sigplan NOTICES 2016年第6期51卷 161-176页

作者： Laurenzano, Michael A. Hill, Parker Samadi, Mehrzad Mahlke, Scott Mars, Jason Tang, Lingjia Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

This paper introduces Input Responsive Approximation ( IRA), an approach that uses a canary input - a small program input carefully constructed to capture the intrinsic properties of the original input - to automatically control how program approximation is applied on an input-by-input basis. Motivating this approach is the observation that many of the prior techniques focusing on choosing how to approximate arrive at conservative decisions by discounting substantial differences between inputs when applying approximation. The main challenges in overcoming this limitation lie in making the choice of how to approximate both effectively (e.g., the fastest approximation that meets a particular accuracy target) and rapidly for every input. With IRA, each time the approximate program is run, a canary input is constructed and used dynamically to quickly test a spectrum of approximation alternatives. Based on these runtime tests, the approximation that best fits the desired accuracy constraints is selected and applied to the full input to produce an approximate result. We use IRA to select and parameterize mixes of four approximation techniques from the literature for a range of 13 image processing, machine learning, and data mining applications. Our results demonstrate that IRA significantly outperforms prior approaches, delivering an average of 10.2x speedup over exact execution while minimizing accuracy losses in program outputs.

关键词： Performance Runtime Systems Compilers Approximate Computing Performance Experimentation design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：