Improving slice accuracy by compression of data and control flow paths

Authors:
Aharon Abadi;Ran Ettinger;Yishai A. Feldman
Affiliations:
IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel
Venue:
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Year:
2009

Citing 12
Cited 3

The programmer's apprentice

The programmer's apprentice
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
On slicing programs with jump statements

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Static slicing in the presence of goto statements

ACM Transactions on Programming Languages and Systems (TOPLAS)
Portability by automatic translation: a large-scale case study

Artificial Intelligence
A new Algorithm for slicing unstructured programs

Journal of Software Maintenance: Research and Practice
Better Slicing of Programs with Jumps and Switches

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
Slicing Programs with Arbitrary Control-flow

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
The program dependence graph in a software development environment

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementation

ACM Transactions on Software Engineering and Methodology (TOSEM)
Discern: Towards the Automatic Discovery of Software Contracts

SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
A formal representation for plans in the programmer's apprentice

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2

A unifying theory of control dependence and its application to arbitrary program structures

Theoretical Computer Science
Fine slicing: theory and applications for computation extraction

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Automatic recovery of statecharts from procedural code

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing is a useful technique in tools for program understanding and transformation. Computing correct and accurate slices for unstructured programs is particularly difficult. We present a new family of slicing algorithms that are proved correct and are more accurate than the best previous algorithms. An empirical study shows significant improvements of our algorithms on real code.