An alternative characterization of weak order dependence

Autor:	Kelly Androutsopoulos, David M. Clark, Mark Harman, Zheng Li, Torben Amtoft
Rok vydání:	2010
Předmět:	Computation Information processing Dependence analysis Topology Computer Science Applications Theoretical Computer Science Control flow Program analysis Signal Processing Program slicing Control flow graph Graph (abstract data type) Algorithm Information Systems Mathematics
Zdroj:	Information Processing Letters. 110:939-943
ISSN:	0020-0190
DOI:	10.1016/j.ipl.2010.07.023
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5cbac00531245868be8eec4a0f7d8a90 https://doi.org/10.1016/j.ipl.2010.07.023 Zobrazit plný text záznamu Full Text from ScienceDirect