Submitted Presentations

PARLE '89 Parallel Architectures and Languages Europe

Volume 366 of the series Lecture Notes in Computer Science pp 55-72

Date:

Dataflow analysis of term graph rewriting systems

  • R. BanachAffiliated withDepartment of Computer Science, The University

Abstract

A form of dataflow analysis is presented as a technique for statically analysing aspects of term graph rewriting programs. In particular it is shown that non-trivial bounds on the set of symbols that might occur at a given position in the pattern of a rule can be obtained. The technique is extended to yield sufficient conditions for determining that for two positions in a given pattern of some rule, no matching homomorphism will ever map the two positions to the same graph node, in any execution of the program.