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

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

作者： Ben-Chung Cheng Wen-Mei W. Hwu Department of Computer Science University of Illinois Department of Electrical and Computer Engineering University of Illinois

ISBN: (纸本)9781581131994

In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java 00

A generational on-the-fly garbage collector for Java

引用

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

作者： Tamar Domani Elliot K. Kolodner Erez Petrank IBM Haifa Research Lab. Computer Science Dept. Technion - Israel Institute of Technology

ISBN: (纸本)9781581131994

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way *** for other generational collectors, an on-the-fly generationalcollector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors,on-the-fly collectors do not move the objects; thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： memory management generational garbage collection programming languages garbage collection

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 15-28页

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information on the usage of program subexpressions in a lazy functional language permits a compiler to perform a number of useful optimizations. However, existing analyses are either ad-hoc and approximate, or defined over restricted languages. Our work extends the Once Upon A Type system of Turner, Mossin, and Wadler (FPCA'95). Firstly, we add type polymorphism, an essential feature of typed functional programming languages. Secondly, we include general Haskell-style user-defined algebraic data types. Thirdly, we explain and solve the `poisoning problem', which causes the earlier analysis to yield poor results. Interesting design choices turn up in each of these areas. Our analysis is sound with respect to a Launchbury-style operational semantics, and it is straightforward to implement. Good results have been obtained from a prototype implementation, and we are currently integrating the system into the Glasgow Haskell Compiler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Dependent types in practical programming

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 214-227页

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main contribution of the paper lies in our language design, including the formulation of type-checking rules which makes the approach practical. To our knowledge, no previous type system for a general purpose programming language such as ML has combined dependent types with features including datatype declarations, higher-order functions, general recursions, let-polymorphism, mutable references, and exceptions. In addition, we have finished a prototype implementation of DML(C) for an integer constraint domain C, where constraints are linear inequalities (Xi and Pfenning 1998).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type 99

Once upon a polymorphic type

引用

The 1999 26th Annual acm sigplan-SIGACT Symposium on Principles of programming language, POPL'99

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

ISBN: (纸本)9781581130959

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Dependent types in practical programming 99

Dependent types in practical programming

引用

The 1999 26th Annual acm sigplan-SIGACT Symposium on Principles of programming language, POPL'99

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

ISBN: (纸本)9781581130959

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Hancock: A language for processing very large-scale data 99

Hancock: A language for processing very large-scale data

引用

2nd conference on Domain-Specific languages (DSL 99)

作者： Bonachea, D Fisher, K Rogers, A Smith, F AT&T Labs Res Shannon Lab Florham Park NJ 07932 USA

ISBN: (纸本)1880446278

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

Proceedings of the 1998 Annual ACM SIGPLAN Conference on Pro...

引用

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

The proceedings contains 31 papers from the 1998 acm sigplan 1998 conference on programming language design and implementation (PLDI). Topics discussed include: scalar register promotions;sparse partial redundancy eliminations;data transformations;array languages;array access patterns;data-flow analysis;inclusion constraint graphs;flow-insensitive pointer analysis;type-based alias analysis;floating-point resources;branch reordering;linear-scan register allocation;asynchronous distributed garbage collection;generational stack collection;profile-driven pretenuring;data-parallel program analysis;Cilk-5 multithreaded language;run-time code generations;and Java virtual machines (JVM).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A truly implementation independent GUI development tool

A truly implementation independent GUI development tool

引用

1999 Annual acm SIGAda International conference on Ada, SIGAda 1999

作者： Carlisle, Martin C. Department of Computer Science US Air Force Academy 2354 Fairchild Dr CO80840-6234 United States

ISBN: (纸本)1581131275

Ovre the last few years, graphical user interface programming has become increasingly prevalent. Many libraries and languages have been developed to simplify this task. Additionally, design tools have been created that allow the programmer to "draw" their desired interface and then have code automatically generated. Unfortunately, use of these tools locks the programmer into a particular implementation. Even if the tool targets a multi-platform library (e.g. Tcl/Tk or JVM), the flexibility of the result is constrained. We present a truly implementation and platform independent solution. RAPID generates Ada code targeted to an object-oriented set of graphical user interface specifications with absolutely no implementation dependent information. The pattern used to derive these specifications is an improvement over the "Abstract Factory" Pattern, as it allows both the specification and implementation to take advantage of inheritance. The user can then select an implementation (for example, Tcl/Tk or JVM) at compile time. RAPID itself is also written using the same specifications;therefore it requires no modification to target a new implementation or to use a new implementation itself. RAPID is currently being used to design the user interface for a satellite ground station. © 1999 acm.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

DSL implementation using staging and monads 99

DSL implementation using staging and monads

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Sheard, Tim Benaissa, Zine-El-Abidine Pasalic, Emir Pacific Software Research Center Oregon Graduate Institute P.O. Box 91000 PortlandON97291-1000 United States

ISBN: (纸本)1581132557

The impact of Domain Specific languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a high-level language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：