Useless-Code Elimination and Program Slicing for the Pi-Calculus
نویسنده
چکیده
In this paper, we study program transformations called uselesscode 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.
منابع مشابه
Useless Code Elimination and Programm Slicing for the Pi-Calculus
In this paper, we study program transformations called uselesscode 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 c...
متن کاملSort Abstraction for Static Analyses of Mobile Processes
The non-interference type based analysis and its closely related analyses (dead code elimination, program slicing, confidentiality, strictness, etc.) have been throughly studied in many programming paradigms. The work on this area has been initiated with functional programming, see e.g. [HR98, Pro00, ABHR99], as well as imperative programming, e.g. [SV98]. Following this idea, similar approache...
متن کاملAutomatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and complete way, by reducing it to the solution of a system of constraints. We also give a useless-code elimination algorithm which is based on a combined use of these type inference systems. The main application of the techni...
متن کاملA Static Calculus of Dependencies for the -cube
Dependency analysis aims at identifying how different parts of a program depend on each others. It is the kernel of many issues in program analysis such as dead-code, binding time, strictness, program slicing etc. We address the problem of dependency analysis in the context of typed -calculus. We consider all systems of the -cube and extend them conservatively by the addition of new typing rule...
متن کاملUsing Program Slicing to Drive Pre-Execution on Simultaneous Multithreading Processors
Pre-execution uses helper threads running in spare hardware contexts to trigger cache misses in front of the main thread, hence hiding their latency. At the heart of pre-execution is the code that runs in the pre-execution threads themselves. The most common approach is for preexecution threads to run a subset of the instructions executed by the original program, called backward slices [18], wh...
متن کامل