Results 1  10
of
10
A Complete Transformational Toolkit for Compilers
 ACM Transactions on Programming Languages and Systems
, 1996
"... . In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program sl ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
. In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program slicing, symbolic evaluation, conditional constant propagation, and dependence analysis. PIM consists of the untyped lambda calculus extended with an algebraic rewriting system that characterizes the behavior of lazy stores and generalized conditionals. A major question left open in the earlier paper was whether there existed a complete equational axiomatization of PIM's semantics. In this paper, we answer this question in the affirmative for PIM's core algebraic component, PIM t , under the assumption of certain reasonable restrictions on term formation. We systematically derive the complete PIM logic as the culmination of a sequence of increasingly powerful equational systems starti...
An omegacomplete Equational Specification of Interleaving
, 2000
"... We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that exten ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an !complete specification, which is finite in a setting with finitely many actions. 1991 Mathematics Subject Classification: 68Q10; 68Q65; 68Q70 1991 ACM Computing Classification System: D.1.3; F.1.1; F.1.2 Keywords and Phrases: Process Algebra, Algebraic Specification, Interleaving, !completeness. Note: Research supported by the Netherlands Organization for Scientific Research (NWO) under contract SION 61233008. Work carried out under project SEN 2.1 Process Specification and Analysis. 1. Introduction The interleaving paradigm consists of the assumption that two atomic actions cannot happen at the same time, so that concurrency reduces to nondetermini...
Equations as a Uniform Framework for Partial Evaluation and Abstract Interpretation
 Electronic supplement: 1998 Symposium on Partial Evaluation (SOPE '98
, 1997
"... Interpretation J. Field IBM T. J. Watson Research Center P.O. Box 704, Yorktown Heights, NY 10598, USA J. Heering, T.B. Dinesh CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands ABSTRACT A variety of disparate methods have traditionally been used to define the execution semantics of prog ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Interpretation J. Field IBM T. J. Watson Research Center P.O. Box 704, Yorktown Heights, NY 10598, USA J. Heering, T.B. Dinesh CWI P.O. Box 94079, 1090 GB Amsterdam, The Netherlands ABSTRACT A variety of disparate methods have traditionally been used to define the execution semantics of programming languages, to describe partial evaluation, to formalize program analysis as abstract interpretation, and to implement each of these operations in practical systems. We argue here that equational logic can serve to unify each of these aspects of language manipulation. 1991 Computing Reviews Classification: D.3.4, F.3.2 Keywords and Phrases: equational logic, algebraic specification, program analysis, partial evaluation, abstract interpretation Note: Submitted to the SOPE'98, special issue of the ACM Computer Surveys. This research was supported in part by the Netherlands Organization for Scientific Research (NWO) under the Generic Tools for Program Analysis and Optimization p...
Prehistory of the ASF+SDF System (19801984)
 Group, University of Amsterdam
, 1994
"... The first stages of the development of the ASF+SDF system are discussed. 1 Monolingual beginning Our work on programming environments started in 1980 with the design of a dedicated environment for the Summer programming language [1], an objectoriented language with class definitions. Rather than ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The first stages of the development of the ASF+SDF system are discussed. 1 Monolingual beginning Our work on programming environments started in 1980 with the design of a dedicated environment for the Summer programming language [1], an objectoriented language with class definitions. Rather than a dedicated Summer environment, the general concept of a monolingual environment emerged [2]. In such an environment, a single language is used in different modes. More specifically, we investigated the requirements an integrated command/programming/debugging language would have to satisfy. Since Summer had not been designed with this particular purpose in mind, it is not surprising that a monolingual environment for Summer would have involved a revision of the language. This may have been one of the reasons we never "instantiated" the monolingual concept for Summer, but there were other, more important, ones: 1 ffl At that time Leo Geurts, Lambert Meertens, and other members of the Afdel...
Jones Optimality, BindingTime Improvements, and the Strength of Program Specializers
"... Jones optimality tells us that a program specializer is strong enough to remove an entire level of selfinterpretation. We show that Jones optimality, which was originally aimed at the Futamura projections, plays an important role in bindingtime improvements. The main results show that, regardless ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Jones optimality tells us that a program specializer is strong enough to remove an entire level of selfinterpretation. We show that Jones optimality, which was originally aimed at the Futamura projections, plays an important role in bindingtime improvements. The main results show that, regardless of the bindingtime improvements which we apply to a source program, no matter how extensively, a specializer that is not Jonesoptimal is strictly weaker than a specializer which is Jones optimal. By viewing a bindingtime improver as a generating extension of a selfinterpreter, we can connect our results with previous work on the interpretive approach.
"Generating Tools from Algebraic Specifications" Abstracts of the papers from the ASF+SDF'95 Workshop CWI, Amsterdam, May 11 12, 1995
"... s of the papers from the ASF+SDF'95 Workshop CWI, Amsterdam, May 11 & 12, 1995 [1] J. Heering and P. Klint. The prehistory of ASF+SDF (19801984). pages 14. [2] P. Klint. The evolution of implementation techniques in the ASF+SDF metaenvironment. pages 526. Abstract: The ASF+SDF Metaenvironment ..."
Abstract
 Add to MetaCart
s of the papers from the ASF+SDF'95 Workshop CWI, Amsterdam, May 11 & 12, 1995 [1] J. Heering and P. Klint. The prehistory of ASF+SDF (19801984). pages 14. [2] P. Klint. The evolution of implementation techniques in the ASF+SDF metaenvironment. pages 526. Abstract: The ASF+SDF Metaenvironment is an interactive development environment for formal language definitions. It is both a metaenvironment supporting fully interactive editing of modular language definitions written in the formalism ASF+SDF and a generator for dedicated environments for defined languages. The actual development of this system started in 1985 as part of the GIPE (Generation of Interactive Programming Environments) projects [HKKL86]. Now, ten years later, it is worthwhile to assess what has been achieved and, more importantly, which problems are still to be addressed. A historical and at times methodological perspective is necessary in such an assessment. However, rather than evaluating all aspects of the sys...
J. Heering
 ACM Transactions on Programming Languages and Systems
, 1996
"... In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program slic ..."
Abstract
 Add to MetaCart
In an earlier paper, one of the present authors presented a preliminary account of an equational logic called PIM. PIM is intended to function as a "transformational toolkit" to be used by compilers and analysis tools for imperative languages, and has been applied to such problems as program slicing, symbolic evaluation, conditional constant propagation, and dependence analysis. PIM consists of the untyped lambda calculus extended with an algebraic rewriting system that characterizes the behavior of lazy stores and generalized conditionals. A major question left open in the earlier paper was whether there existed a complete equational axiomatization of PIM's semantics. In this paper, we answer this question in the affirmative for PIM's core algebraic component, PIM t , under the assumption of certain reasonable restrictions on term formation. We systematically derive the complete PIM logic as the culmination of a sequence of increasingly powerful equational systems starting f...
SENR0012 May 31, 2000
"... We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that exten ..."
Abstract
 Add to MetaCart
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an !complete specification, which is finite in a setting with finitely many actions. 2000 Mathematics Subject Classification: 68Q10; 68Q65; 68Q70 1998 ACM Computing Classification System: D.1.3; F.1.1; F.1.2 Keywords and Phrases: Process Algebra, Algebraic Specification, Interleaving, !completeness. Note: Research supported by the Netherlands Organization for Scientific Research (NWO) under contract SION 61233008. Work carried out under project SEN 2.1 Process Specification and Analysis. 1. Introduction The interleaving paradigm consists of the assumption that two atomic actions cannot happen at the same time, so that concurrency reduces to nondetermini...