Abstract Interpretation and Low-Level Code Optimization

Abstract Interpretation and Low-Level Code Optimization (1995)

Cached

Download Links

[www.cs.arizona.edu]

Other Repositories/Bibliography

DBLP

by Saumya Debray

BibTeX

@MISC{Debray95abstractinterpretation,
    author = {Saumya Debray},
    title = {Abstract Interpretation and Low-Level Code Optimization},
    year = {1995}
}

Bookmark

OpenURL

Abstract

Abstract Interpretation is widely accepted as

Citations

1635	Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - Cousot, Cousot - 1977
677	A data locality optimizing algorithm - Wolf, Lam - 1991
544	Systematic design of program analysis frameworks - Cousot, Cousot - 1979
533	A transformation system for developing recursive programs - Burstall, Darlington - 1977
375	Deforestation: Transforming programs to eliminate trees - Wadler - 1990
332	Compiler transformation for high-performance computing - BACON, GRANHAM, et al. - 1994
284	Automatic translation of Fortran programs to vector form - Allen, Kennedy - 1987
182	Soft typing with conditional types - Aiken, Wimmers, et al. - 1994
180	Compiler optimizations for improving data locality - Carr, McKinley, et al. - 1994
163	Unboxed objects and polymorphic typing - Leroy - 1992
155	The prioritybased coloring approach to register allocation - Chow, Hennessy - 1990
140	Predicting program behavior using real or estimated pro les - Wall - 1991
120	The Design and Implementation of the SELF Compiler, an Optimizing Compiler for an Objected-Oriented Programming Language - Chambers - 1992
112	S.S.: Efficient instruction scheduling for a pipelined architecture - Gibbons, Muchnick - 1986
110	Non-failure Analysis for Logic Programs - Debray, López-García, et al. - 1997
101	S.: Finite differencing of computable expressions - Paige, Koenig - 1982
95	Can Logic Programming Execute as Fast as Imperative Programming - Roy - 1990
94	Unboxed values as first class citizens in a non-strict functional language - Jones, Launchbury - 1991
80	Mechanical program analysis - Wegbreit - 1975
76	Automatic complexity analysis - Rosendahl - 1989
73	Global Flow Analysis as a Practical Compilation Tool - Hermenegildo, Warren, et al. - 1992
71	On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications - Deutsch - 1990
70	K.: The &-Prolog System: Exploiting Independent AndParallelism - Hermenegildo, Greene - 1991
66	Tabulation techniques for recursive programs - Bird - 1980
63	Task Granularity Analysis in Logic Programs - Debray, Lin, et al. - 1990
60	Safe fusion of functional expressions - Chin - 1992
58	Spill code minimization techniques for optimizing compilers - Bernstein, Goldin, et al. - 1989
57	A case for runtime code generation - Keppel, Eggers, et al. - 1991
55	Accurate static estimators for program optimization - Wagner, Maverick, et al. - 1994
54	DCG: An efficient, retargetable dynamic code generation system - Engler, Proebsting - 1994
53	C.: Towards better inlining decisions using inlining trials - Dean, Chambers - 1994
50	An Automatic Complexity Evaluator - Metayer - 1988
44	Complexity analysis for a lazy higher-order language - Sands - 1990
43	Static dependent costs for estimating execution time - Reistad, DK - 1994
42	Subprogram inlining: A study of its effects on program execution time - Davidson, Holler - 1992
42	An automatic technique for the selection of data representations in SETL programs - Schonberg, Schwartz, et al. - 1981
38	Formally optimal boxing - Henglein, J0rgensen - 1994
34	High-performance Prolog Implementation - Taylor - 1991
33	Strictness analysis aids time analysis - Wadler - 1988
31	Safety considerations for storage allocation optimizations - Chase
29	An empirical and analytic study of stack vs. heap cost for languages with closures - Appel, Shao - 1994
27	A compositional approach to time analysis of first order lazy functional programs - Bjerner, Holmstrom - 1989
24	Unexpected side effects of inline substitution: a case study - Cooper, Hall, et al. - 1992
23	Analysis of Shared Data Structures for Compile-Time Garbage Collection in Logic Programs - Mulkers, Winsborough, et al. - 1990
22	jc: An efficient and portable sequential implementation of janus - Gudeman, Bosschere, et al. - 1992
19	Some techniques for recursion removal from recursive functions - Arsac, Kodratoff - 1982
19	Formalizing the analysis of algorithms - Ramshaw - 1979
17	Using Run-Time List Sizes to Guide Parallel Thread Creation - Huelsbergen, Larus, et al. - 1994
17	Live-structure dataflow analysis for prolog - Mulkers, Winsborough, et al. - 1994
15	Call forwarding: A simple interprocedural optimization technique for dynamically typed languages - Bosschere, Debray, et al. - 1994