Inter-Procedural Static Slicing Using Advanced Caching Algorithm *
Mihály Biczó, Krisztián Pócza, Zoltán Porkoláb · 2007
Since the notion of program slicing was introduced in the early 80’s, the area has seen a continuous evolution. While the more recent approach of dynamic slicing gained significant interest, static slicing has also been widely studied. Original methods used dataflow analysis techniques, later different approaches using multi-graphs were formed. Although these improved algorithms offer the capability to slice real-world application s, their usability is still heavily confined by their resource intensive characteristics. In this paper an advanced caching algorithm intended to decrease average complexity of SDG-based static slicing is proposed. Caching different for mal parameter setups of a procedure might imply significant speed growth since re-computing dependences between formal input and output parameters is avoidable.