Sparse code motion

doi:10.1145/325694.325715

Sparse code motion

Full Text:

Pdf

Buy this Article

Authors:	Oliver Rüthing	University of Dortmund, Department of Computer Science, LS 5, D-44221 Dortmund, Germany
	Jens Knoop	University of Dortmund, Department of Computer Science, LS 5, D-44221 Dortmund, Germany
	Bernhard Steffen	University of Dortmund, Department of Computer Science, LS 5, D-44221 Dortmund, Germany

Published in:

	· Proceeding
	POPL '00 Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
	Pages 170 - 183 ACM New York, NY, USA ©2000 table of contents ISBN:1-58113-125-9 doi>10.1145/325694.325715

	2000 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 19 · Downloads (cumulative): 394 · Citation Count: 7

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- POPL '14

Tags: algorithms busy code motion code motion code size compuational optimality design embedded processors and systems expression motion languages lazy code motion life-time optimality management partial redundancy elimination processors space optimality specifying and verifying and reasoning about programs

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player