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
Slicing-based Reductions for Rebeca
Electronic Notes in Theoretical Computer Science (ENTCS)
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Actor-based slicing techniques for efficient reduction of Rebeca models
Science of Computer Programming
Abstract program slicing: from theory towards an implementation
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A vocabulary of program slicing-based techniques
ACM Computing Surveys (CSUR)
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
SAS'07 Proceedings of the 14th international conference on Static Analysis
Abstract program slicing of database query languages
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper proposes a new approach to program slicing based on abstract interpretation and model checking. First, the notion of abstract slicing is introduced. Abstract slicing extends static slicing with predicates and constraints by using as the program model an abstract state graph, which is obtained by applying predicate abstraction to a program, rather than a flow graph. This leads to a program slice that is more precise and smaller than its static counterpart. Second, a method for performing abstract slicing is developed. It is shown that abstract slicing can be reduced to a least fixpoint computation over formulas in the branching time temporal logic CTL. This enables one to use symbolic model checkers for CTL as an efficient computation engine for abstract slicing. A prototype implementation and experimental results are reported demonstrating the feasibility of the approach.