Complexity of Data Dependence problems for Program Schemas with Concurrency

Abstract

The problem of deciding whether one point in a program is data dependent upon another is fundamental to program analysis and has been widely studied. In this article we consider this problem at the abstraction level of <i>program schemas</i> in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary… (More)
DOI: 10.1145/2159531.2159537

Topics

Cite this paper

@article{Danicic2012ComplexityOD, title={Complexity of Data Dependence problems for Program Schemas with Concurrency}, author={Sebastian Danicic and Robert Mark Hierons and Michael R. Laurence}, journal={ACM Trans. Comput. Log.}, year={2012}, volume={13}, pages={15:1-15:18} }