Controlled dataflow visual programming languages

Authors:
Philip T. Cox;Simon Gauvin
Affiliations:
Dalhousie University Halifax, Canada;Dalhousie University Halifax, Canada
Venue:
Proceedings of the 2011 Visual Information Communication - International Symposium
Year:
2011

Citing 14
Cited 0

A Formal Definition of Data Flow Graph Models

IEEE Transactions on Computers
Dataflow Computing Models, Languages, and Machines for Intelligence Computations

IEEE Transactions on Software Engineering - Special Issue on Artificial Intelligence in Software Applications
Data flow computing: theory and practice

Data flow computing: theory and practice
Visual programming with HP VEE (2nd ed.)

Visual programming with HP VEE (2nd ed.)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
LabVIEW Graphical Programming

LabVIEW Graphical Programming
First version of a data flow procedure language

Programming Symposium, Proceedings Colloque sur la Programmation
VPLs and Novice Program Comprehension: How do Different Languages Compare?

VL '99 Proceedings of the IEEE Symposium on Visual Languages
A survey of semantic description frameworks for programming languages

ACM SIGPLAN Notices
Advances in dataflow programming languages

ACM Computing Surveys (CSUR)
Webrb: evaluating a visual domain-specific language for building relational web-applications

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Data Flow Languages

Computer
A Practical Data Flow Computer

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an important subclass of visual dataflow languages that includes many developed for industrial use, programs consist of acyclic diagrams embedded in control structures of some form. We present here a formalisation of this class of languages, which we call Controlled Dataflow. This work was motivated by a previous study of an exceptions mechanism for visual languages of this type, since to define how the exceptions mechanism could be incorporated into any CDL, we needed a formalism to precisely capture the syntax and semantics of this class, including a protocol for including language-specific control structures. To illustrate the formalism, we provide an example that shows how it captures conditional execution and iteration. We also report on use of this formalism as the basis for an implementation of new CDL language tools.