Sciweavers

779 search results - page 89 / 156
» A Simple Program Transformation for Parallelism
Sort
View
SIGSOFT
2003
ACM
14 years 1 months ago
Refinements and multi-dimensional separation of concerns
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
Don S. Batory, Jia Liu, Jacob Neal Sarvela
ICCS
2001
Springer
14 years 8 days ago
Application Monitoring in the Grid with GRM and PROVE
GRM and PROVE were originally designed and implemented as part of the P-GRADE graphical parallel program development environment running on clusters. In the framework of the bigges...
Zoltán Balaton, Péter Kacsuk, Norber...
ASPLOS
1996
ACM
13 years 12 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
PLDI
2006
ACM
14 years 1 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
14 years 1 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy