6 citations found. Retrieving documents...
J. T. Schwartz. Optimization of very high level languages { I: Value transmission and its corollaries. Journal of Computer Languages, 1(2):161-194, 1975.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Solving Regular Tree Grammar Based Constraints - Liu, Li, Stoller (2000)   (Correct)

....cation was roughly O(r) Implementation of the algorithm in this paper was found to be two to ten times as fast as the previous algorithm. Regular tree grammar based constraints have been used for analyzing recursive data in other applications and go back at least to Reynolds [51] and Schwartz [54]. Related work includes ow analysis for memory optimization by Jones and Muchnick [25] binding time analysis for partial evaluation by Mogensen [36] set based analysis of ML by Heintze [20] type inference by Aiken et al. 3, 4] backward slicing by Reps and Turnidge [50] and set based ....

J. T. Schwartz. Optimization of very high level languages { I: Value transmission and its corollaries. Journal of Computer Languages, 1(2):161-194, 1975.


Solving Regular Tree Grammar Based Constraints - Liu, Li, Stoller (2000)   (Correct)

....needed, but our measurements con rm the accurate complexities analyzed in terms of the identi ed parameters. 7 Related work and conclusion Regular tree grammar based constraints have been used for analyzing recursive data in other applications and go back at least to Reynolds [38] and Schwartz [40]. Related work includes ow analysis for memory optimization by Jones and Muchnick [22] binding time analysis for partial evaluation by Mogensen [29] set based analysis of ML by Heintze [17] type inference by Aiken et al. 2, 3] backward slicing by Reps and Turnidge [37] and set based ....

J. T. Schwartz. Optimization of very high level languages { I: Value transmission and its corollaries. Journal of Computer Languages, 1(2):161-194, 1975.


Type Analysis and Data Structure Selection - Cai, Facon, Henglein, Paige.. (1991)   (14 citations)  (Correct)

....program, where an object x is retrieved from a set s, we draw an edge s9 x; for each SETM operation where x is added to set s, we draw an edge x s; if x is used to perform an associative access on s, then we draw x 2 s. The OFG is related to but simpler than Schwartz s value flow analysis [Sch75a, Sch75b] Given an object flow graph for a typed SETM program, we require the base conditions given below (where t is a type variable) ffl For each variable s : set(t) and each OFG edge x s, we have x : t. ffl For each variable x : t and each OFG edge s9 x, we have s : set(t) ffl For ....

J. Schwartz. Optimization of very high level languages -- I: Value transmission and its corollaries. J. Computer Languages, 1:161--194, 1975.


SETL for Internet Data Processing - Bacon (2000)   Self-citation (Schwartz)   (Correct)

.... quotation above, sprang from the strong perception in the late 1960s that there was a need for a set oriented language capable of expressing concisely the kind of set intensive algorithm that kept arising in studies of compiler optimization, such as those by Allen, Cocke, Kennedy, and Schwartz [5, 43, 6, 41, 7, 10, 130, 11, 8, 9, 131, 178, 179, 180, 12, 132, 42]. Programming Languages and their Compilers [44] published early in 1970, devoted more than 200 pages to optimization algorithms. It included many of the now familiar techniques such as redundant code elimination and strength reduction, dealt extensively with graphs of control flow and their ....

....(definition use) information obtainable from analysis of control flow graphs, and more generally from Schwartz s value flow tracing [177, 178, 144] that could follow objects when they were stored in aggregates and later extracted, was useful in all sorts of ways. It sustained copy optimization [175, 178, 179], where the redundant copying of an object could be suppressed when the only subsequent use of the object also modified it, perhaps incrementally. Value flow analysis provided a 9 Introduction 1.2 A Brief History of SETL dependency framework wherein the types of many variables and expressions ....

J.T. Schwartz. Optimization of very high level languages---I: Value transmission and its corollaries. Computer Languages, 1(2):161--194, 1975.


Shallow Binding Makes Functional Arrays Fast - Baker (1991)   (9 citations)  (Correct)

No context found.

Schwartz, J.T. "Optimization of very high level languages---I. Value transmission and its corollaries". J. Computer Lang. 1 (1975),161-194.


The Nimble Type Inferencer for Common Lisp-84 - Baker (1990)   (3 citations)  (Correct)

No context found.

Schwartz, J.T. "Optimization of very high level languages---I. Value transmission and its corollaries". J. Computer Lang. 1 (1975),161-194.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC