dc.contributor.author |
Fourtounis, G |
en |
dc.contributor.author |
Olveczky, PC |
en |
dc.contributor.author |
Papaspyrou, N |
en |
dc.date.accessioned |
2014-03-01T02:53:17Z |
|
dc.date.available |
2014-03-01T02:53:17Z |
|
dc.date.issued |
2011 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/36213 |
|
dc.subject |
dataflow |
en |
dc.subject |
formal analysis |
en |
dc.subject |
intensional transformation |
en |
dc.subject |
lazy functional programming languages |
en |
dc.subject |
Maude |
en |
dc.subject |
parallelism |
en |
dc.subject |
rewriting logic |
en |
dc.subject.other |
Dataflow |
en |
dc.subject.other |
Formal analysis |
en |
dc.subject.other |
intensional transformation |
en |
dc.subject.other |
lazy functional programming languages |
en |
dc.subject.other |
Maude |
en |
dc.subject.other |
parallelism |
en |
dc.subject.other |
Rewriting logic |
en |
dc.subject.other |
Computer simulation |
en |
dc.subject.other |
Functional programming |
en |
dc.subject.other |
Message passing |
en |
dc.subject.other |
Parallel programming |
en |
dc.subject.other |
Semantics |
en |
dc.subject.other |
Telecommunication networks |
en |
dc.subject.other |
High level languages |
en |
dc.title |
Formally specifying and analyzing a parallel virtual machine for lazy functional languages using Maude |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1145/2034751.2034758 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1145/2034751.2034758 |
en |
heal.publicationDate |
2011 |
en |
heal.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. © 2011 ACM. |
en |
heal.journalName |
HLPP'11 - Proceedings of the 5th International Workshop on High-Level Parallel Programming and Applications |
en |
dc.identifier.doi |
10.1145/2034751.2034758 |
en |
dc.identifier.spage |
19 |
en |
dc.identifier.epage |
26 |
en |