Semantic foundations of binding-time analysis for imperative programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Semantic foundations of binding-time analysis for imperative programs

Full text

Pdf (1.04 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

La Jolla, California, United States

Pages: 100 - 110

Year of Publication: 1995

ISBN:0-89791-720-0

Authors

Manuvir Das	Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton St., Madison, WI
Thomas Reps	Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton St., Madison, WI
Pascal van Hentenryck	Computer Sciences Department, Brown University, 115 Waterman St., Providence, RI

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 5, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/215465.215569 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	B. Alpern , M. N. Wegman , F. K. Zadeck, Detecting equality of variables in programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-11, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73561]
	2	Dorothy E. Denning , Peter J. Denning, Certification of programs for secure information flow, Communications of the ACM, v.20 n.7, p.504-513, July 1977 [doi>10.1145/359636.359712]
	3	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	4	Carsten Kehler Holst, Finiteness analysis, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.473-495, June 1991, Cambridge, Massachusetts, United States
	5	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.26-60, Jan. 1990 [doi>10.1145/77606.77608]
	6	Jones, N D., "Automatic program specialization: A reexamination fl'om basic principles," pp. 225-282 in Partial Evaluatzon and Mixed Conq)umt~on" Proceedings of the tFIP TC2 Workshop on Parttal Evaluation and Mtxed Computatton, (Gammel Avernaes, Denmark, 18-24 October, 1987), ed. D. Bj&ner, A.P. Ershov, N.D, Jones,North-Holland, New York, NY (1988).
	7	Neil D. Jones , Carsten K. Gomard , Peter Sestoft, Partial evaluation and automatic program generation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	8	Uwe Meyer, Techniques for partial evaluation of imperative languages, ACM SIGPLAN Notices, v.26 n.9, p.94-105, Sept. 1991
	9	Mogensen, T., "Partially static structures in a self-applicable partial evaluator," pp. 325-347 in Parttal Evahtatwn and Mtxed Compumtton: Proceedings of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, (Gammel Avernaes, Denmark, 18-24 October, 1987), ed. D. Bjqbrner, A.P. Ershov. N D Jones, North-Holland, New York, NY (1988)
	10	Karl J. Ottenstein , Linda M. Ottenstein, The program dependence graph in a software development environment, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.177-184, April 1984
	11	Ramalingam, G, and Reps, T., "Semantics of program representation graphs," TR-900, Computer Sciences Department, University of Wisconsin, Madison, WI (December I989).
	12	Schmidt, D., Denomttonal Semantics, Allyn and Bacon, Inc., Boston, MA (1986).
	13	Sestoft, P, "Automatic call unfolding in a partial evaIuator," pp. 485-506 in Partial Evaluation and Mtxed Computation: Proceedings oJ the IFIP TC2 Workshop on Parttal Ewtluation and Mtxed Comt)umtlon, (Gammel Avernaes, Denmark, 18-24 October, 1987), ed. D. Bjq~rner, A.P, Ershov, N.D. Jones,North-Holland, New York, NY (1988).
	14	Mitchell Wand, Specifying the correctness of binding-time analysis, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.137-143, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158614]
	15	Welser, M., "Program slicing," IEEE Transactions on Software Engineering SE-10(4) pp. 352-357 (July 1984)
	16	Wuu Yang , Susan Horwitz , Thomas Reps, A program integration algorithm that accommodates semantics-preserving transformations, ACM Transactions on Software Engineering and Methodology (TOSEM), v.1 n.3, p.310-354, July 1992 [doi>10.1145/131736.131756]

CITED BY 4

	Andrei Sabelfeld , David Sands, A Per Model of Secure Information Flow in Sequential Programs, Higher-Order and Symbolic Computation, v.14 n.1, p.59-91, March 2001
	Todd B. Knoblock , Erik Ruf, Data specialization, ACM SIGPLAN Notices, v.31 n.5, p.215-225, May 1996
	Luke Hornof , Jacques Noyé, Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity, ACM SIGPLAN Notices, v.32 n.12, p.63-73, Dec. 1997
	Dylan McNamee , Jonathan Walpole , Calton Pu , Crispin Cowan , Charles Krasic , Ashvin Goel , Perry Wagle , Charles Consel , Gilles Muller , Renauld Marlet, Specialization tools and techniques for systematic optimization of system software, ACM Transactions on Computer Systems (TOCS), v.19 n.2, p.217-251, May 2001