Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agrawal, H. and Horgan, J. R. (1990). Dynamic program slicing. In Proceedings of the ACM SIGPLAN ’90 Conference on Programming Language Design and Implementation, volume 25, pages 246-256, White Plains, NY.
Baehrecke, E. H., Dang, N., Babaria, K., and Shneiderman, B. (2004). Visualization and analysis of microarray and gene ontology data with treemaps. BMC Bioinformatics, 5(84).
Johnson, B. and Shneiderman, B. (1991). Treemaps: a space-filling approach to the visualization of hierarchical information structures. In VIS ’91: Proceedings of the 2nd conference on Visualization, pages 284-291, Los Alamitos, CA, USA. IEEE Computer Society Press.
Weiser, M. (1981). Program slicing. In ICSE ’81: Proceedings of the 5th international conference on Software engineering, pages 439-449, Piscataway, NJ, USA. IEEE Press.
Zhang, X., Gupta, R., and Zhang, Y. (2003). Precise dynamic slicing algorithms.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 International Federation for Information Processin
About this paper
Cite this paper
Panahi, M., Harmon, T., Colmenares, J.A., Gorappa, S., Klefstad, R. (2007). Identification and Removal of Program Slice Criteria for Code Size Reduction in Embedded Systems. In: Rettberg, A., Zanella, M.C., Dömer, R., Gerstlauer, A., Rammig, F.J. (eds) Embedded System Design: Topics, Techniques and Trends. IFIP – The International Federation for Information Processing, vol 231. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-72258-0_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-72258-0_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-72257-3
Online ISBN: 978-0-387-72258-0
eBook Packages: Computer ScienceComputer Science (R0)