Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Generic Programming Extension for Clean
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Scientific workflow management and the Kepler system: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
iTasks: executable specifications of interactive work flow systems for the web
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
iData for the world wide web – programming interconnected web forms
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Workflow system modeling in the mobile healthcare b2b using semantic information
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Automatic testing of higher order functions
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Embedding a web-based workflow management system in a functional language
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
iTasks 2: iTasks for end-users
IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
iTasks for a change: type-safe run-time change in dynamically evolving workflows
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
An effective methodology for defining consistent semantics of complex systems
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
GiN: a graphical language and tool for defining itask workflows
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Defining multi-user web applications with itasks
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
| Hi-index | 0.00 |
The iTask system is an easy to use combinator library for specifying dynamic data dependent workflows in a very flexible way. The specified workflows are executed as a multi-user web-application. The implementation of the iTask system is fairly complicated. Hence we cannot use it for reasoning about the semantics of workflows in the iTask system. In this paper we define an executable semantics that specifies how workflows react on events generated by the workers executing them. The semantics is used to explain iTasks and to reason about iTasks. Based on this semantics we define a mathematical notion of equivalence of tasks and show how this equivalence for tasks can be approximated automatically. Advantages of this executable semantics are: it is easy to validate the semantics by interactive simulation; properties of the semantics can be tested by our model-based test system Gšt. Gšt can test a large number of properties within seconds. These tests appeared to be a good indication about the consistency of the specified semantics and equivalence relation for tasks. The automatic testing of properties was very helpful in the development of the semantics. The contribution of this paper is a semantics for iTasks as well as the method used to construct this operational semantics.