"Linking Dataflow Algebra with the CaDiZ Tool"

Supervised by A.Cowling

Abstract

Dataflow algebra (DFA) presents a novel way of specifying a system from the top down. DFA achieves this by providing a language which can be used to formally specify dataflow diagrams. This project was concerned with producing a tool which allowed DFA specifications to be processed by a machine. It is hoped that this will feedback into the research by decreasing the time required to develop specifications.

In order to process the specification the need for a parser was identified. This highlighted several possible solutions to the design and implementation of the tool. Of these a design was chosen which used the ANTLR parser generator to produce the core parser of the tool. This was augmented by a expandable framework which allows easy modification of the parser. The design is such that future tasks such as translation and theorem proving could be easily integrated.

The tool produced: DFATool, is able to check a modified version of the specification for DFA previously presented. The parser checks the input, lexically, syntactically and semantically for deviations. Basic facilities to integrate CaDiZ and Z into DFA are also given. Whilst the operation of the tool is not perfect it offers significant benefits to the DFA author. The design of the tool should also allow for easy changes as the specification of DFA evolves.