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

17th Meeting on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2002)

作者： Printezis, T Jones, R Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland Univ Kent Comp Lab Canterbury CT2 7NF Kent England

ISBN: (纸本)9781581134711

GCspy is an architectural framework for the collection, transmission, storage and replay of memory management behaviour. It makes new contributions to the understanding of the dynamic memory behaviour of programming languages (and especially object-oriented languages that make heavy demands on the performance of memory managers). GCspy's architecture allows easy incorporation into any memory management system: it is not limited to garbage-collected languages. It requires only small changes to the system in which it is incorporated but provides a simple to use yet powerful data-gathering API. GCspy scales to allow very large heaps to be visualised effectively and efficiently. It allows already-running, local or remote systems to be visualised and those systems to run at full speed outside the points at which data is gathered. GCspy's visualisation tool presents this information in a number of novel ways. Deep understanding of program behaviour is essential to the design of the next generation of garbage collectors and explicit allocators. Until now, no satisfactory tools have been available to assist the implementer in gaining an understanding of heap behaviour. GCspy has been demonstrated to be a practical solution to this dilemma. It has been used to analyse production Java virtual machines running applications of realistic sizes. Its use has revealed important insights into the interaction between application program and JVM and has led to the development of better garbage collectors.

关键词： algorithms measurement performance languages human factors language implementation memory management garbage collection visualisation of objects Java

来源：评论

学校读者我要写书评

暂无评论

language support for connector abstractions 17th

引用

17th European conference on Object-Oriented programming (ECOOP 2003)

作者： Aldrich, J Sazawal, V Chambers, C Notkin, D Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)3540405313

Software connectors are increasingly recognized as an important consideration in the design and implementation of object-oriented software systems. Connectors can be used to communicate across a distributed system, coordinate the activities of several objects, or adapt one object's interface to the interface of another. Mainstream object-oriented languages, however, do not provide explicit support for connectors. As a result, connection code is intermingled with application code, making it difficult to understand, evolve, and reuse connection mechanisms. In this paper, we add language support for user-defined connectors to the ArchJava language. Our design enables a wide range of connector abstractions, including caches, events, streams, and remote method calls. Developers can describe both the run-time semantics of connectors and the typechecking semantics. the connector abstraction supported by ArchJava cleanly separates reusable connection code from application logic, making the semantics of connections more explicit and allowing engineers to easily change the connection mechanisms used in a program. We evaluate the expressiveness and the engineering benefits of our design in a case study applying ArchJava to the PlantCare ubiquitous computing application.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Aspectual Caml: an aspect-oriented functional language

引用

acm sigplan NOTICES 2005年第9期40卷 320-330页

作者： Masuhara, H Tatsuzawa, H Yonezawa, A Univ Tokyo Grad Sch Arts & Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan

We propose an aspect-oriented programming (AOP) language called Aspectual Caml based on a strongly-typed functional language Objective Caml with two AOP mechanisms similar to those in AspectJ language. this paper describes the design and implementation issues of those AOP mechanisms that give us insights into the interaction between AOP features and common features in strongly-typed functional languages such as type inference, polymorphic types and curried functions. We implemented a prototype compiler of the language and used the language for separating crosscutting concerns in application programs, including for separating descriptions of a type system from compiler descriptions.

关键词： aspect-oriented programming objective Caml pointcut and advice

来源：评论

学校读者我要写书评

暂无评论

A first-class approach to genericity

A first-class approach to genericity

引用

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Allen, E Bannet, J Cartwright, R Rice Univ Houston TX 77005 USA

this paper describes how to add first-class generic types including mixins - to strongly-typed 00 languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types can appear in any context where conventional types can appear. In this context, a mixin is simply a generic class that extends one of its type parameters, e.g., a class C that extends T. Although mixins of this form are widely used in C++ (via templates), they are clumsy and error-prone because C++ treats mixins as macros, forcing each mixin instantiation to be separately compiled and type-checked. the abstraction embodied in a mixin is never separately analyzed. Our formulation of mixins using first-class genericity accommodates sound local (class-by-class) type checking. A mixin can be fully type-checked given symbol tables for each of the classes that it directly references-the same context in which Java performs incremental class compilation. To our knowledge, no previous formal analysis of first-class genericity in languages with nominal type systems has been conducted, which is surprising because nominal subtyping has become predominant in mainstream object-oriented programming languages. What makes our treatment of first-class genericity particularly interesting and important is the fact that it can be added to the existing Java language without any change to the underlying Java Virtual Machine. Moreover, the extension is backward compatible with legacy Java source and class files. Although our discussion of a, practical implementation strategy focuses on Java, the same implementation techniques could be applied to other object-oriented languages such as C# or Eiffel that support incremental compilation, dynamic class loading, and nominal subtyping.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Extending SQL-92 for OODB access: design and implementation experience 95

Extending SQL-92 for OODB access: Design and implementation ...

引用

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

作者： Kiernan, Jerry Carey, Michael J. IBM Santa Teresa Lab. 555 Bailey Avenue San Jose CA 95141 United States IBM Almaden Research Center 650 Harry Road K55-B1 San Jose CA 95120 United States

ISBN: (纸本)0897917030

this paper describes the design and implementation of a query engine that provides extended SQL-based access to the data managed by an object-oriented database system. this query engine allows extended SQL queries to be embedded in C++ programs or issued interactively as from a command line interface. the language supported by the engine is the complete SQL-92 select statement plus object extensions for navigating along paths and embedded structures, querying nested sets, and invoking member functions. In addition, an object-oriented SQL view facility is provided. Using this view facility, one can define object-oriented views;one can also define views that flatten complex OODB schemas, allowing direct access by existing tools designed to provide remote access to relational databases. the view facility also supports the definition of views that include reference and set-valued columns based on other views, thus allowing entire "view schemas" to be created. this paper describes the SQL-92 query and view extensions and discusses a number of issues that arose on the way to the implementation that is currently running on top of the ObjectStore OODB system. © 1995 acm.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Upcall dispatcher aspects: Combining modularity with efficiency in the CiAO IP stack

Upcall dispatcher aspects: Combining modularity with efficie...

引用

1st Workshop on Modularity in Systems Software, MISS 2011, Co-located with the 10th International conference on Aspect-Oriented Software Development, AOSD.11

作者： Streicher, Jochen Borchert, Christoph Spinczyk, Olaf Technische Universität Dortmund Computer Science 12 - Embedded System Software Germany

ISBN: (纸本)9781450306478

Network protocol stacks are an important ingredient of today's infrastructure software. For instance, all state-of-the-art operating systems for PCs and the server market come with a TCP/IP stack. the design of protocol stacks and their layered structure has been studied for decades. However, in practice, implementations often do not follow the clean textbook design consequently. this especially holds for the domain of embedded TCP/IP stacks where minimal resource consumption is crucial. In this work we present an analysis that explains the reason for this dilemma. We have also developed a very simple solution that is based on common aspect-oriented programming language features: Upcall Dispatcher Aspects. In a case study this concept has been repeatedly applied as an AspectC++ idiom in the implementation of the CiAO TCP/IP stack, which we compared to several traditional implementations. Besides reflecting a clean design at the implementation level, our protocol stack, which mainly targets the domain of resource-constrained embedded systems, even outperforms the other solutions with respect to resource consumption and various "-ilities". Copyright 2011 acm.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Finding application errors and security flaws using PQL: A program query language

Finding application errors and security flaws using PQL: A p...

引用

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

作者： Martin, Michael Livshits, Benjamin Lam, Monica S. Computer Science Department Stanford University

A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules, An important class of design rules deals with sequences of events associated with a set of related objects. this paper presents a language called PQL (Program Query language) that allows programmers to express such questions easily in an application-specific context. A query looks like a code excerpt corresponding to the shortest amount of code that would violate a design rule. Details of the target application's precise implementation are abstracted away. the programmer may also specify actions to perform when a match is found, such as recording relevant information or even correcting an erroneous execution on the fly. We have developed both static and dynamic techniques to find solutions to PQL queries, Our static analyzer finds all potential matches conservatively using a context-sensitive, flow-insensitive, inclusion-based pointer alias analysis, Static results are also useful in reducing the number of instrumentation points for dynamic analysis. Our dynamic analyzer instruments the source program to catch all violations precisely as the program runs and to optionally perform user-specified actions. We have implemented the techniques described in this paper and found 206 errors in 6 large real-world open-source Java applications containing a total of nearly 60,000 classes. these errors are important security flaws, resource leaks, and violations of consistency invariants. the combination of static and dynamic analysis proves effective at addressing a wide range of debugging and program comprehension queries. We have found that dynamic analysis is especially suitable for preventing errors such as security vulnerabilities at runtime. Copyright 2005 acm.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

Experience report: Functional programming in C-Rules

引用

acm sigplan NOTICES 2007年第9期42卷 25-28页

作者： Wazny, Jeremy Constraint Technol Int Melbourne Vic 3000 Australia

C-Rules is a business rules management system developed by Constraint Technologies International(1) (CTI), designed for use in transportation problems. Users define rules describing various aspects of a problem, such as solution costs and legality, which are then queried from a host application, typically an optimising solver. At its core, C-Rules provides a functional expression language which affords users both power and flexibility when formulating rules. In this paper we will describe our experiences of using functional programming both at the end-user level, as well as at the implementation level. We highlight some of the benefits we, and the product's users, have enjoyed from the decision to base our rule system on features such as: higher-order functions, referential transparency, and static, polymorphic typing. We also outline some of our experiences in using Haskell to build an efficient compiler for the core language.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability

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

引用

19th conference on Object-Oriented programming, Systems, languages, and Applications

作者： Birka, A Ernst, MD MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

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.

关键词： type system verification immutability readonly mutable Javari Java const

来源：评论

学校读者我要写书评

暂无评论

Combinatorial sketching for finite programs

Combinatorial sketching for finite programs

引用

12th International conference on Architectural Support for programming languages and Operating Systems

作者： Solar-Lezama, Armando Bodik, Liviu Tancau Rastislav Saraswat, Vijay Seshia, Sanjit Univ Calif Berkeley Berkeley CA 94720 USA

Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate specification of the desired functionality. the synthesizer then completes the sketch to behave like the specification. the correctness of the synthesized implementation is guaranteed by the compiler, which allows, among other benefits, rapid development of highly tuned implementations without the fear of introducing bugs. We develop SKETCH, a language for finite programs with linguistic support for sketching. Finite programs include many high-performance kernels, including cryptocodes. In contrast to prior synthesizers, which had to be equipped with domain-specific rules, SKETCH completes sketches by means of a combinatorial search based on generalized boolean satisfiability. Consequently, our combinatorial synthesizer is complete for the class of finite programs: it is guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems. Freed from domain rules, we can now write sketches as simple-to-understand partial programs, which are regular programs in which difficult code fragments are replaced with holes to be filled by the synthesizer. Holes may stand for index expressions, lookup tables, or bitmasks, but the programmer can easily define new kinds of holes using a single versatile synthesis operator. We have used SKETCH to synthesize an efficient implementation of the AES cipher standard. the synthesizer produces the most complex part of the implementation and runs in about an hour.

关键词： languages design performance sketching SAT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：