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

Adding trace matching with free variables to AspectJ 05

Adding trace matching with free variables to AspectJ

Proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Chris Allan Pavel Avgustinov Aske Simon Christensen Laurie Hendren Sascha Kuzins Ondřej Lhoták Oege de Moor Damien Sereni Ganesh Sittampalam Julian Tibble University of Oxford United Kingdom University of Aarhus Denmark McGill University Montreal Canada

ISBN: (纸本)9781595930316

An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a ***, there have been several interesting proposals for new history-based language features, most notably by Douence et al. and by Walker and Viggers. In this paper, we present a new history-based language feature called tracematches that enables the programmer to trigger the execution of extra code by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ.A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables. We provide several examples of applications enabled by this *** introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our language design, and we derive an implementation from that semantics. The implementation has been realised as an extension of the abc compiler for AspectJ.

关键词： program monitoring aspect-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Look up!: your future is in the cloud 13

Look up!: your future is in the cloud

引用

Proceedings of the 34th acm sigplan conference on programming language design and implementation

作者： James R. Larus Microsoft Research Redmond WA USA

ISBN: (纸本)9781450320146

The "Cloud" is a wonderfully expansive phrase used to denote computation and data storage centralized in a large datacenter and elastically accessed across a network. The concept is not new; web sites and business servers have run in datacenters for a long time. These, however, were specialized applications, outside of the mainstream of desktop programs. The past few years has seen enormous change as the mainstream shifts from a single computer to mobile devices and clusters of computers. Three factors are driving this change. 1) Mobile computing, where apps run on a size- and power-constrained device and would be far less interesting without backend systems to augment computation and storage capacity. 2) Big data, which uses clusters of computers to extract valuable information from vast amounts of unstructured data. 3) Inexpensive, elastic computing, pioneered by Amazon Web Services, which enables everyone to rapidly obtain and use many *** a researcher from the language and compiler community, I firmly believe this sea change is at heart a programming problem. Cloud computing is far different from the environment in which most of today's languages and tools were developed, and few programmers have mastered its complexity. New challenges include pervasive parallelism, partial failure, high and variable communication latency, and replication for reliability and throughput.

关键词： cloud computing distributed computing programming languages

来源：评论

学校读者我要写书评

暂无评论

Tagless staged interpreters for typed languages 02

Tagless staged interpreters for typed languages

引用

Proceedings of the seventh acm sigplan international conference on Functional programming

作者： Emir PašaliΕ Walid Taha Tim Sheard Oregon Health & Science University Rice University

ISBN: (纸本)9781581134872

Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of deriving an implementation that is both readable and efficient. In an untyped setting, staging an interpreter "removes a complete layer of interpretive overhead", just like partial evaluation. In a typed setting however, Hindley-Milner type systems do not allow us to exploit typing information in the language being interpreted. In practice, this can mean a slowdown cost by a factor of three or ***, both type specialization and tag elimination were applied to this problem. In this paper we propose an alternative approach, namely, expressing the definitional interpreter in a dependently typed programming language. We report on our experience with the issues that arise in writing such an interpreter and in designing such a language. .To demonstrate the soundness of combining staging and dependent types in a general sense, we formalize our language (called Meta-D) and prove its type safety. To formalize Meta-D, we extend Shao, Saha, Trifonov and Papaspyrou's λH language to a multi-level setting. Building on λH allows us to demonstrate type safety in a setting where the type language contains all the calculus of inductive constructions, but without having to repeat the work needed for establishing the soundness of that system.

关键词： calculus of constructions definitional interpreters multi-stage programming domain-specific languages

来源：评论

学校读者我要写书评

暂无评论

programming with proofs and explicit contexts 08

Programming with proofs and explicit contexts

引用

Proceedings of the 10th international acm sigplan conference on Principles and practice of declarative programming

作者： Brigitte Pientka Jana Dunfield McGill University Montreal Canada

ISBN: (纸本)9781605581170

This paper explores a new point in the design space of functional programming: functional programming with dependently-typed higher-order data structures described in the logical framework LF. This allows us to program with proofs as higher-order data. We present a decidable bidirectional type system that distinguishes between dependently-typed data and computations. To support reasoning about open data, our foundation makes contexts explicit. This provides us with a concise characterization of open data, which is crucial to elegantly describe proofs. In addition, we present an operational semantics for this language based on higherorder pattern matching for dependently typed objects. Based on this development, we prove progress and preservation

关键词： logical frameworks type theory dependent types

来源：评论

学校读者我要写书评

暂无评论

Practical data breakpoints: design and implementation 93

Practical data breakpoints: design and implementation

引用

Proceedings of the acm sigplan 1993 conference on programming language design and implementation

作者： Robert Wahbe Steven Lucco Susan L. Graham

ISBN: (纸本)9780897915984

A data breakpoint associates debugging actions with programmer-specified conditions on the memory state of an executing program. Data breakpoints provide a means for discovering program bugs that are tedious or impossible to isolate using control breakpoints alone. In practice, programmers rarely use data breakpoints, because they are either unimplemented or prohibitively slow in available debugging software. In this paper, we present the design and implementation of a practical data breakpoint facility.A data breakpoint facility must monitor all memory updates performed by the program being debugged. We implemented and evaluated two complementary techniques for reducing the overhead of monitoring memory updates. First, we checked write instructions by inserting checking code directly into the program being debugged. The checks use a segmented bitmap data structure that minimizes address lookup complexity. Second, we developed data flow algorithms that eliminate checks on some classes of write instructions but may increase the complexity of the remaining *** evaluated these techniques on the SPARC using the SPEC benchmarks. Checking each write instruction using a segmented bitmap achieved an average overhead of 42%. This overhead is independent of the number of breakpoints in use. Data flow analysis eliminated an average of 79% of the dynamic write checks. For scientific programs such the NAS kernels, analysis reduced write checks by a factor of ten or more. On the SPARC these optimizations reduced the average overhead to 25%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A logic programming tool for qualitative system design 86

A logic programming tool for qualitative system design

引用

Proceedings of the international conference on APL

作者： Gert L. Moller Bang & Olufsen DK - 7600 Struer Denmark

ISBN: (纸本)9780901865359

Introducing a geometrical approach to propositional divalent logic with the truth-tables of the Boolean connectives as the geometrical objects, we can make a simple operational implementation in APL of basic inference methods. This is the basis for a logic programming tool used for preliminary product design at the Danish company Bang&Olufsen.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CoreDet: A Compiler and Runtime System for Deterministic Multithreaded Execution

引用

acm sigplan NOTICES 2010年第3期45卷 53-64页

作者： Bergan, Tom Anderson, Owen Devietti, Joseph Ceze, Luis Grossman, Dan Univ Washington Seattle WA 98195 USA

The behavior of a multithreaded program does not depend only on its inputs. Scheduling, memory reordering, timing, and low-level hardware effects all introduce nondeterminism in the execution of multithreaded programs. This severely complicates many tasks, including debugging, testing, and automatic replication. In this work, we avoid these complications by eliminating their root cause: we develop a compiler and runtime system that runs arbitrary multithreaded C/C++ POSIX Threads programs deterministically. A trivial non-performant approach to providing determinism is simply deterministically serializing execution. Instead, we present a compiler and runtime infrastructure that ensures determinism but resorts to serialization rarely, for handling interthread communication and synchronization. We develop two basic approaches, both of which are largely dynamic with performance improved by some static compiler optimizations. First, an ownership-based approach detects interthread communication via an evolving table that tracks ownership of memory regions by threads. Second, a buffering approach uses versioned memory and employs a deterministic commit protocol to make changes visible to other threads. While buffering has larger single-threaded overhead than ownership, it tends to scale better (serializing less often). A hybrid system sometimes performs and scales better than either approach individually. Our implementation is based on the LLVM compiler infrastructure. It needs neither programmer annotations nor special hardware. Our empirical evaluation uses the PARSEC and SPLASH2 benchmarks and shows that our approach scales comparably to nondeterministic execution.

关键词： Reliabity design Performance

来源：评论

学校读者我要写书评

暂无评论

Constraint diagrams: visualizing invariants in object-oriented models 97

Constraint diagrams: visualizing invariants in object-orient...

引用

Proceedings of the 12th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Stuart Kent Division of Computing University of Brighton Lewes Rd. Brighton UK

ISBN: (纸本)9780897919081

A new visual notation is proposed for precisely expressing constraints on object-oriented models, as an alternative to mathematical logic notation used in methods such as Syntropy and Catalysis. The notation is potentially intuitive, expressive, integrates well with existing visual notations, and has a clear and unambiguous semantics. It is reminiscent of informal diagrams used by mathematicians for illustrating relations, and borrows much from Venn diagrams. It may be viewed as a generalization of instance diagrams.

关键词： analysis and design methods language design formal methods software engineering practices

来源：评论

学校读者我要写书评

暂无评论

Archface: a contract place where architectural design and code meet together

Archface: a contract place where architectural design and co...

引用

International conference on Software Engineering (ICSE)

作者： Naoyasu Ubayashi Jun Nomura Tetsuo Tamai Kyushu University Fukuoka Japan Kyushu Institute of Technology Fukuoka Japan University of Tokyo Tokyo Japan

This paper proposes Archface, an interface mechanism for bridging the gap between architectural design and its implementation. Archface, which encapsulates design essence based on the component-and-connector architecture, is not only an ADL (Architecture Description language) but also a programming-level interface. Archface is effective for software evolution because traceability between design and its implementation can be realized by enforcing architectural constraints on program implementation, and this traceability is bidirectional. In Archface, a component exposes program points such as method call/execution and a connector defines how to coordinate exposed program points. A collaborative architecture consisting of components can be encapsulated into a group of interfaces and separated from implementation, because dynamic program points representing control flow can be specified in the interfaces. We can characterize the notion of Archface with the phrase "predicate coordination," in which program points are exposed by a predicate and coordinated by a trait-based connector.

关键词： Unified modeling language Computer architecture Observers Connectors Computational modeling Weaving Software

来源：评论

学校读者我要写书评

暂无评论

Object views: language support for intelligent object caching in parallel and distributed computations 99

Object views: language support for intelligent object cachin...

引用

Proceedings of the 14th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Ilya Lipkind Igor Pechtchanski Vijay Karamcheti Courant Institute of Mathematical Sciences New York University 715 Broadway 7th Floor New York NY

ISBN: (纸本)9781581132380

Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object space. However, the flat shared-object space introduces a performance challenge: applications that rely on the transparent coherent caching of objects achieve high performance only on tightly coupled parallel machines. In distributed environments, the overheads of object caching force application designers to choose other solutions. Consequently, most applications sacrifice programmability, relying instead on either the explicit coherence management of cached objects, or on vastly different middleware abstractions such as multicast and *** this paper, we describe object views — language support for efficient object caching in parallel and distributed computations. Object views specify restrictions on how computation threads can use an object, providing the underlying implementation with information about the potential side effects of object access, and thereby enabling construction of scalable, low-overhead caching protocols customized to application requirements. We present extensions to the Java programming language for expressing object views, and describe the design and implementation of a translator and run-time system for executing view-augmented Java programs on a distributed cluster of workstations. Experimental results based on a shared whiteboard application demonstrate that view-based object caching can achieve performance superior to multicast- and event-based implementations, while retaining essentially a shared object interface.

关键词： object representation distributed objects object caching views collaborative applications shared objects Java

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：