Existing proofs of correctness for dependence-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 dependence-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.

中文翻译：

---

跨过程、可能非终止程序的基于依赖的切片的语义正确性

现有的基于依赖的切片方法的正确性证明仅限于过程内程序的切片 [2, 39]，或者该证明仅适用于特定的切片方法 [4, 41]。我们为 Weiser [50, 51] 或 Binkley 等人的基于依赖的切片方法提供了正确性的一般证明。[7, 8]，用于程序间，可能是非终止程序。该证明使用格式良好的弱控制闭包关系和强控制闭包关系，这是 Danicic 等人提供的广义弱/强控制闭包的过程间扩展。[13]，捕获了文献中提出的各种非终止不敏感和非终止敏感的控制依赖关系。因此，我们的证明框架适用于所有现有的控制依赖关系。我们提供了语义正确 (SC) 切片的定义。我们证明 SC 切片与 Weiser 切片一致，确定性 SC 切片保留终止，并且非确定性 SC 切片保留原始程序的非确定性行为。