Formally specifying and analyzing a parallel virtual machine for lazy functional languages using Maude

Authors:
Georgios Fourtounis;Peter Csaba Ölveczky;Nikolaos Papaspyrou
Affiliations:
National Technical University of Athens, Athens, Greece;University of Oslo, Oslo, Norway;National Technical University of Athens, Athens, Greece
Venue:
Proceedings of the fifth international workshop on High-level parallel programming and applications
Year:
2011

Citing 26
Cited 0

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Executing a Program on the MIT Tagged-Token Dataflow Architecture

IEEE Transactions on Computers
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
pHluid: the design of a parallel functional language implementation on workstations

Proceedings of the first ACM SIGPLAN international conference on Functional programming
An operational semantics for parallel lazy evaluation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Research Directions in Parallel Functional Programming

Research Directions in Parallel Functional Programming
Functional Programming and Parallel Graph Rewriting

Functional Programming and Parallel Graph Rewriting
Parallel Functional Reactive Programming

PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A distributed operational semantics for a parallel functional language

Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00)
Multidimensional Lucid: Design, Semantics and Implementation

DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
Some Chemical Abstract Machines

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Parallel and Distributed Haskells

Journal of Functional Programming
Higher-order functional languages and intensional logic

Journal of Functional Programming
Algorithm + strategy = parallelism

Journal of Functional Programming
First-order functional languages and intensional logic

Journal of Functional Programming
Concepts, Techniques, and Models of Computer Programming

Concepts, Techniques, and Models of Computer Programming
Parallel functional programming in Eden

Journal of Functional Programming
A General Architecture for Demand Migration in a Demand-Driven Execution Engine in a Heterogeneous and Distributed Environment

CNSR '05 Proceedings of the 3rd Annual Communication Networks and Services Research Conference
Feedback directed implicit parallelism

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Programming Erlang: Software for a Concurrent World

Programming Erlang: Software for a Concurrent World
Sequential Demand-Driven Evaluation of Eager TransLucid

COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
A Multithreaded Implementation for TransLucid

COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
Runtime support for multicore Haskell

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Advances in the Design and Implementation of a Multi-tier Architecture in the GIPSY Environment with Java

SERA '10 Proceedings of the 2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pure lazy functional languages are a promising programming paradigm for harvesting massive parallelism, as their abstraction features and lack of side effects support the development of modular programs without unneeded serialization. We give a new formal message passing semantics for implicitly parallel execution of a lazy functional programming language, based on the intensional transformation that converts programs in functional style to a form that can be executed in a dataflow paradigm. We use rewriting logic to define the semantics of our parallel virtual machine and we use the Maude tool to formally analyze our model. We also briefly discuss a prototype parallel implementation of our model in Erlang.