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

32nd acm sigplan conference on programming language design and implementation (PLDI 11)

作者： Li, Xun Tiwari, Mohit Oberg, Jason K. Kashyap, Vineeth Chong, Frederic T. Sherwood, Timothy Hardekopf, Ben Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450306638

Information flow is an important security property that must be incorporated from the ground up, including at hardware design time, to provide a formal basis for a system's root of trust. We incorporate insights and techniques from designing information-flow secure programming languages to provide a new perspective on designing secure hardware. We describe a new hardware description language, Caisson, that combines domain-specific abstractions common to hardware design with insights from type-based techniques used in secure programming languages. The proper combination of these elements allows for an expressive, provably-secure HDL that operates at a familiar level of abstraction to the target audience of the language, hardware architects. We have implemented a compiler for Caisson that translates designs into Verilog and then synthesizes the designs using existing tools. As an example of Caisson's usefulness we have addressed an open problem in secure hardware by creating the first-ever provably information-flow secure processor with micro-architectural features including pipelining and cache. We synthesize the secure processor and empirically compare it in terms of chip area, power consumption, and clock frequency with both a standard (insecure) commercial processor and also a processor augmented at the gate level to dynamically track information flow. Our processor is competitive with the insecure processor and significantly better than dynamic tracking.

关键词： Hardware Description language Non-interference State Machine

来源：评论

学校读者我要写书评

暂无评论

Dependent types in practical programming

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 214-227页

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main contribution of the paper lies in our language design, including the formulation of type-checking rules which makes the approach practical. To our knowledge, no previous type system for a general purpose programming language such as ML has combined dependent types with features including datatype declarations, higher-order functions, general recursions, let-polymorphism, mutable references, and exceptions. In addition, we have finished a prototype implementation of DML(C) for an integer constraint domain C, where constraints are linear inequalities (Xi and Pfenning 1998).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

implementation of complete, asynchronous, distributed garbage collection

Implementation of complete, asynchronous, distributed garbag...

引用

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Le Fessant, Fabrice Piumarta, Ion Shapiro, Marc INRIA Roquencourt Le Chesnay France

Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suffer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does not scale. We present a simple, complete, fault-tolerant, asynchronous extension to the (acyclic) cleanup protocol of the SSP Chains system. This extension is scalable, consumes few resources, and could easily be adapted to work in other reference-based distributed object systems - rendering them usable for very large-scale applications.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Flexible Object Layouts Enabling Lightweight language Extensions by Intercepting Slot Access 11

Flexible Object Layouts Enabling Lightweight Language Extens...

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Verwaest, Toon Lungu, Mircea Nierstrasz, Oscar Bruni, Camillo Univ Bern Software Composit Grp CH-3012 Bern Switzerland INRIA Lille Nord Europe RMoD Lille France

ISBN: (纸本)9781450309400

programming idioms, design patterns and application libraries often introduce cumbersome and repetitive boilerplate code to a software system. language extensions and external DSLs (domain specific languages) are sometimes introduced to reduce the need for boilerplate code, but they also complicate the system by introducing the need for language dialects and inter-language mediation. To address this, we propose to extend the structural reflective model of the language with object layouts, layout scopes and slots. Based on the new reflective language model we can 1) provide behavioral hooks to object layouts that are triggered when the fields of an object are accessed and 2) simplify the implementation of state-related language extensions such as stateful traits. By doing this we show how many idiomatic use cases that normally require boilerplate code can be more effectively supported. We present an implementation in Smalltalk, and illustrate its usage through a series of extended examples.

关键词： Reflection Smalltalk Structural Reflection Metaobject Protocol Traits

来源：评论

学校读者我要写书评

暂无评论

Parcae: A System for Flexible Parallel Execution 12

Parcae: A System for Flexible Parallel Execution

引用

33rd acm sigplan conference on programming language design and implementation

作者： Raman, Arun Zaks, Ayal Lee, Jae W. August, David I. Intel Res Santa Clara CA USA Intel Corp Haifa Israel Sungkyunkwan Univ Suwon South Korea Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450312059

Workload, platform, and available resources constitute a parallel program's execution environment. Most parallelization efforts statically target an anticipated range of environments, but performance generally degrades outside that range. Existing approaches address this problem with dynamic tuning but do not optimize a multiprogrammed system holistically. Further, they either require manual programming effort or are limited to array-based data-parallel programs. This paper presents Parcae, a generally applicable automatic system for platform-wide dynamic tuning. Parcae includes (i) the Nona compiler, which creates flexible parallel programs whose tasks can be efficiently reconfigured during execution;(ii) the Decima monitor, which measures resource availability and system performance to detect change in the environment;and (iii) the Morta executor, which cuts short the life of executing tasks, replacing them with other functionally equivalent tasks better suited to the current environment. Parallel programs made flexible by Parcae outperform original parallel implementations in many interesting scenarios.

关键词： design Performance automatic parallelization code generation compiler flexible multicore parallel performance portability run-time adaptivity tuning

来源：评论

学校读者我要写书评

暂无评论

A Play on Regular Expressions Functional Pearl 10

A Play on Regular Expressions Functional Pearl

引用

15th acm sigplan International conference on Functional programming

作者： Fischer, Sebastian Huch, Frank Wilke, Thomas Univ Kiel D-24098 Kiel Germany

ISBN: (纸本)9781605587943

Cody, Hazel, and Theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional;(ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like computing leftmost longest matchings or the number of matchings, all with a single algorithm;(iii) it is more powerful than other matchers, as it can be used for parsing every context-free language by taking advantage of laziness. The developed program is based on an old technique to turn regular expressions into finite automata which makes it efficient both in terms of worst-case time and space bounds and actual performance: despite its simplicity, the Haskell implementation can compete with a recently published professional C++ program for the same problem.

关键词： Algorithms design regular expressions finite automata Glushkov construction purely functional programming

来源：评论

学校读者我要写书评

暂无评论

Generating Safe Boundary APIs between Typed EDSLs and Their Environments 2015

Generating Safe Boundary APIs between Typed EDSLs and Their ...

引用

14th acm sigplan International conference on Generative-programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Reynders, Bob Devriese, Dominique Piessens, Frank Katholieke Univ Leuven iMinds Distrinet Leuven Belgium

ISBN: (纸本)9781450336871

Embedded domain specific languages (EDSLs) are used to represent special-purpose code in a general-purpose language and they are used for applications like vector calculations and run-time code generation. Often, code in an EDSL is compiled to a target (e.g. GPU languages, JVM bytecode, assembly, JavaScript) and needs to interface with other code that is available at that level but uses other data representations or calling conventions. We present an approach for safely making available such APIs in a typed EDSL, guaranteeing correct conversions between data representations and the respect for calling conventions. When the code being interfaced with is the result of static compilation of host language code, we propose a way to auto-generate the needed boilerplate using meta-programming. We instantiate our technique with JavaScript as the target language, JS-Scala as the EDSL, *** as the static compiler and Scala macros to generate the boilerplate, but our design is more generally applicable. We provide evidence of usefulness of our approach through a prototype implementation that we have applied in a non-trivial code base.

关键词： embedded domain specific languages Scala meta-programming

来源：评论

学校读者我要写书评

暂无评论

language Transformations in the Classroom 28

Language Transformations in the Classroom

引用

43rd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Cimini, Matteo Mourad, Benjamin Univ Massachusetts Lowell Lowell MA 01854 USA

language transformations are algorithms that take a language specification in input, and return the language specification modified. language transformations are useful for automatically adding features such as subtyping to programming languages (PLs), and for automatically deriving abstract machines. In this paper, we set forth the thesis that teaching programming languages features with the help of language transformations, in addition to the planned material, can be beneficial for students to help them deepen their understanding of the features being taught. We have conducted a study on integrating language transformations into an undergraduate PL course. We describe our study, the material that we have taught, and the exam submitted to students, and we present the results from this study. Although we refrain from drawing general conclusions on the effectiveness of language transformations, this paper offers encouraging data. We also offer this paper to inspire similar studies.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

DRFx: A Simple and Efficient Memory Model for Concurrent programming languages 10

DRFx: A Simple and Efficient Memory Model for Concurrent Pro...

引用

acm sigplan conference on programming language design and implementation

作者： Marino, Daniel Singh, Abhayendra Millstein, Todd Musuvathi, Madanlal Narayanasamy, Satish Univ Calif Los Angeles Los Angeles CA 90095 USA

ISBN: (纸本)9781450300193

The most intuitive memory model for shared-memory multi-threaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations thereby impacting performance. Data-race-free (DRF) models, such as the proposed C++0x memory model, guarantee SC execution for data-race-free programs. But these models provide no guarantee at all for racy programs, compromising the safety and debuggability of such programs. To address the safety issue, the Java memory model, which is also based on the DRF model, provides a weak semantics for racy executions. However, this semantics is subtle and complex, making it difficult for programmers to reason about their programs and for compiler writers to ensure the correctness of compiler optimizations. We present the DRFx memory model, which is simple for programmers to understand and use while still supporting many common optimizations. We introduce a memory model (MM) exception which can be signaled to halt execution. If a program executes without throwing this exception, then DRFx guarantees that the execution is SC. If a program throws an MM exception during an execution, then DRFx guarantees that the program has a data race. We observe that SC violations can be detected in hardware through a lightweight form of conflict detection. Furthermore, our model safely allows aggressive compiler and hardware optimizations within compiler-designated program regions. We formalize our memory model, prove several properties about this model, describe a compiler and hardware design suitable for DRFx, and evaluate the performance overhead due to our compiler and hardware requirements.

关键词： memory models sequential consistency data races memory model exception soft fences

来源：评论

学校读者我要写书评

暂无评论

Adaptive Input-aware Compilation for Graphics Engines 12

Adaptive Input-aware Compilation for Graphics Engines

引用

33rd acm sigplan conference on programming language design and implementation

作者： Samadi, Mehrzad Hormati, Amir Mehrara, Mojtaba Lee, Janghaeng Mahlke, Scott Univ Michigan Ann Arbor MI 48109 USA Microsoft Res Redmond WA USA NVIDIA Res Santa Clara CA USA

ISBN: (纸本)9781450312059

While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required to optimize applications is an obstacle to wider adoption of GPUs. In addition to the programmability challenges posed by GPU's complex memory hierarchy and parallelism model, a well-known application design problem is target portability across different GPUs. However, even for a single GPU target, changing a program's input characteristics can make an already-optimized implementation of a program perform poorly. In this work, we propose Adaptic, an adaptive input-aware compilation system to tackle this important, yet overlooked, input portability problem. Using this system, programmers develop their applications in a high-level streaming language and let Adaptic undertake the difficult task of input portable optimizations and code generation. Several input-aware optimizations are introduced to make efficient use of the memory hierarchy and customize thread composition. At runtime, a properly optimized version of the application is executed based on the actual program input. We perform a head-to-head comparison between the Adaptic generated and hand-optimized CUDA programs. The results show that Adaptic is capable of generating codes that can perform on par with their hand-optimized counterparts over certain input ranges and outperform them when the input falls out of the hand-optimized programs' "comfort zone". Furthermore, we show that input-aware results are sustainable across different GPU targets making it possible to write and optimize applications once and run them anywhere.

关键词： design languages Performance Streaming Compiler GPU Optimization Portability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：