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

9th International Conference on Generative programming and Component Engineering

作者： Grech, Neville Rathke, Julian Fischer, Bernd Univ Southampton ECS Southampton SO9 5NH Hants England

ISBN: (纸本)9781450301541

Manually implementing equals (for object comparisons) and hashCode (for object hashing) methods in large software projects is tedious and error-prone. This is due to many special cases, such as field shadowing, comparison between different types, or cyclic object graphs. Here, we present JEqualityGen, a source code generator that automatically derives implementations of these methods. JEqualityGen proceeds in two states: it first uses source code reflection in metaAspectJ to generate aspects that contain the method implementations, before it uses weaving on the bytecode level to insert these into the target application. JEqualityGen generates not only correct, but efficient source code that on a typical large-scale Java application exhibits a performance improvement of more than two orders of magnitude in the equality operations generated, compared to an existing system based on runtime reflection. JEqualityGen achieves this by generating runtime profiling code that collects data. This enables it to generate optimised method implementations in a second round.

关键词： Algorithms Performance Theory meta-programming equality hashing code generation Java Scala AspectJ AOP

来源：评论

学校读者我要写书评

暂无评论

Code maintenance and design for a visual programming language graphical user interface

Code maintenance and design for a visual programming languag...

引用

作者： Pierson, Graham C. Naval Postgraduate School

学位级别：硕士

This work adds new functionality to an existing visual programming environment. It applies software maintenance techniques for use with the Java Language in a Microsoft Windows operating system environment. The previously undocumented application is intended to support programming with executable diagrams. This application has the potential to expand programming access to non-programmers, provide better software documentation and improve software maintainability. It is currently capable of supporting meta-programming tasks such as parsing and compiler building. The 11,184 legacy lines of code(LOC) were corrected, extended and documented to support future maintenance using an additional 957 LOC and changes to 45 LOC.

关键词： Code Maintenance VPL Visual programming Language Software Engineering VisualRigal Rigal Graphical User Interface meta-programming Code reading notSerializableException Software Design

来源：评论

学校读者我要写书评

暂无评论

Bootstrapping a Compiler for an Equation-Based Object-Oriented Language

引用

MODELING IDENTIFICATION AND CONTROL 2014年第1期35卷 1-19页

作者： Sjolund, M. Fritzson, P. Pop, A. Linkoping Univ PELAB SE-58183 Linkoping Sweden

What does it mean to bootstrap a compiler, and why do it? This paper reports on the first bootstrapping of a full-scale E00 (Equation-based Object-Oriented) modeling language such as Modelica. Bootstrapping means that the compiler of a language can compile itself. However, the usual application area for the Modelica is modeling and simulation of complex physical systems. Fortunately it turns out that with some minor extensions, the Modelica language is well suited for the modeling of language semantics. We use the name metaModelica for this slightly extended Modelica. This is a prerequisite for bootstrapping which requires that the language can be used to model and/or implement itself. The OpenModelica Compiler (OMC) has been written in this metaModelica language. It originally supported only the standard Modelica language but has been gradually extended to also cover the metaModelica language extensions. After substantial work, OMC is able to quickly compile itself and produces an executable with good performance. The benefits include a more extensible and maintainable compiler by introducing improved language constructs and a more powerful runtime that makes it easy to add functionality such as parser generators, debuggers, and profiling tools. Future work includes extracting and restructuring parts of OMC, making the compiler smaller and more modular and extensible. This will also make it easier to interface with OMC, making it possible to create more powerful and user-friendly OpenModelica-based tools. The compiler and its bootstrapping is a major effort it is currently about 330 000 lines of code, and the metaModelica extensions are used routinely by approximately ten developers on a daily basis.

关键词： compilation equation-based object-oriented meta-programming modeling

来源：评论

学校读者我要写书评

暂无评论

REFLECTION MECHANISMS FOR COMBINING PROLOG DATABASES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1991年第6期21卷 603-624页

作者： LAMMA, E MELLO, P NATALI, A Dipartimento di Elettronica Informatica e Sistemistica Universita di Bologna Viale Risorgimento 2 40136 Bologna Italy

By using practical examples, this paper outlines the power of reflection mechanisms for logic programming systems in the domain of knowledge structuring. In particular, it presents an extension of Prolog, where separate databases can be handled as first-class objects. Different forms of database combination such as inheritance and dynamic context extension/contraction are specified and implemented in a dynamic and flexible way through reflection. The main aim is to broaden the application area of logic programming to encompass most of the paradigms needed by systems that use artificial intelligence techniques. Practical results presented in the paper show that logic programs that use reflection can be shorter, more readable and efficient than those using more conventional full meta-interpretation techniques. Full meta-interpretation, however, is more general than reflection.

关键词： LOGIC programming KNOWLEDGE REPRESENTATION meta-programming REFLECTION PROLOG

来源：评论

学校读者我要写书评

暂无评论

An approach for dynamically adaptable SIMD vectorization of FEM kernels

引用

COMPUTER PHYSICS COMMUNICATIONS 2024年 304卷

作者： Kadlubiak, Kristian Meca, Ondrej Riha, Lubomir Brzobohaty, Tomas VSB Tech Univ Ostrava IT4Innovat 17 Listopadu 2172-15 Ostrava 70833 Czech Republic

The paper focuses on the optimization of the FEM matrix kernels with respect to user-defined parameters such as materials, initial conditions, and boundary conditions that are known during run-time only. Adapting the kernels to specific parameters can save a significant amount of execution time and increase performance. Handling them efficiently is challenging due to the exponential number of potential combinations that the user can specify. The paper presents an approach that combines (a) cross-element vectorization for the easy-to-write transformation of the original scalar code to vectorized one, (b) meta-programming for utilization of a compiler for building sub- kernels tailored for a particular set of parameters, (c) and dynamic polymorphism allowing run-time selection of sub-kernels. We show that the above techniques allow (1) straightforward code modifications, (2) efficient handling of required dynamic behavior with a minor performance penalty for most kernels, and (3) achieving up to 8-fold speedups compared to non-adapted kernels.

关键词： SIMD FEM kernels meta-programming Dynamic polymorphism

来源：评论

学校读者我要写书评

暂无评论

GENERATIVE UNBINDING OF NAMES

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2008年第1期4卷

作者： Pitts, Andrew M. Shinwell, Mark R. Univ Cambridge Comp Lab Cambridge CB3 0FD England

This paper is concerned with the form of typed name binding used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name, value)-pair that may only be deconstructed via the generation of fresh bound names. The paper proves a new result about what operations on names can co-exist with this construct. In FreshML the only observation one can make of names is to test whether or not they are equal. This restricted amount of observation was thought necessary to ensure that there is no observable difference between alpha-equivalent name binders. Yet from an algorithmic point of view it would be desirable to allow other operations and relations on names, such as a total ordering. This paper shows that, contrary to expectations, one may add not just ordering, but almost any relation or numerical function on names without disturbing the fundamental correctness result about this form of typed name binding (that object-level alpha-equivalence precisely corresponds to contextual equivalence at the programming meta-level), so long as one takes the state of dynamically created names into account.

关键词： Abstract syntax binders alpha-conversion meta-programming

来源：评论

学校读者我要写书评

暂无评论

Expressive and safe static reflection with MorphJ

引用

ACM SIGPLAN NOTICES 2008年第6期43卷 79-89页

作者： Huang, Shan Shan Smaragdakis, Yannis Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

Recently, language extensions have been proposed for Java and C# to support pattern-based reflective declaration. These extensions introduce a disciplined form of meta-programming and aspect-oriented programming to mainstream languages: They allow members of a class (i.e., fields and methods) to be declared by statically iterating over and pattern-matching on members of other classes. Such techniques, however, have been unable to safely express simple, but common, idioms such as declaring getter and setter methods for fields. In this paper, we present a mechanism that addresses the lack of expressiveness in past work without sacrificing safety. Our technique is based on the idea of nested patterns that elaborate the outer-most pattern with blocking or enabling conditions. We implemented this mechanism in a language, MorphJ. We demonstrate the expressiveness of MorphJ with real-world applications. In particular, the MorphJ reimplementation of DSTM2, a software transactional memory library, reduces 1,107 lines of Java reflection and bytecode engineering library calls to just 374 lines of MorphJ code. At the same time, the MorphJ solution is both high level and safer, as MorphJ can separately type check generic classes and catch errors early. We present and formalize the MorphJ type system, and offer a type-checking algorithm.

关键词： languages object-oriented programming structural abstraction class morphing aspect-oriented programming meta-programming language extensions

来源：评论

学校读者我要写书评

暂无评论

The usage of cybernetic in complex software systems and its application to the deterministic multithreading

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2022年第28期34卷

作者： Bozkurt, Erkam Murat Control Syst Engn Istanbul Turkey

Abtract In this paper, a new cybernetic control technology that can be used in complex software systems will be introduced. In this approach, the software systems are governed by cybernetic control objects and the class libraries defining the types of these cybernetic control objects are produced by special meta-programming platforms. In this approach, the requirements of the software to be developed are received from the programmer by meta-programming systems before coding. Actually, the cybernetic control objects have standard design and properties and the programmers only determine the quantities and the locations of these properties before library production process. Then, the meta-programming platforms build project-specific class libraries based on previously determined code templates. By this way, the cybernetic control objects are constructed with optimal memory and they can receive feedback about ongoing operations on the process. With the help of the feedback coming from the process, the control objects steer the process in the line of the programmer directives. By this way, the control of the programmer on the software increases significantly. In addition, in this paper, a typical application of this approach to the multithread programming will be introduced.

关键词： meta-programming multithreading software cybernetics

来源：评论

学校读者我要写书评

暂无评论

Forsaking Inheritance: Supercharged Delegation in DelphJ

引用

ACM SIGPLAN NOTICES 2013年第10期48卷 233-251页

作者： Gerakios, Prodromos Biboudis, Aggelos Smaragdakis, Yannis Univ Athens Dept Informat Athens 15784 Greece

We propose DelphJ: a Java-based OO language that eschews inheritance completely, in favor of a combination of class morphing and (deep) delegation. Compared to past delegation approaches, the novel aspect of our design is the ability to emulate the best aspects of inheritance while retaining maximum flexibility: using morphing, a class can select any of the methods of its delegatee and export them (if desired) or transform them (e.g., to add extra arguments or modify type signatures), yet without needing to name these methods explicitly and handle them one-by-one. Compared to past work on morphing, our approach adopts and adapts advanced delegation mechanisms, in order to add late binding capabilities and, thus, provide a full substitute of inheritance. Additionally, we explore complex semantic issues in the interaction of delegation with late binding. We present our language design both informally, with numerous examples, and formally in a core calculus.

关键词： Languages meta-programming language extensions morphing object composition delegation static reflection

来源：评论

学校读者我要写书评

暂无评论

JEqualityGen: Generating Equality and Hashing Methods

引用

ACM SIGPLAN NOTICES 2011年第2期46卷 177-186页

作者： Grech, Neville Rathke, Julian Fischer, Bernd Univ Southampton ECS Southampton SO9 5NH Hants England

关键词： Algorithms Performance Theory meta-programming equality hashing code generation Java Scala AspectJ AOP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：