Paper: Towards Deductive Synthesis of Dataflow Networks (at LICS 1986)

Authors: Bengt Jonsson Zohar Manna Richard J. Waldinger

Abstract

We present a method for deductive synthesis of deterministic dataflow networks. A network is specified by a relation between sequences of input values and sequences of output values. From the specification, an applicative program in the form of recursive equations is derived as a side-effect of proving the specification as a theorem. The recursive equations can subsequently be transformed into a dataflow network. We also indicate how the recursive equations can be transformed into a dataflow language, Lucid. The theorem-proving part of the method uses the deductive-tableau techniques of [MWa].

BibTeX

  @InProceedings{JonssonMannaWalding-TowardsDeductiveSyn,
    author = 	 {Bengt Jonsson and Zohar Manna and Richard J. Waldinger},
    title = 	 {Towards Deductive Synthesis of Dataflow Networks},
    booktitle =  {Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)},
    year =	 {1986},
    month =	 {June}, 
    pages =      {26--37},
    location =   {Cambridge, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }