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

LANGUAGE DESIGN FOR program manipulation

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1992年第1期18卷 19-32页

作者： MERKS, EAT DYCK, JM CAMERON, RD School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada

The design of procedural and object-oriented programming languages is considered with respect to how easily programs written in those languages can be formally manipulated. Current procedural languages such as Pascal, Modula-2, and Ada generally support such program manipulations, except for some annoying anomalies and special cases. Three main areas of language design are identified as being of concern from a manipulation viewpoint-namely, the interface between concrete and abstract syntax, the relationship between the abstract syntax and static semantics (naming, scoping, and typing), and the ability to express basic transformations (folding and unfolding). Design principles are suggested so that problems identified for current languages can be avoided in the future.

关键词： LANGUAGE DESIGN program manipulation LANGUAGE ENVIRONMENT SYNTAX SEMANTICS

来源：评论

学校读者我要写书评

暂无评论

Topics in Semantics-based program manipulation

Topics in Semantics-based Program Manipulation

引用

作者： Bernd Grobauer Aarhus University

学位级别：博士

programming is at least as much about manipulating existing code as it is about writing new code. Existing code is modied, for example to make ine- cient code run faster, or to accommodate for new features when reusing code; existing code is analyzed, for example to verify certain program properties, or to use the analysis information for code modications. Semantics-based program manipulation addresses methods for program modications and program ana- lyses that are formally dened and therefore can be veried with respect to the programming-language semantics. This dissertation comprises four articles in the eld of semantics-based techniques for program manipulation: three articles are about partial evaluation, a method for program specialization; the fourth article treats an approach to automatic cost analysis. Partial evaluation optimizes programs by specializing them with respect to parts of their input that are already known: Computations that depend only on known input are carried out during partial evaluation, whereas computations that depend on unknown input give rise to residual code. For example, partially evaluating an interpreter with respect to a program written in the interpreted language yields code that carries out the computations described by that pro- gram; partial evaluation is used to remove interpretive overhead. In eect, the partial evaluator serves as a compiler from the interpreted language into the implementation language of the interpreter. Compilation by partial evaluation is known as the rst Futamura projection. The second and third Futamura projection describe the use of partial evaluation for compiler generation and compiler-generator generation, respectively; both require the partial evaluator that is employed to be self applicable. The rst article in this dissertation describes how the second Futamura pro- jection can be achieved for type-directed partial evaluation (TDPE), a relatively recent approach to partial evaluation: We derive a

关键词： topics Semantics-Based run cations partial formally faster Aarhus Denmark Olivier Danvy program manipulation existing code

来源：评论

学校读者我要写书评

暂无评论

Comments on “Language Design for program manipulation”

引用

IEEE Transactions on Software Engineering 1994年第3期20卷 218-219页

作者： Griswold, William G. Department of Computer Science and Engineering University of California at San Diego La Jolla 92093–0114 United States

Thepaper “Language design for program manipulation” identifies design principles for a procedural or object-oriented language whose programs will be easier to manipulate. However, it neglects to relate these design principles to existing, broader, design principles, and in some instances omits good examples of languages meeting their criteria. In the following comments, I relate the new principles to more fundamental design principles, and provide the needed examples of languages meeting their criteria. Together these additions can better help designers of new programming languages that are amenable to manipulation. © 1994 IEEE.

关键词： Language design program manipulation semantics syntax

来源：评论

学校读者我要写书评

暂无评论

THE DESIGN OF AN INTERACTIVE program-DEVELOPMENT SYSTEM FOR PASCAL

引用

SOFTWARE-PRACTICE & EXPERIENCE 1984年第2期14卷 177-190页

作者： NORDSTROM, B WIKSTROM, A GOTHENBURG UNIV S-41296 GOTHENBURGSWEDEN

A program language can be defined as the language in which computer programs are written, and a programming language as the language used by the programmer to create programs. This paper presents the design of an interactive program development system which uses Pascal as both program and programming language. Principal properties of the system are a complete immediate syntax check, a program-structure oriented editor, incremental compiling techniques, and interactive interpretation and debugging of programs. The syntax check is split into three phases, and the user can change the degree of check wanted. After a change of the program only part of it is recompiled, and only necessary phases of the compiling process are performed.

关键词： Interactive programming environment Incremental compiler Pascal Structure-oriented editor program manipulation programming methodology

来源：评论

学校读者我要写书评

暂无评论

Fourth Workshop on Refactoring Tools (WRT 2011) 11

Fourth Workshop on Refactoring Tools (WRT 2011)

引用

33rd International Conference on Software Engineering (ICSE)

作者： Dig, Danny Batory, Don Univ Illinois Urbana IL 61801 USA Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450304450

Refactoring is the process of applying behavior-preserving transformations to a program with the objective of improving the program's design. A specific refactoring is identified by a name (e. g., Extract Method), a set of preconditions, and a set of transformations that need to be performed. Tool support for refactoring is essential because checking the preconditions of refactoring often requires nontrivial program analysis, and applying transformations may affect many locations throughout a program. In recent years, the emergence of light-weight programming methodologies such as Extreme programming has generated a great amount of interest in refactoring, and refactoring support has become a required feature in today's IDEs. This workshop is a continuation of a series of previous workshops (ECOOP 2007, OOPSLA 2008 and 2009 - see http://***/WRT) where researchers and developers of refactoring tools can meet and discuss recent ideas and work, and view tool demonstrations.

关键词： Refactoring program Analysis program manipulation Transformation

来源：评论

学校读者我要写书评

暂无评论

Compositionality in the puzzle of semantics

Compositionality in the puzzle of semantics

引用

ACM/SIGPLAN Workshop on Partial Evaluation and Semantics-Based program manipulation (PEPM 02)

作者： Giacobazzi, R Mastroeni, I Univ Verona Dipartimento Informat I-35134 Verona Italy

In this paper we study the connection between the structure of relational abstract domains for program analysis and compositionality of the underlying semantics. Both can be systematically designed as solution of the same abstract domain equation involving the same domain refinement: the reduced power operation. We prove that most well-known compositional semantics of imperative programs, such as the standard denotational and weakest precondition semantics can be systematically derived as solutions of simple abstract domain equations. This provides an equational presentation of both semantics and abstract domains for program analysis in a unique formal setting. Moreover both finite and transfinite compositional semantics share the same structure, and this allows us to provide consistent models for program manipulation.

关键词： abstract interpretation reduced power compositional semantics transfinite semantics program manipulation

来源：评论

学校读者我要写书评

暂无评论

The 2nd workshop on refactoring tools (WRT'08)

The 2nd workshop on refactoring tools (WRT'08)

引用

23rd ACM SIGPLAN Conference on Object Oriented programming Systems Languages and Applications,OOPSLA 2008

作者： Dig, Danny Fuhrer, Robert M. Johnson, Ralph Computer Science and Artificial Intelligence Lab Masschusetts Institute of Technology 32 Vassar St. Cambridge MA United States IBM Watson Research Center 19 Skyline Drive Hawthorne NY 10532 United States Department of Computer Science 201 N Goodwin Avenue Urbana IL 61801 United States

Refactoring is the process of applying behavior-preserving transformations to a program with the objective of improving the program's design. A specific refactoring is identified by a name (e.g., EXTRACT METHOD), a set of preconditions, and a set of specific transformations that need to be performed. Tool support for refactoring is highly desirable because checking the preconditions for a given refactoring often requires nontrivial and non-local program analysis, and applying the transformations may affect many locations in the program. In recent years, the emergence of light-weight programming methodologies such as Extreme programming has generated a great amount of interest in refactoring, and refactoring support has become a required feature in modern-day IDEs. Until now, there has not been a suitable forum for discussions among researchers and developers of such tools. This full-day event on refactoring tools fills that need, with a strongly practical focus. The workshop features both presentations given by developers and researchers in the field of refactoring, as well as demonstrations of practical refactoring tools.

关键词： program Analysis program manipulation Refactoring Transformation

来源：评论

学校读者我要写书评

暂无评论

Some transformations for developing recursive programs

Some transformations for developing recursive programs

引用

1975 International Conference on Reliable Software

作者： Burstall, R.M. Darlington, John Department of Artificial Intelligence University of Edinburgh EdinburghEH89NW United Kingdom

The paper describes a system of rules for transforming programs, the programs being in the form of recursion equations. The idea is to start with a very simple, lucid and hopefully correct program, then to transform it into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. We hope to throw some light on the alternative structures for programs, also to indicate a possible initial phase for an automatic or semi-automatic program manipulation system. © 1975 Author.

关键词： Optimisation program manipulation program transformation Recursion

来源：评论

学校读者我要写书评

暂无评论

GRAMMAR-BASED DEFINITION OF METAprogramMING SYSTEMS

引用

ACM TRANSACTIONS ON programMING LANGUAGES AND SYSTEMS 1984年第1期6卷 20-54页

作者： CAMERON, RD ITO, MR UNIV BRITISH COLUMBIA DEPT ELECT ENGNVANCOUVER V6T 1W5BCCANADA

A metaprogramming system is a programming facility (subprogramming system or language) whose basic data objects include the programs and program fragments of some particular programming language, known as the target language of the system. Such systems are designed to facilitate the writing of metaprograms, that is, programs about programs. Metaprograms take as input programs and fragments in the target language, perform various operations on them, and possibly generate modified target-language programs as output. A grammar-based approach to the specification of the syntactic-manipulation component of a metaprogramming system is described. The method derives the specifications for a set of programmanipulating subprograms from an augmented BNF grammar for the target language. The method is applicable to any programming language and is illustrated in its particular application to Pascal. © 1984, ACM. All rights reserved.

关键词： Grammar-based processing metaprogram metaprogramming system program improvement program manipulation

来源：评论

学校读者我要写书评

暂无评论

CONTINUATION-BASED program TRANSFORMATION STRATEGIES

引用

JOURNAL OF THE ACM 1980年第1期27卷 164-180页

作者： WAND, M Computer Science Department Indiana University Bloomington IN

program transformations often revolve the generahzation of a function to take additional arguments It is shown that m many eases such an additional variable arises as a representation of the continuation or global context m which the function is evaluated. By considering continuations, local transformation strategies can take advantage of global knowledge The general results are followed by two examples' the a-fl tree pruning algorithm and an algorithm for the conversion of a propositional formula to conjunctive normal form. © 1980, ACM. All rights reserved.

关键词： continuations generahzatlon optumzation program manipulation program transformations recursion subgoal reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：