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

19th Annual acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'92

作者： Farrow, R. Marlowe, T.J. Yellin, D.M. Declarative Systems Inc

ISBN: (纸本)0897914538

this paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility, reusability, and incremental metal-compilation. A CAG is built from several smaller component AGs, each of which solves a particular subproblem, such as name analysis or register allocation. A component AG is based upon a simplified phrase-structure that reflects the properties of its subproblem rather than the phrase-structure of the source language. Different component phrase-structures for various subproblems are combined by mapping them into a phrase-structure for the source language. Both input and output attributes can be associated with the terminal symbols of a component AG. Output attributes enable the results of solving a subproblem to be distributed back to anywhere that originally contributed part of the subproblem, e.g. transparently distributing the results of global name analysis back to every symbolic reference in the source program. After introducing CAGs by way of an example, we provide a formal definition of CAGs and their semantics. We describe a subclass of CAGs, called separable CAGs, that have favorable implementation properties. We discuss the novel aspects of CAGs, compare them to other proposals for inserting modularity into attribute grammars, and relate our experience using CAGs in the Linguist translator-writing system.

关键词： Computational grammars

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability 04

A practical type system and language for reference immutabil...

引用

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

作者： Birka, Adrian Ernst, Michael D. MIT Comp. Sci./Artif. Intell. Lab. Cambridge MA 02139 United States

ISBN: (纸本)1581138318

this paper describes a type system that is capable of expressing and enforcing immutability constraints. the specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. the abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. the type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. this paper describes the design and implementation of Javari, including the type-checking rules for the language. this paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Acute: High-level programming language design for distributed computation

引用

JOURNAL OF FUNCTIONAL programming 2007年第4-5期17卷 547-612页

作者： Sewell, Peter Leifer, James J. Wansbrough, Keith Nardelli, Francesco Zappa Allen-Williams, Mair Habouzit, Pierre Vafeiadis, Viktor Univ Cambridge Cambridge England INRIA Rocquencourt Le Chesnay France

Existing languages provide good support for typeful programming of stand-alone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper, we discuss programming-language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately built programs. the main features are (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type safety of associated values, for example, values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. these features are a large part of what is needed for typeful distributed programming. they are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. this disentangles the language run-time from communication intricacies. this paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： ML (Computer program language) programming languages (Electronic computers) ELECTRONIC data processing INFORMATION theory COMPUTER programming COMPUTER algorithms

来源：评论

学校读者我要写书评

暂无评论

design principles for internal domain-specific languages: A pattern catalog illustrated by Ruby 10

Design principles for internal domain-specific languages: A ...

引用

17th conference on Pattern languages of Programs, PLoP 2010

作者： Günther, Sebastian Cleenewerck, thomas School of Computer Science University of Magdeburg Germany Software Language Engineering Lab Vrije Universiteit Brussel Belgium Universitätsplatz 2 D-39106 Magdeburg Germany Vrije Universiteit Brussel Faculty of Sciences DINF - SOFT Pleinlaan 2 B-1050 Brussels Belgium

ISBN: (纸本)9781450301077

Some programming languages, especially dynamic programming languages, offer suitable mechanisms for the construction of internal domain-specific languages (DSL). Internal DSLs inherit the facilities of their host language such as the availability of libraries, frameworks, tool support, and other DSLs. When developing an internal DSL, there are two challenges. First, to cope with the host language's syntactic and semantic restrictions. Careful and thoughtful extensions and modifications of the host language are crucial to overcome these restrictions without reverting to poor language design. Second, to support several design principles that are genuine for a DSL. Although there is an extensive body of knowledge about DSL design principles and desirable quality properties, it remains difficult to apply them, or to reason about whether a particular DSL exhibits specific desirable principles. Our objective is to put the two perspectives together. We research the most important design principles of a DSL and show how different patterns can be used to support these principles. this allows us to produce an extensive pattern catalog which is the foundation of principled approach for designing internal DSLs. the patterns can be used to assess the design quality of a DSL and structure its implementation. In particular, we show a complex DSL example illustrating each principle and the corresponding patterns. While we stick to Ruby for the explanation and application of the patterns, we also name known uses in Python, Scala, and Smalltalk. Patterns are explained with their context, problem, forces, solution, and consequences. We also explain the patterns with the classical structure of intent, motivation, forces, implementation and their consequences. Finally we reflect upon the pattern utilization by discussing their strengths and weaknesses.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Toward Just-in-Time and language-Agnostic Mutation Testing 22

Toward Just-in-Time and Language-Agnostic Mutation Testing

引用

6th International conference on the Art, Science, and Engineering of programming (programming)

作者： Reschke, Stefan Mattis, Toni Niephaus, Fabio Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Oracle Labs Potsdam Germany

ISBN: (纸本)9781450396561

Mutation Testing is a popular approach to determine the quality of a suite of unit tests. It is based on the idea that introducing faults into a system under test (SUT) should cause tests to fail, otherwise, the test suite might be of insufficient quality. In the language of mutation testing, such a fault is referred to as "mutation", and an instance of the SUT's code that contains the mutation is referred to as "mutant". Mutation testing is computationally expensive and time-consuming. Reasons for this include, for example, a high number of mutations to consider, interrelations between these mutations, and mutant-associated costs such as the cost of mutant creation or the cost of checking whether any tests fail in response. Furthermore, implementing a reliable tool for automatic mutation testing is a significant effort for any language. As a result, mutation testing is only available for some languages. Present mutation tools often rely on modifying code or binary executables. We refer to this as "ahead-of-time" mutation testing. Oftentimes, they neither take dynamic information that is only available at run-time into account nor alter program behavior at run-time. However, mutating via the latter could save costs on mutant creation: If the corresponding module of code is compiled, only the mutated section of code needs to be recompiled. Run-time information (like previous execution results selected by an initial test run) could help to determine the utility of a mutant. Skipping mutants of low utility could have an impact on mutation testing efficiency. We refer to this approach as just-in-time mutation testing. In this paper, we provide a proof of concept for just-in-time and language-agnostic mutation testing. We present preliminary results of a feasibility study that explores the implementation of just-in-time mutation testing based on Truffle's instrumentation API. Based on these results, future research can evaluate the implications of just-in-time and langua

关键词： mutation testing mutation coverage just-in-time language-agnostic GraalVM Truffle polyglot

来源：评论

学校读者我要写书评

暂无评论

Modularizing Crosscutting Concerns with Ptolemy 11

Modularizing Crosscutting Concerns with Ptolemy

引用

10th International conference on Aspect-Oriented Software Development (AOSD)

作者： Rajan, Hridesh Leavens, Gary T. Dyer, Robert Bagherzadeh, Mehdi Iowa State Univ Ames IA 50011 USA Univ Cent Florida Orlando FL 32816 USA

ISBN: (纸本)9781450305563

this tutorial will provide an introduction to Ptolemy. Ptolemy is a programming language whose goals are to improve a software engineer's ability to separate conceptual concerns, while preserving encapsulation of object-oriented code and the ability of programmers to modularly reason about their code. In particular, Ptolemy's features are useful towards modularization of cross-cutting concerns. A cross-cutting concern is a requirement whose implementation is spread across and mixed with the code of other requirements. there has been attempts to improve separation of cross-cutting concerns, e.g. by aspect-oriented and implicit-invocation languages, but none give software developers textual separation of concerns and modular reasoning at the same time. Ptolemy has both these properties important for scalable software engineering. Ptolemy's event types provide a well-defined interface between object-oriented code and cross-cutting code. this in turn enables separate type-checking and compilation. Ptolemy also provides a novel and practical specification mechanism that we call translucid contracts. A translucid contracts allows developers to reason about the control effects of the object-oriented code and cross-cutting code modularly. this tutorial will proceed by discussing the goals of the Ptolemy programming language. We will then discuss Ptolemy's programming features and its specification features by way of several hands-on exercises. We will conclude with pointers to ongoing work on design, implementation and verification of Ptolemy programs.

关键词： modular reasoning aspect-oriented programming languages implicit invocation translucid contracts aspect-oriented interfaces Ptolemy

来源：评论

学校读者我要写书评

暂无评论

Towards a methodology for explicit composition of metaobjects 95

Towards a methodology for explicit composition of metaobject...

引用

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

作者： Mulet, Philippe Malenfant, Jacques Cointe, Pierre Ecole des Mines de Nantes and OTI Laboratoire Jules Verne La Chantrerie 4 rue Alfred Kastler 44070 Nantes Cedex 03 France Département d'Informatique et de Recherche Opérationnelle Université de Montréal Succursale Centre-Ville Montréal QC H3C 3J7 Canada

ISBN: (纸本)0897917030

Reflective programming languages are those where users' programs are allowed to customize in an organized way the behavior of the language to their own needs. For ten years now, most of the work on reflection revolved around the definition and the implementation of metaobject protocols which express this organization. No methodologies have been proposed for reflective programming per se. this paper proposes a first one aiming at the design of composable metaobjects. Given two independently developed reflective customizations, this methodology proposes principles to be observed in their design such that they can be composed using standard base-level aggregation or specialization. While this paper focuses on a simple MOP and illustrates the methodology on specific examples, this methodology can be generalized to other languages with different MOPs. For instance, we discuss how to adapt it to CLOS. © 1995 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Adding trace matching with free variables to AspectJ

Adding trace matching with free variables to AspectJ

引用

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

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

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 computation. Recently, 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 feature. After 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. Copyright 2005 acm.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Beyond the PDP-11: Architectural support for a memory-safe C abstract machine 15

Beyond the PDP-11: Architectural support for a memory-safe C...

引用

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

作者： Chisnall, David Rothwell, Colin Watson, Robert N. M. Woodruff, Jonathan Vadera, Munraj Moore, Simon W. Roe, Michael Davis, Brooks Neumann, Peter G. Univ Cambridge Cambridge CB2 1TN England SRI Int Princeton NJ USA

ISBN: (纸本)9781450328357

We propose a new memory-safe interpretation of the C abstract machine that provides stronger protection to benefit security and debugging. Despite ambiguities in the specification intended to provide implementation flexibility, contemporary implementations of C have converged on a memory model similar to the PDP-11, the original target for C. this model lacks support for memory safety despite well-documented impacts on security and reliability. Attempts to change this model are often hampered by assumptions embedded in a large body of existing C code, dating back to the memory model exposed by the original C compiler for the PDP-11. Our experience with attempting to implement a memory-safe variant of C on the CHERI experimental microprocessor led us to identify a number of problematic idioms. We describe these as well as their interaction with existing memory safety schemes and the assumptions that they make beyond the requirements of the C specification. Finally, we refine the CHERI ISA and abstract model for C, by combining elements of the CHERI capability model and fat pointers, and present a softcore CPU that implements a C abstract machine that can run legacy C code with strong memory protection guarantees.

关键词： capabilities processor design compilers memory protection C language security memory safety bounds checking

来源：评论

学校读者我要写书评

暂无评论

EScala: Modular event-driven object interactions in scala 11

EScala: Modular event-driven object interactions in scala

引用

Proceedings of the tenth international conference on Aspect-oriented software development

作者： Gasiunas, Vaidas Satabin, Lucas Mezini, Mira Núñez, Angel Noyé, Jacques Software Technology Group Technische Universität Darmstadt Darmstadt Germany École des Mines de Nantes Nantes France

ISBN: (纸本)9781450305563

Event-driven programming style in OO languages based on imperatively triggered events does not support separate and more declarative event definitions by composition or transformation of other events. AO language mechanisms for defining events as declarative queries over implicitly available low-level events seem good candidates to approach these problems. However, being designed for modularizing mostly globally scoped, crosscutting concerns, AO mechanisms deliberately break with the OO design and modular reasoning style and are thus inappropriate for addressing modularity concerns related to event-based interactions in OO designs. the contribution of this paper is a language design that combines imperatively triggered events with AO-like mechanisms that are specifically designed to address modularity issues in event-driven object-oriented designs. In particular, they seamlessly integrate with OO-style encapsulation, late binding, and modular reasoning. We present an efficient and type-safe implementation of the proposed design as an extension to Scala.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：