Sciweavers

2019 search results - page 53 / 404
» Programming with Shared Data Abstractions
Sort
View
APLAS
2004
ACM
14 years 1 months ago
Automatic Generation of Editors for Higher-Order Data Structures
With generic functional programming techniques, we have eased GUI programming by constructing a programming toolkit with which one can create GUIs in an abstract and compositional ...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
An Operational Semantics for Shared Messaging Communication
Shared Messaging Communication (SMC) has been introduced in [9] as a model of communication which reduces communication costs (both in terms of communication latency and memory us...
Astrid Kiehn
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 1 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
FLOPS
2006
Springer
13 years 11 months ago
iData for the World Wide Web - Programming Interconnected Web Forms
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
Rinus Plasmeijer, Peter Achten
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
13 years 11 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira