Sciweavers

Share
CORR
2010
Springer

Complexity of Data Dependence problems for Program Schemas with Concurrency

10 years 8 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed. Given a vertex l in the flowchart of a schema S having only equality (variable copying) assignments, and variables v, w, we show that it is PSPACE-hard to decide whether there exists an execution of a program defined by S in which v holds the initial value of w at at least one occurrence of l on the path of execution, with membership in PSPACE holding provided there is a constant upper bound on the arity of any predicate in S. We also consider the `dual' problem in which v is required to hold the initial value of w at every occurrence of l, for which the analogous results hold. Additionally, the former problem for programs with non-deterministic branching (in effect, free schemas) in which assignments with functions ar...
Sebastian Danicic, Robert M. Hierons, Michael R. L
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2010
Where CORR
Authors Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Comments (0)
books