You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Development and Verification of Parallel Algorithms in the Data Field Model

Fulltext:


Authors:

Björn Lisper, Jonas Holmerin

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

Proc. 2nd Int. Workshop on Constructive Methods for Parallel Programming

Publisher:

Fakultät für Mathematik und Informatik, Universität Passau

Abstract

Data fields are partial functions provided with explicit domain information. They provide a very general, formal model for collections of data. Algorithms computing data collections can be described in this formalism at various levels of abstraction: in particular, explicit data distributions are easy to model. Parallel versions of algorithms can then be formally verified against algorithm specifications in the model. Functions computing data fields can be directly programmed in the language Data Field Haskell. In this paper we give a brief introduction to the data field model. We then describe Data Field Haskell and make a small case study of how an algorithm and a parallel version of it both can be specified in the language. We then verify the correctness of the parallel version in the data field model.

Bibtex

@inproceedings{Lisper198,
author = {Bj{\"o}rn Lisper and Jonas Holmerin},
title = {Development and Verification of Parallel Algorithms in the Data Field Model},
editor = {Sergei Gorlatch and Christian Lengauer},
pages = {115--130},
month = {July},
year = {2000},
booktitle = {Proc. 2nd Int. Workshop on Constructive Methods for Parallel Programming},
publisher = {Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Passau},
url = {http://www.es.mdu.se/publications/198-}
}