Tampere University of Technology

TUTCRIS Research Portal

Checking visual data flow programs with finite process models

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Details

Original languageEnglish
Title of host publication13th Symposium on Programming Languages and Software Tools, SPLST 2013 - Proceedings
PublisherUniversity of Szeged
Pages245-258
Number of pages14
ISBN (Electronic)9789633062289
Publication statusPublished - 2013
Publication typeA4 Article in a conference publication
Event13th Symposium on Programming Languages and Software Tools, SPLST 2013 - Szeged, Hungary
Duration: 26 Aug 201327 Aug 2013

Conference

Conference13th Symposium on Programming Languages and Software Tools, SPLST 2013
CountryHungary
CitySzeged
Period26/08/1327/08/13

Abstract

A visual data flow language (VDFL) allows graphical presentation of a computer program in the form of a directed graph, where data tokens travel through the arcs of the graph, and the vertices present e.g. the input token streams, calculations, comparisons, and conditionals. Amongst their benefits, VDFLs allow parallel computing and they are presumed to improve the quality of programming due to their intuitive readability. Thus, they are also suitable for computing education. However, the token-based computational model allowing parallel processing may make the programs more complicated than what they look. We propose a method for checking properties of VDFL programs using finite state processes (FSPs) using a commonly available labelled transition system analyser (LTSA) tool. The method can also be used to study different VDFL programming constructs for development or re-design of VDFLs. For our method, we have implemented a compiler that compiles a textual representation of a VDFL into FSPs.

ASJC Scopus subject areas