Sciweavers

769 search results - page 76 / 154
» Analysis of recursively parallel programs
Sort
View
PPOPP
2005
ACM
14 years 2 months ago
Automated type-based analysis of data races and atomicity
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
Amit Sasturkar, Rahul Agarwal, Liqiang Wang, Scott...
FPCA
1995
14 years 10 days ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
14 years 9 months ago
A comparison of approaches to large-scale data analysis
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
Andrew Pavlo, Erik Paulson, Alexander Rasin, Danie...
ICDCS
2007
IEEE
14 years 3 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
IPPS
2005
IEEE
14 years 2 months ago
A Compiler and Runtime Infrastructure for Automatic Program Distribution
This paper presents the design and the implementation of a compiler and runtime infrastructure for automatic program distribution. We are building a research infrastructure that e...
Roxana Diaconescu, Lei Wang, Zachary Mouri, Matt C...