Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/7566
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDanicic, S-
dc.contributor.authorHierons, RM-
dc.contributor.authorLaurence, MR-
dc.date.accessioned2013-07-10T11:47:21Z-
dc.date.available2013-07-10T11:47:21Z-
dc.date.issued2012-
dc.identifier.citationACM Transactions on Computational Logic, 13(2): Artn 15, Apr 2012en_US
dc.identifier.issn1529-3785-
dc.identifier.urihttp://dl.acm.org/citation.cfm?doid=2159531.2159537en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/7566-
dc.descriptionThis is the pre-print version of the Article. The official published version can be accessed from the links below. Copyright @ 2012 ACMen_US
dc.description.abstractThe 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 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 nondeterministic branching (in effect, free schemas) in which assignments with functions are allowed is proved to be polynomial-time decidable provided a constant upper bound is placed upon the number of occurrences of the concurrency operator in the schemas being considered. This result is promising since many concurrent systems have a relatively small number of threads (concurrent processes), especially when compared with the number of statements they have.en_US
dc.language.isoenen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.subjectProgram analysisen_US
dc.subjectData dependenceen_US
dc.subjectProgram schemasen_US
dc.subjectFree schemasen_US
dc.subjectHerbrand domainen_US
dc.titleComplexity of data dependence problems for program schemas with concurrencyen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1145/2159531.2159537-
pubs.organisational-data/Brunel-
pubs.organisational-data/Brunel/Brunel Active Staff-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/IS and Computing-
pubs.organisational-data/Brunel/University Research Centres and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for Information and Knowledge Management-
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
1007.3878v4.pdf259.69 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.