Sciweavers

124 search results - page 4 / 25
» Full Abstraction for a Shared Variable Parallel Language
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 1 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
IPPS
2009
IEEE
15 years 4 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
OOPSLA
1999
Springer
15 years 1 months ago
Object Views: Language Support for Intelligent Object Caching in Parallel and Distributed Computations
Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object spa...
Ilya Lipkind, Igor Pechtchanski, Vijay Karamcheti
IPPS
1999
IEEE
15 years 1 months ago
Examples of Program Composition Illustrating the Use of Universal Properties
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...
Michel Charpentier, K. Mani Chandy
PODC
2009
ACM
15 years 6 months ago
Memory models: a case for rethinking parallel languages and hardware
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
Sarita V. Adve