You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Semantic Correctness of Dependence-Based Slicing for Interprocedural, Possibly Nonterminating Programs

Fulltext:


Publication Type:

Journal article

Venue:

ACM Transactions on Programming Languages and Systems


Abstract

Existing proofs of correctness for dependency-based slicing methods are limited either to the slicing of intraprocedural programs [2, 39], or the proof is only applicable to a specific slicing method [4, 41]. We contribute a general proof of correctness for dependency-based slicing methods such as Weiser [50, 51], or Binkley et al. [7, 8], for interprocedural, possibly nonterminating programs. The proof uses well-formed weak and strong control closure relations, which are the interprocedural extensions of the generalised weak/strong control closure provided by Danicic et al. [13], capturing various nonterminating insensitive and nontermination sensitive control dependence relations that have been proposed in the literature. Thus, our proof framework is valid for a whole range of existing control dependence relations. We have provided a definition of semantically correct (SC) slice. We prove that SC slices agree with Weiser slicing, that deterministic SC slices preserve termination, and that nondeterministic SC slices preserve the nondeterministic behavior of the original programs.

Bibtex

@article{Masud6023,
author = {Abu Naser Masud and Bj{\"o}rn Lisper},
title = {Semantic Correctness of Dependence-Based Slicing for Interprocedural, Possibly Nonterminating Programs},
editor = {Andrew C. Myers},
month = {December},
year = {2020},
journal = {ACM Transactions on Programming Languages and Systems},
url = {http://www.es.mdh.se/publications/6023-}
}