Dependence condition graph for semantics-based abstract program slicing

Authors:
Agostino Cortesi;Raju Halder
Affiliations:
Università Ca' Foscari di Venezia, Italy;Università Ca' Foscari di Venezia, Italy
Venue:
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Year:
2010

Citing 16
Cited 0

The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrating noninterfering versions of programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic program slicing

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Using Program Slicing in Software Maintenance

IEEE Transactions on Software Engineering
The formal semantics of programming languages: an introduction

The formal semantics of programming languages: an introduction
Precise interprocedural chopping

SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Extracting Reusable Functions by Flow Graph-Based Program Slicing

IEEE Transactions on Software Engineering
Slicing real-time programs for enhanced schedulability

ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete

Journal of the ACM (JACM)
Slicing concurrent programs

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Program Slicing in Understanding of Large Programs

IWPC '98 Proceedings of the 6th International Workshop on Program Comprehension
Data dependencies and program slicing: from syntax to abstract semantics

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The dependence condition graph: Precise conditions for dependence between program points

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many slicing techniques have been proposed based on the traditional Program Dependence Graph (PDG) representation. In traditional PDGs, the notion of data dependency between statements is based on syntactic presence of a variable in the definition of another variable or in a conditional expression. Mastroeni and Zanardini introduced semantics-based data dependency both at concrete and abstract domain. This semantics-based data dependency is computed at expression level over all possible (abstract) states appearing at program points. In this paper, we strictly improve this approach by (i) considering semantic relevancy of statements (not only expressions), and (ii) adopting conditional dependency. This allows us to transform the semantics-based (abstract) PDG into a semantics-based (abstract) Dependence Condition Graph (DCG) that enables to identify the conditions for dependence between program points. The resulting program slicing algorithm designed this way is strictly more accurate than the Mastroeni and Zanardini's one.