Abstract
In this paper, we study program transformations called useless-code elimination and program slicing in the context of the π-calculus. The aim of useless-code elimination and program slicing is to simplify a program by eliminating useless or unimportant part of the program. We define formal correctness criteria for those transformations, present a type-based transformation method, and prove its correctness. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Kobayashi, N. (2003). Useless-code elimination and program slicing for the pi-calculus. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2895, 55–72. https://doi.org/10.1007/978-3-540-40018-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
