An alternative characterization of weak order dependence

Amtoft, Torben and Androutsopoulos, Kelly and Clark, David and Harman, Mark and Li, Zheng (2010) An alternative characterization of weak order dependence. Information Processing Letters, 110 (21). pp. 939-943. ISSN 0020-0190

Full text is not in this repository.

Abstract

Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can allow for reactive programs with their necessarily non-terminating computations. One important such definition is the definition of Weak Order Dependence, which was introduced to generalize classical control dependence for a Control Flow Graph (CFG) without end nodes. In this paper we show that for a CFG where all nodes are reachable from each other, weak order dependence can be expressed in terms of traditional control dependence where one node has been converted into an end node.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 13951
Useful Links:
Depositing User: Kelly Androutsopoulos
Date Deposited: 28 Nov 2014 14:08
Last Modified: 13 Oct 2016 14:32
URI: http://eprints.mdx.ac.uk/id/eprint/13951

Actions (login required)

Edit Item Edit Item