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

acm sigplan conference on programming language design and implementation

作者： George Kastrinis Yannis Smaragdakis Department of Informatics University of Athens

ISBN: (纸本)9781450320146

Context-sensitive points-to analysis is valuable for achieving high precision with good performance. The standard flavors of context-sensitivity are call-site-sensitivity (kCFA) and object-sensitivity. Combining both flavors of context-sensitivity increases precision but at an infeasibly high cost. We show that a selective combination of call-site- and object-sensitivity for Java points-to analysis is highly profitable. Namely, by keeping a combined context only when analyzing selected language features, we can closely approximate the precision of an analysis that keeps both contexts at all times. In terms of speed, the selective combination of both kinds of context not only vastly outperforms non-selective combinations but is also faster than a mere object-sensitive analysis. This result holds for a large array of analyses (e.g., 1-object-sensitive, 2-object-sensitive with a context-sensitive heap, type-sensitive) establishing a new set of performance/precision sweet spots.

关键词： Points-to analysis Context-sensitivity Object-sensitivity Type-sensitivity Algorithms languages Performance language algorithms Analysis Flavoring Agents Precision language feature

来源：评论

学校读者我要写书评

暂无评论

Automating the Ada programming process: A domain-specific approach

Automating the Ada programming process: A domain-specific ap...

引用

1993 conference on TRI-Ada, TRI-Ada 1993

作者： Grossman, Fred Klerer, Robert J. Engle, Charles B. Pace University School of Computer Science and Information Systems 1 Martine Avenue White PlainsNY10606 United States Iona College Department of Computer Science New RochelleNY10801 United States Florida Institute of Technology Department of Computer Science MelbourneFL32901 United States

ISBN: (纸本)0897917219

This paper addresses the problem of automating the process of programming in general, and offers a solution for the scientific computation application domain. The goal of an automated programming system is to minimize the linguistic and notational difference between the problem solver's specification of an application solution and an equivalent program, i.e., approach the ideal of an executable specification. By raising the level of the executable specification to the analysis/design stage, and permitting the user to refine development via the interleaving of specification and implementation, a true prototyping paradigm for automated software development is achieved. An automatic program generation system, the AUTOMATED PROGRAMMER, has been developed for the mathematics-scientific-engineering application domain. It accepts an executable specification expressed in conventional two-dimensional mathematical notation and technical English, and currently produces executable target programs written in such conventional languages as Fortran and C. The extension to the generation of Ada is under development. The software engineering implications such as reusability, maintainability and verifiability of automated programming approach is examined. © 1993 acm.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Knit: Component composition for systems software 4

Knit: Component composition for systems software

引用

4th conference on Symposium on Operating System design and implementation, OSDI 2000

作者： Reid, Alastair Flatt, Matthew Stoller, Leigh Lepreau, Jay Eide, Eric University of Utah School of Computing United States

Knit is a new component definition and linking language for systems code. Knit helps make C code more understandable and reusable by third parties, helps eliminate much of the performance overhead of componentization, detects subtle errors in component composition that cannot be caught with normal component type systems, and provides a foundation for developing future analyses over C-based components, such as cross-component optimization. The language is especially designed for use with component kits, where standard linking tools provide inadequate support for component configuration. In particular, we developed Knit for use with the OSKit, a large collection of components for building low-level systems. However, Knit is not OSKit-specific, and we have implemented parts of the Click modular router in terms of Knit components to illustrate the expressiveness and flexibility of our language. This paper provides an overview of the Knit language and its applications.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 3rd International conference on Computer, Artificial Intelligence and Control Engineering, CAICE 2024

Proceedings of the 3rd International Conference on Computer,...

引用

3rd International conference on Computer, Artificial Intelligence and Control Engineering, CAICE 2024

ISBN: (纸本)9798400716942

The proceedings contain 148 papers. The topics discussed include: a PLC-based three-dimensional warehouse simulation system;pollen dictionary construction based on supervised comparative learning;application and research of high-quality pixel streaming architecture based on unreal engine;development and research of generative animation based on AIGC;distributed roof photovoltaics monitoring system for the whole district;a system to increase the accuracy of deep learning based classification by the distribution of labels;fine-tuning of financial large language model and application at edge device;deep learning compiler optimization based on constraint programming;and design and implementation of automatic monitoring software for seismic observation instrument.

关键词：

来源：评论

学校读者我要写书评

暂无评论

design AND implementation IN ADA OF A RUNTIME TASK SUPERVISOR. 82

DESIGN AND IMPLEMENTATION IN ADA OF A RUNTIME TASK SUPERVISO...

引用

proceedings of the AdaTEC conference on Ada.

作者： Falis, Edward Stanford University

ISBN: (纸本)0897910877

A runtime supervisor is an Ada package in the standard environment which provides a scheduling interface between a compiled tasking program and the virtual machine upon which it is to execute. Its visible operations implement the more complex aspects of the tasking dynamic semantics. These operations are very high level in the sense that they conform closely to Ada tasking constructs. Internal to the supervisor is a small kernel of machine dependent code providing the actual interface to the target virtual *** this kind of runtime environment, the compiled code of a tasking program is equivalent to the code generated by a compilation of sequential Ada constructs with embedded calls to the supervisor visible operations. All parallelism is abstracted out of the program prior to the code generation phase of the compilation, and the implementation of the parallel constructs of the Ada language is shifted into the runtime supervisor package. While the form of the sequential Ada code implementing tasking constructs will depend on design decisions made by the implementors of specific compilers as in [3] and [5], a carefully designed supervisor will be compatible with the code generated by any Ada compiler calling that supervisor's visible operations in the specified *** benefits of this approach, which was originally adopted for the design of the experimental Adam compiler [4], are apparent. Target machine dependent aspects of scheduling, and details of scheduling strategies are separated from compilation. The code generation phase of the Ada compiler is greatly simplified by factoring out all tasking related routines. Compiler builders need not reimplement all of tasking for each new compiler or intended target machine. In addition, experimental and special purpose supervisors will gain wider distribution and evaluation due the portability inherent in this *** this paper we analyze the feasibility of implementing a runtime supervisor in Ada, point

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Relational aspects as tracematches 08

Relational aspects as tracematches

引用

7th International conference on Aspect-Oriented Software Development, AOSD.08

作者： Bodden, Eric Shaikh, Reehan Hendren, Laurie School of Computer Science McGill University Montréal QC Canada

ISBN: (纸本)9781605580449

The relationships between objects in an object-oriented program are an essential property of the program's design and implementation. Two previous approaches to implement relationships with aspects were association aspects, an AspectJ-based language extension, and the relationship aspects library. While those approaches greatly ease software development, we believe that they are not general enough. For instance, the library approach only works for binary relationships, while the language extension does not allow for the association of primitive values or values from non-weavable classes. Hence, in this work we propose a generalized alternative implementation via a direct reduction to tracematches, a language feature for executing an advice after having matched a sequence of events. This new implementation scheme yields multiple benefits. Firstly, our implementation is more general than existing ones, avoiding most previous limitations. It also yields a new language construct, relational tracematches. We provide an efficient implementation based on the AspectBench Compiler, along with test cases and microbenchmarks. Our empirical studies showed that our implementation, when compared to previous approaches, uses a similar memory footprint with no leaking, but the generality of our approach does lead to some runtime overhead. We believe that our implementation can provide a solid foundation for future research. Copyright © 2008 acm.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

MapCG: Writing Parallel Program Portable between CPU and GPU 10

MapCG: Writing Parallel Program Portable between CPU and GPU

引用

19th International conference on Parallel Architectures and Compilation Techniques

作者： Hong, Chuntao Chen, Dehao Chen, Wenguang Zheng, Weimin Lin, Haibo Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781450301787

Graphics Processing Units (GPU) have been playing an important role in the general purpose computing market recently. The common approach to program GPU today is to write GPU specific code with low level GPU APIs such as CUDA. Although this approach can achieve very good performance, it raises serious portability issues: programmers are required to write a specific version of code for each potential target architecture. It results in high development and maintenance cost. We believe it is desired to have a programming model which provides source code portability between CPUs and CPUs, and different GPUs: Programmers only need to write one version of code and can be compiled and executed on either CPUs or CPUs efficiently without modification. In this paper, we propose MapCG, a Map Reduce framework to provide source code level portability between CPU and GPU. Different from OpenCL, our framework is based on Map Reduce, which provides a high level programming model, making programming much easier. We describe the design of the Map Reduce-based high-level programming language and the underlying runtime system to enable portability between CPU and CPU. A prototype of MapCG runtime was implemented, supporting multi-core CPU and NVIDIA GPUs. Experiments show that our implementation can execute the same source code efficiently on multi-core CPU platforms and CPUs, achieving an average of 1.6-2.5x speedup over previous implementations of Map Reduce on eight commonly used applications.

关键词： portability parallel GPU programming

来源：评论

学校读者我要写书评

暂无评论

Disjoint Intersection Types

引用

acm sigplan NOTICES 2016年第9期51卷 364-377页

作者： Oliveira, Bruno C. d. S. Shi, Zhiyuan Alpuim, Joao Univ Hong Kong Hong Kong Hong Kong Peoples R China

Dunfield showed that a simply typed core calculus with intersection types and a merge operator is able to capture various programming language features. While his calculus is type-safe, it is not coherent: different derivations for the same expression can elaborate to expressions that evaluate to different values. The lack of coherence is an important disadvantage for adoption of his core calculus in implementations of programming languages, as the semantics of the programming language becomes implementation-dependent. This paper presents lambda(i) : a coherent and type-safe calculus with a form of intersection types and a merge operator. Coherence is achieved by ensuring that intersection types are disjoint and programs are sufficiently annotated to avoid type ambiguity. We propose a definition of disjointness where two types A and B are disjoint only if certain set of types are common supertypes of A and B. We investigate three different variants of lambda(i), with three variants of disjointness. In the simplest variant, which does not allow inverted perpendicular types, two types are disjoint if they do not share any common supertypes at all. The other two variants introduce inverted perpendicular types and refine the notion of disjointness to allow two types to be disjoint when the only the set of common supertypes are top-like. The difference between the two variants with inverted perpendicular types is on the definition of top-like types, which has an impact on which types are allowed on intersections. We present a type system that prevents intersection types that are not disjoint, as well as an algorithmic specifications to determine whether two types are disjoint for all three variants.

关键词： Intersection Types Type System design languages Theory

来源：评论

学校读者我要写书评

暂无评论

What does aspect-oriented programming mena to Cobol

What does aspect-oriented programming mena to Cobol

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

作者： Lämmel, Ralf De Schutter, Kris Free University CWI Amsterdam Netherlands SEL INTEC University Ghent Belgium

ISBN: (纸本)1595930434

We study AOP in the context of business programming with Cobol. We face the following questions: What are join points in Cobol programs? What is advice?. Does classic Cobol provide any constructs that hint at AOP? (Yes!) What are typical crosscutting concerns in the Cobol world? How do otherwise typical crosscutting concerns make sense for Cobol? How does AOP for Cobol align with classic re-engineering transformations for Cobol? We deliver an AOP language design for Cobol. Codename: AspectCobol. While we adopt several ideas from AspectJ and friends, we also devise original techniques for join-point identification and context capture. We briefly discuss a prototypical implementation of AspectCobol. Copyright 2005 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Abc An extensible AspectJ compiler 05

Abc An extensible AspectJ compiler

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

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

ISBN: (纸本)1595930434

Research in the design of aspect-oriented programming languages requires a workbench that facilitates easy experimentation with new language features and implementation techniques. In particular, new features for AspectJ have been proposed that require extensions in many dimensions: syntax, type checking and code generation, as well as data flow and control flow analyses. The AspectBench Compiler (abc) is an implementation of such a workbench. The base version of abc implements the full AspectJ language. Its frontend is built, using the Polyglot framework, as a modular extension of the Java language. The use of Polyglot gives flexibility of syntax and type checking. The backend is built using the Soot framework, to give modular code generation and analyses. In this paper, we outline the design of abc, focusing mostly on how the design supports extensibility. We then provide a general overview of how to use abc to implement an extension. Finally, we illustrate the extension mechanisms of abc through a number of small, but non-trivial, examples, abc is freely available under the GNU LGPL. Copyright 2005 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：