Program slicing: Difference between revisions

Revision as of 23:48, 15 September 2009

Revision as of 09:24, 5 January 2010

Line 3:

In [[computer programming]], '''program slicing''' is the computation of a program slice. The '''program slice''' consists of the parts of a program that may affect the values computed at some point of interest, referred to as a '''slicing criterion'''. Program slicing can be used in [[debugging]] to locate source of errors more easily. Other applications of slicing include [[software maintenance]], [[Optimization (computer science)|optimization]], [[Program analysis (computer science)|program analysis]], and [[Non-interference (security)|information flow control]].

Slicing techniques hashave been seeing a rapid development since the original definition by [[Mark Weiser]]. At first, slicing was only static, i.e., applied on the source code with no other information than the source code. [[Bogdan Korel]] and [[Janusz Laski]] introduced ''dynamic slicing'', which works on a specific execution of the program (for a given execution trace). Other forms of slicing exist, for instance path slicing.

== Static slicing ==