## A Language Theoretic Approach to Algorithm and Software Development (1999)

### BibTeX

@MISC{99alanguage,

author = {},

title = {A Language Theoretic Approach to Algorithm and Software Development},

year = {1999}

}

### OpenURL

### Abstract

### Citations

2438 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...by Arnold and Crubille, which turns out to be based on the same ideas as the one that we derive using program transformational methodology. In fact, a large number of algorithms in text books such as =-=[1]-=- can be easily explained by actually deriving them from their high level specifications using program transformational methodologies. It is our belief that this process of formally, or informally deri... |

152 |
Programming with sets; an introduction to SETL
- Schwartz, Dewar, et al.
- 1986
(Show Context)
Citation Context ...uite possibly in practice resolve this problem by helping improve the productivity and reliability of high performance algorithmic software. One of the languages of particular interest to us is SETL (=-=[12]-=-), which is a very high level, general- purpose, imperative programming language based on the semantic notions of Set Theory. Use of copy-value semantics, and built-in support for datatypes such as se... |

113 |
Automatic Construction of Sparse Data Flow Evaluation Graphs
- Choi, Cytron, et al.
- 1991
(Show Context)
Citation Context ...alysis algorithm using a standard data flow framework [11, 13]. The intra-procedural aliasing information is computed by applying well-known iterative techniques to the Sparse Evaluation Graph (SEG) (=-=[3]-=-). The computation requires a transfer function for each node that 2scauses a potential pointer assignment (relating the data flow information flowing into and out of the node), and a set of aliases h... |

111 |
Finite Differencing of Computable Expressions
- Paige, Koenig
- 1982
(Show Context)
Citation Context ...sion, quantification, and a variety of operations on binary relations. High SETL is implemented in terms of Low 1sSETL either by direct transformation, or by using finite differencing transformations =-=[10]-=- in which repetitive computation of costly High SETL expressions is replaced by their more inexpensive incremental counterparts. Finally, SQ2+ is a statically typed functional subset of High SETL augm... |

98 | Interprocedural pointer alias analysis
- Hind, Burke, et al.
- 1999
(Show Context)
Citation Context ...is The problem is to compute a safe approximation to the may-alias relation at every program point for programs in an imperative language such as C. We use the problem specification from Hind et al. (=-=[7]-=-), who formulate an intra-procedural may-alias analysis algorithm using a standard data flow framework [11, 13]. The intra-procedural aliasing information is computed by applying well-known iterative ... |

90 |
Fast algorithms for solving path problems
- Tarjan
- 1981
(Show Context)
Citation Context ...grams in an imperative language such as C. We use the problem specification from Hind et al. ([7]), who formulate an intra-procedural may-alias analysis algorithm using a standard data flow framework =-=[11, 13]-=-. The intra-procedural aliasing information is computed by applying well-known iterative techniques to the Sparse Evaluation Graph (SEG) ([3]). The computation requires a transfer function for each no... |

30 |
Data Flow Analysis for Procedural Languages
- Rosen
- 1976
(Show Context)
Citation Context ...grams in an imperative language such as C. We use the problem specification from Hind et al. ([7]), who formulate an intra-procedural may-alias analysis algorithm using a standard data flow framework =-=[11, 13]-=-. The intra-procedural aliasing information is computed by applying well-known iterative techniques to the Sparse Evaluation Graph (SEG) ([3]). The computation requires a transfer function for each no... |

26 | Viewing a program transformation system at work
- Paige
- 1994
(Show Context)
Citation Context ...lysis and dynamic reference counting. A very local fix of the existing SETL2 compiler based on these ideas led to a 10-fold improvement in the performance of a large 15000 line SETL application (APTS =-=[9]-=-). My work on the may-alias analysis arose from my general interest in area of program analysis and optimization. I am particularly interested in developing practical algorithms for program analysis o... |

13 | Program derivation with verified transformations
- Keller, Paige
- 1995
(Show Context)
Citation Context ... Finally, SQ2+ is a statically typed functional subset of High SETL augmented with least and greatest fixed points, which are transformed into High SETL using the dominated convergence transformation =-=[8]-=-. The typability of a program at any level of specification guarantees the typability of the programs obtained by transformation at all lower levels of abstraction, and hence guarantees the efficient ... |

8 | An improved intra-procedural may-alias analysis algorithm
- Goyal
- 1999
(Show Context)
Citation Context ...the program transformational techniques, along with finite differencing and dominated convergence, enabled us to derive a worst case O(N 3) time algorithm for computing the same may-alias information =-=[4]-=-. It is our strong belief that the use of formal techniques did not hamper the process of algorithm development, but in fact gave valuable insight into the problem, and led to the development of a muc... |

8 | The formal reconstruction and speedup of the linear time fragment of Willardâ€™s relational calculus subset
- Goyal, Paige
- 1997
(Show Context)
Citation Context ...ogram automatically guarantees that all hash-based operations in Willard's implementation, can actually be performed in constant time without the use of hashing. Thus, we get a worst case linear time(=-=[5]-=-) implementation of LRCS. We were successful in not only improving Willard's algorithm but also in significantly simplifying it. Willard's original algorithm involved over 80 pages of sometimes compli... |

8 | R.: A New Solution to the Hidden Copy Problem
- Goyal, Paige
- 1998
(Show Context)
Citation Context ...nd was responsible for asymptotically large slow-downs in SETL implementations. A lot of work was done as a part of the SETL project to tackle this problem, but achieved relatively little success. In =-=[6]-=-, we gave a new heuristic for SETL hidden copy optimization based on an interesting combination of static program analysis and dynamic reference counting. A very local fix of the existing SETL2 compil... |

6 |
A linear algorithm to solve fixed point equations on transition systems
- Arnold, Crubille
- 1988
(Show Context)
Citation Context ...ertain properties are expressible as least fixed points of recursive systems of equations. The computation of these fixed-points is useful for the verification of such properties. Arnold and Crubille =-=[2]-=- were the first to come up with a linear time algorithm for solving such fixed point equations on transition systems. They present an algorithm that associates fixed pieces of program fragments with e... |