Fernandez-Fernandez, C.A. and Simons, A.J.H. (2014) An Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method. Journal of Applied Research and Technology, 12 (5). pp. 908-918. ISSN 1665-6423
Abstract
This paper describes an implementation of the Task Algebra, a formal model of hierarchical tasks and workflows, in the Haskell programming language. Previously we presented the Task Algebra as a formal, unambiguous notation capturing the kinds of activity and workflow typically seen in business analysis diagrams, similar to UML use case and activity diagrams. Here, we show how the abstract syntax for the Task Algebra may be parsed and then semantically analysed, by a suite of Haskell functions, to compute the execution traces of a system. The approach is illustrated with a case study of a journal management system. The results show how it is possible to automate the semantic analysis of requirements diagrams, as a precursor to developing a logical design.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of The Implementation of the Task Algebra, a Formal Specification for the Task Model in the Discovery Method. White Rose Research Online. |
Keywords: | software modeling; formal specification; lightweight formal methods |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 12 Apr 2016 13:57 |
Last Modified: | 12 Apr 2016 13:57 |
Status: | Published |
Publisher: | Universidad Nacional Autónoma de México (UNAM) |
Refereed: | Yes |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:98320 |