This page is maintained for archival purposes only. For current information please visit http://prolangs.cs.vt.edu/.
This web page contains links to postscript versions of papers that may be covered by copyright (e.g., ACM Copyright).
-
Barbara G. Ryder,
"A Position Paper on Compile-time Program Analysis",
ACM Computing Surveys,
Volume 28A,
Number 4,
December,
1996.
URL: http://portal.acm.org/citation.cfm?id=251595.251615
Note: Also appeared in the January 1997 issue of ACM SIGPLAN Notices.
-
Stephen P. Masticola, Thomas J. Marlowe, and Barbara G. Ryder,
"Lattice Frameworks for Multi-Source and Bidirectional Data Flow Analysis Problems",
ACM TOPLAS,
Volume 17,
Number 5,
Pages 777-803,
September,
1995.
URL: ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-241.ps.Z
Note: Revised version of LCSR-TR-241.
-
T. J. Marlowe, B. G. Ryder, and M. Burke,
"Defining Flow Sensitivity for Data Flow Problems",
Laboratory of Computer Science Research Technical Report,
Number LCSR-TR-249,
July,
1995.
URL: ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-249.ps.Z
-
T. J. Marlowe and B. G. Ryder,
"Properties of Data Flow Frameworks: a Unified Model",
Acta Informatica,
Volume 28,
Pages 121-163,
1990.
URL: http://www.prolangs.rutgers.edu/refs/docs/DataflowFrameworks-Acta90.pdf
-
Barbara G. Ryder and Stephen J. Pendergrast,
"Experiments in Optimizing FP",
IEEE Transactions on Software Engineering,
Volume 14,
Number 4,
Pages 444-454,
April,
1988.
-
B. G. Ryder and M. C. Paull,
"Elimination Algorithms for Data Flow Analysis",
ACM Computing Surveys,
Volume 18,
Number 3,
Pages 277-316,
September,
1986.
See also: DCS-TR-140.
-
A. M. Berman, M. C. Paull, and B. G. Ryder,
"Proving Relative Lower Bounds for Incremental Algorithms",
Acta Informatica,
Volume 27,
Pages 665-583,
July,
199.
See also: DCS-TR-154 4/85.