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

1995 acm sigplan conference on programming language design and implementation, PLDI 1995

作者： Wilson, Robert P. Lam, Monica S. Computer Systems Laboratory Stanford University CA94305 United States

ISBN: (纸本)0897916972

This paper proposes an efficient technique for con-extsensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial tran$er func(ions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We cart reuse aPTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful-a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and efficiently for a set of C benchmarks. © 1995 acm.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

A type-based compiler for standard ML 95

A type-based compiler for standard ML

引用

1995 acm sigplan conference on programming language design and implementation, PLDI 1995

作者： Shao, Zhong Appelt, Andrew W. Yale University United States Princeton University United States

ISBN: (纸本)0897916972

Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation work in real compilers, and how much performance gain will type-based optimization yield? In order to support more efficient data representations and gain more experience about type-directed compilation, we have implemented a new type-based middle end and back end for the Standard ML of New Jersey compiler. We describe the basic design of the new compiler, Identify a number of practical issues, and then compare the performance of our new compiler with the old non-type-based compiler. Our measurement shows that a combination of several simple type-based optimlzations reduces heap allocation by 36%: And improves the already-efficient code generated by the old non-type-based compiler by about 19% on a DECstation 5000. © 1995 acm.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

SELECTIVE SPECIALIZATION FOR OBJECT-ORIENTED languageS 95

SELECTIVE SPECIALIZATION FOR OBJECT-ORIENTED LANGUAGES

引用

acm sigplan 95 conference on programming language design and implementation

作者： DEAN, J CHAMBERS, C GROVE, D Department of Computer Science and Engineering University of Washington Seattle WA

ISBN: (纸本)9780897916974

Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing other optimizations. To reduce this overhead, optimizing compilers for object-oriented languages analyze the classes of objects stored in program variables, with the goal of bounding the possible classes of message receivers enough so that the compiler can uniquely determine the target of a message send at compile time and replace the message send with a direct procedure call. Specialization is one important technique for improving the precision of this static class information: by compiling multiple versions of a method, each applicable to a subset of the possible argument classes of the method, more precise static information about the classes of the method's arguments is obtained. Previous specialization strategies have not been selective about where this technique is applied, and therefore tended to significantly increase compile time and code space usage, particularly for large applications. In this paper, we present a more general framework for specialization in object-oriented languages and describe a goal-directed specialization algorithm that makes selective decisions to apply specialization to those cases where;it provides the highest benefit. Our results show that our algorithm improves the performance of a group of sizeable programs by 65% to 275% while increasing compiled code space requirements by only 4% to 10%. Moreover, when compared to the previous state-of-the-art specialization scheme, our algorithm improves performance by 11% to 67% while simultaneously reducing code space requirements by 65% to 73%.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Time and space profiling for non-strict, higher-order functional languages 95

Time and space profiling for non-strict, higher-order functi...

引用

22nd acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'95

作者： Sansom, Patrick M. Peyton Jones, Simon L. Univ of Glasgow Glasgow United Kingdom

ISBN: (纸本)9780897916929

We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as well as space usage. Our profiler is implemented in a production-quality optimising compiler for Haskell, has low overheads, and can successfully profile large applications. A unique feature of our approach is that we give a formal specification of the attribution of execution costs to cost centres. This specification enables us to discuss our design decisions in a precise framework. Since it is not obvious how to map this specification onto a particular implementation, we also present an implementation-oriented operational semantics, and prove it equivalent to the specification.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Idiomatic design

Idiomatic design

引用

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

作者： Koenig, Andrew AT and T Bell Laboratories Murray HillNJ07974 United States

ISBN: (纸本)0897917219

Every problem has a context, which can include l community and culture implementation constraints language and system and probably other things too. A good design will take its context into account. If the culture demands it, that may mean, for example, using object-oriented techniques where they don't really apply or not using them in a case that seems to cry out for them. It may mean choosing a programming language without regard for its usual advantages or disadvantages. It may mean using a set of tools that some people may find cumbersome or outdated, It may call for all kinds of things that may seem nonsensical when viewed in isolation. But software systems do not exist in isolation. They would not be systems if they did. Any useful system must take its context into account. Unless we can answer the question "Good for what?" we cannot say whether or not a design is good.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A SYSTEMATIC FRAMEWORK FOR THE DEPENDENCE CYCLE REMOVAL IN PRACTICAL LOOPS

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1995年第2期27卷 157-171页

作者： KONDA, V KUMAR, A UNIV LOUISVILLE DEPT ENGN MATH & COMP SCILOUISVILLEKY 40292

Traditionally research in dependence testing considered the most general linear subscripted DO loops permitted by standard Fortran. However, the existing program transformations are discussed in isolation without developing a unified and formal theory for the most general loops. Consequently all the available parallelism in the serial programs is not exploited by the existing techniques;for example, the existing techniques can neither completely remove the output dependence cycles nor recognize all types of reduction loops. In this paper, based on the empirical studies of Goff et al. (Proc. acm sigplan '91 conference on programming language design and implementation, Toronto, Ontario, Canada, June 26-28, 1991, pp. 15-29), first we consider a DO loop model which encompasses 97% of the practical Fortran DO loops. By analyzing their dependence characteristics, we develop the formal theory for the application of various parallelizing transformations, specifically the dependence cycle breaking transformations. By this formalization, we contribute the following useful results: (1) define the scope of the existing cycle breaking techniques and illustrate the shortcomings in them;(2) present the dependence characteristics of reduction loops, which will help in designing general reduction loop recognition algorithms in contrast to the existing pattern matching techniques;and (3) propose a new transformation called node replication and prove that by applying this transformation all the output dependence cycles can be completely removed. Finally, we discuss how the most general linear subscripted DO loops can be converted into the above-mentioned loop model, showing that the results presented in this paper are applicable to ah the linear subscripted DO loops permitted by standard Fortran. (C) 1995 Academic Press, Inc.

关键词： Compiler optimizations Computer programming languages DEPENDENCE dissolved oxygen

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Debugging constraint programs 1st

Debugging constraint programs

引用

1st International conference on Principles and Practice of Constraint programming, CP 1995

作者： Meier, Micha European Computer Industry Research Centre Arabellastr. 17 Munich81925 Germany

ISBN: (纸本)3540602992

Constraint programming (CP) is in its substance non-algorithmic programming, not last because it is often being applied to problems for which no efficient algorithms exist. A not immediately obvious consequence of this fact is that debugging CP programs is principally different from debugging algorithmic programs, including imperative, functional or Prolog programs. It is also more difficult. Moreover, it is frequently necessary to apply performance debugging to CP programs, which are correct but too slow to be feasible. The whole area of CP debugging is still lacking both methodology and tools to support users in improving their programs. In this paper, we present a paradigm for tracing constraint programs and the design and implementation of Grace, a graphical environment for tracing CLP(FD) programs on top of ECLiPSe. © Springer-Verlag Berlin Heidelberg 1995.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

Proceedings of the ACM SIGPLAN'94 Conference on Programming ...

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

The proceedings contain 30 papers on programming languages. Topics include language design, data structures, codes, mathemtical techniques, errors, error correction, computation theory, program compiling and program o... 详细信息

ISBN: (纸本)089791662X

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：