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

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Kojarski, Sergei Lorenz, David H. Department of Computer Science University of Virginia Charlottesville VA 22904-4740 United States Northeastern University University of Virginia

Studies of Aspect-Oriented programming (AOP) usually focus on a language in which a specific aspect extension is integrated with a base language. languages specified in this manner have a fixed, non-extensible AOP functionality. this paper argues the need for AOP to support the integration and use of multiple domain-specific aspect extensions together. We study the more general case of integrating a base language with a set of third-party aspect extensions for that language. We present a general mixin-based semantic framework for implementing dynamic aspect extensions in such a way that multiple, independently developed aspect mechanisms can be subject to third-party composition and work collaboratively. Principles governing the design of a collaborative aspect mechanism are aspectual effect exposure and implementation hiding. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Session details: Probabilistic programming 14

Session details: Probabilistic programming

引用

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

作者： Ben Zorn Microsoft Research

No abstract available.

ISBN: (纸本)9781450327848

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Effective Interactive Proofs for Higher-Order Imperative Programs

Effective Interactive Proofs for Higher-Order Imperative Pro...

引用

14th acm sigplan International conference on Functional programming

作者： Chlipala, Adam Malecha, Gregory Morrisett, Greg Shinnar, Avraham Wisnesky, Ryan Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781605583327

We present a new approach for constructing and verifying higher-order, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is based on Hoare Type theory. that original system was a proof of concept, where every program verification was accomplished via laborious manual proofs, with much code devoted to uninteresting low-level details. In this paper, we present a re-implementation of Ynot which makes it possible to implement fully-verified, higher-order imperative programs with reasonable proof burden. At the same time, our new system is implemented entirely in Coq source files, showcasing the versatility of that proof assistant as a platform for research on language design and verification. Both versions of the system have been evaluated with case studies in the verification of imperative data structures, such as hash tables with higher-order iterators. the verification burden in our new system is reduced by at least an order of magnitude compared to the old system, by replacing manual proof with automation. the core of the automation is a simplification procedure for implications in higher-order separation logic, with hooks that allow programmers to add domain-specific simplification rules. We argue for the effectiveness of our infrastructure by verifying a number of data structures and a packrat parser, and we compare to similar efforts within other projects. Compared to competing approaches to data structure verification, our system includes much less code that must be trusted;namely, about a hundred lines of Coq code defining a program logic. All of our theorems and decision procedures have or build machine-checkable correctness proofs from first principles, removing opportunities for tool bugs to create faulty verifications.

关键词： functional programming interactive proof assistants dependent types separation logic

来源：评论

学校读者我要写书评

暂无评论

ContextErlang: Introducing context-oriented programming in the actor model 12

ContextErlang: Introducing context-oriented programming in t...

引用

11th Annual International conference on Aspect Oriented Software Development, AOSD'12

作者： Salvaneschi, Guido Ghezzi, Carlo Pradella, Matteo DEEPSE Group DEI Politecnico di Milano Piazza L. Da Vinci 32 Milano Italy

ISBN: (纸本)9781450310925

Self-adapting systems are becoming widespread in emerging fields such as autonomic, mobile and ubiquitous computing. Context-oriented programming (COP) is a promising language-level solution for the implementation of context-aware, self-adaptive software. However, current COP approaches struggle to effectively manage the asynchronous nature of context provisioning. We argue that, to solve these issues, COP features should be designed to fit nicely in the concurrency model supported by the language. this work presents the design rationale of CONTEXTERLANG, which introduces COP in the Actor Model. We provide evidence that CONTEXTERLANG constitutes a viable solution to implement context-aware software in a highly concurrent and distributed setting. We discuss a case study and an evaluation of run-time performance. © 2012 acm.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed programming with Value-Dependent Types 11

Secure Distributed Programming with Value-Dependent Types

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Swamy, Nikhil Chen, Juan Fournet, Cedric Strub, Pierre-Yves Bhargavan, Karthikeyan Yang, Jean Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F-star, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F-star provides arbitrary recursion while maintaining a logically consistent core;it enables modular reasoning about state and other effects using affine types;and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. the key mechanism is a new kind system that tracks several sub-languages within F-star and controls their interaction. F-star subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F-star. We have implemented a compiler that translates F-star to NET bytecode, based on a prototype for Fine. F-star provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. the compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification. To date, we have programmed and verified more than 20,000 lines of F-star including (1) new schemes for multi-party sessions;(2) a zero-knowledge privacy-preserving payment protocol;(3) a provenance-aware curated database;(4) a suite of 17 web-browser extensions verified for authorization properties;and (5) a cloud-hosted multi-tier web application with a verified reference monitor.

关键词： Security type systems refinement types

来源：评论

学校读者我要写书评

暂无评论

the design and implementation of typed scheme

引用

acm sigplan NOTICES 2008年第1期43卷 395-406页

作者： Tobin-Hochstadt, Sam Felleisen, Matthias Northeastern Univ PLT Boston MA 02115 USA

When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re) discover critical pieces of design information every time they wish to change a program. this analysis step both slows down the maintenance process and may even introduce mistakes due to the violation of undiscovered invariants. this paper presents Typed Scheme, an explicitly typed extension of an untyped scripting language. Its type system is based on the novel notion of occurrence typing, which we formalize and mechanically prove sound. the implementation of Typed Scheme additionally borrows elements from a range of approaches, including recursive types, true unions and subtyping, plus polymorphism combined with a modicum of local inference. Initial experiments with the implementation suggest that Typed Scheme naturally accommodates the programming style of the underlying scripting language, at least for the first few thousand lines of ported code.

关键词： languages design type systems Scheme

来源：评论

学校读者我要写书评

暂无评论

HACCLE: Metaprogramming for Secure Multi-Party Computation 2021

HACCLE: Metaprogramming for Secure Multi-Party Computation

引用

20th acm sigplan International conference on Generative programming: Concepts and Experiences (GPCE)

作者： Bao, Yuyan Sundararajah, Kirshanthan Malik, Raghav Ye, Qianchuan Wagner, Christopher Jaber, Nouraldin Wang, Fei Ameri, Mohammad Hassan Lu, Donghang Seto, Alexander Delaware, Benjamin Samanta, Roopsha Kate, Aniket Garman, Christina Blocki, Jeremiah Letourneau, Pierre-David Meister, Benoit Springer, Jonathan Rompf, Tiark Kulkarni, Milind Univ Waterloo Waterloo ON Canada Purdue Univ W Lafayette IN 47907 USA Reservoir Labs New York NY USA

ISBN: (纸本)9781450391122

Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An important class of such cryptographic techniques is known as Secure Multi-Party Computation (MPC). Developing Secure MPC applications in realistic scenarios requires extensive knowledge spanning multiple areas of cryptography and systems. And while the steps to arrive at a solution for a particular application are often straightforward, it remains difficult to make the implementation efficient, and tedious to apply those same steps to a slightly different application from scratch. Hence, it is an important problem to design platforms for implementing Secure MPC applications with minimum effort and using techniques accessible to non-experts in cryptography. In this paper, we present the HACCLE (High Assurance Compositional Cryptography: languages and Environments) toolchain, specifically targeted to MPC applications. HACCLE contains an embedded domain-specific language Harpoon, for software developers without cryptographic expertise to write MPC-based programs, and uses Lightweight Modular Staging (LMS) for code generation. Harpoon programs are compiled into acyclic circuits represented in HACCLE's Intermediate Representation (HIR) that serves as an abstraction over different cryptographic protocols such as secret sharing, homomorphic encryption, or garbled circuits. implementations of different cryptographic protocols serve as different backends of our toolchain. the extensible design of HIR allows cryptographic experts to plug in new primitives and protocols to realize computation. And the use of standard metaprogramming techniques lowers the development effort significantly. We have implemented Harpoon and HACCLE, and used them to program interesting applications (e.g., secure auction) and key computation components of Secure MPC applications (e.g., matrix-vector multiplication and merg

关键词： metaprogramming domain-specific language secure multi-party computation

来源：评论

学校读者我要写书评

暂无评论

Compiler-Assisted threshold implementation Against Power Analysis Attacks 35

Compiler-Assisted Threshold Implementation Against Power Ana...

引用

35th IEEE International conference on Computer design (ICCD)

作者： Luo, Pei Athanasiou, Konstantinos Zhang, Liwei Jiang, Zhen Hang Fei, Yunsi Ding, A. Adam Wahl, thomas Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA Northeastern Univ Dept Math Boston MA 02115 USA

ISBN: (纸本)9781538622544

Side-channel attack utilizes side-channel leakages to extract the secret in crypto systems. Various countermeasures for different algorithms and platforms have been proposed to protect crypto systems against such attacks. Manual countermeasure design requires deep understanding of the target algorithm and implementation, and oftentimes is platform-specific and error-prone. In this paper, we propose the construction of threshold implementation (TI), a provably secure countermeasure against power attacks, as an automated compiler pass in the open LLVM (Low Level Virtual Machine) framework. Attack results show that the automatically generated TI designs are secure against power attacks. As our proposed scheme implements the countermeasure at the intermediate representation (IR) level, our method can be applied to any cipher software in any programming language, and the generated implementations can be ported to different platforms and architectures.

关键词： Skeleton Ciphers Software Manuals Computer languages Side-channel attacks

来源：评论

学校读者我要写书评

暂无评论

ProSE: the Architecture and design of a Protein Discovery Engine 27

ProSE: The Architecture and Design of a Protein Discovery En...

引用

27th acm International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Robson, Eyes Xu, Ceyu Wills, Lisa Wu Univ Calif Berkeley Berkeley CA 94720 USA Duke Univ Durham NC USA

ISBN: (纸本)9781450392051

Protein language models have enabled breakthrough approaches to protein structure prediction, function annotation, and drug discovery. A primary limitation to the widespread adoption of these powerful models is the high computational cost associated with the training and inference of these models, especially at longer sequence lengths. We present the architecture, microarchitecture, and hardware implementation of a protein design and discovery accelerator, ProSE (Protein Systolic Engine). ProSE has a collection of custom heterogeneous systolic arrays and special functions that process transfer learning model inferences efficiently. the architecture marries SIMD-style computations with systolic array architectures, optimizing coarse-grained operation sequences across model layers to achieve efficiency without sacrificing generality. ProSE performs Protein BERT inference at up to 6.9x speedup and 48x power efficiency (performance/Watt) compared to one NVIDIA A100 GPU. ProSE achieves up to 5.5 x (12.7x) speedup and 173x (249x) power efficiency compared to TPUv3 (TPUv2).

关键词： Accelerators Neural Networks Transformers Domain-Specific Architecture NLP Protein design

来源：评论

学校读者我要写书评

暂无评论

Idiomatic design

Idiomatic design

引用

10th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1995

作者： Koenig, Andrew AT and T Bell Laboratories Murray HillNJ07974 United States

ISBN: (纸本)0897917219

Every problem has a context, which can include l community and culture implementation constraints language and system and probably other things too. A good design will take its context into account. If the culture demands it, that may mean, for example, using object-oriented techniques where they don't really apply or not using them in a case that seems to cry out for them. It may mean choosing a programming language without regard for its usual advantages or disadvantages. It may mean using a set of tools that some people may find cumbersome or outdated, It may call for all kinds of things that may seem nonsensical when viewed in isolation. But software systems do not exist in isolation. they would not be systems if they did. Any useful system must take its context into account. Unless we can answer the question "Good for what?" we cannot say whether or not a design is good.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：