ACM Home Page
Please provide us with feedback. Feedback
Discovering auxiliary information for incremental computation
Full text PdfPdf (1.48 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
St. Petersburg Beach, Florida, United States
Pages: 157 - 170  
Year of Publication: 1996
ISBN:0-89791-769-3
Authors
Yanhong A. Liu  Department of Computer Science, Cornell University, Ithaca, New York
Scott D. Stoller  Department of Computer Science, Cornell University, Ithaca, New York
Tim Teitelbaum  Department of Computer Science, Cornell University, Ithaca, New York
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 19,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/237721.237769
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
F. E. Allen, J. Cocke, and K. Kennedy. Reduction of operator strength. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysas, chapter 3, pages 79- 101. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
 
3
4
5
 
6
7
8
9
 
10
R. S. Boyer and J. S. Moore. A Computational Logzc. ACM Monograph Series. Academic Press, New York, 1979.
 
11
M. Broy. Algebraic methods for program construction: The project CIP. In P. Pepper, editor, Program Transformation and Programmzng E#v,tronments, volume 8 of NATO Advanced Science Institutes Ser, es F: Computer and System Sciences, pages 199-222. Springer-VerIag, Berlin, 1984. Proceedings of the NATO Advanced Research Workshop on Program Transformation and Programming Environments, directed by F. L. Bauer and H. Remus, Munich, Germany, September 1983.
 
12
R. M. Burstall. Proving properties of programs by structural induction. The Computer Journal, 12(1):41- 48, 1969.
13
14
15
 
16
 
17
 
18
 
19
V. Donzeau-Gouge, G. Huet, G. Kahn, and B. Lang. Programming environments based on structure editor: The Mentor experience. In D. R. Barstow, H. E. Shrobe, and E. Sandewall, editors, Interactive Programm#ng Environments, pages 128-140. McGraw-Hill, New York, 1984.
 
20
J. Earley. High level iterators and a method for automatically designing data structure representation. Journal of Computer Languages, 1:321-342, 1976.
21
22
 
23
 
24
3. Glanz. Mathematical logic flushes out the bugs in chip designs. Science, 267:332-333, January 20, 1995.
 
25
 
26
D. Gries. A note on a standard strategy for developing loop invanants and loops. Science of Computer Pro. grarnming, 2"207-214, 1984.
 
27
28
29
30
 
31
 
32
33
 
34
U. Kastens. Ordered attributed grammars. Acta Informatica, 13(3):229-256, 1980.
35
 
36
S. C. Kleene. Introduction to Metamathematics. Van Nostrand, New York, 1952. Tenth reprint, Wolters- Noordhoff Publishing, Groningen and North-Holland Publishing Company, Amsterdam, 1991.
 
37
J. Launchbury. Projections for specialisation. In Partial Evaluation and Mixed Computation, pages 299-315. North-Holland, 1988.
 
38
 
39
40
 
41
42
 
43
 
44
 
45
46
47
48
 
49
50
51
52
53
 
54
55
 
56
57
58
 
59
 
60
61
62
 
63
M. Weiser Progreun slicing. IEEE Transactions on Software Engzneer#ng, $1#-10(4):352-357, July 1984
64

CITED BY  11

Collaborative Colleagues:
Yanhong A. Liu: colleagues
Scott D. Stoller: colleagues
Tim Teitelbaum: colleagues