Sciweavers

1000 search results - page 191 / 200
» Nominal rewriting systems
Sort
View
ASPLOS
1996
ACM
14 years 23 days ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
GIS
2006
ACM
14 years 9 months ago
Optimization of multiple continuous queries over streaming satellite data
Remotely sensed data, in particular satellite imagery, play many important roles in environmental applications and models. In particular applications that study (rapid) changes in...
Quinn Hart, Michael Gertz
LFCS
2007
Springer
14 years 2 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
PODC
2004
ACM
14 years 2 months ago
On the design of distributed protocols from differential equations
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
Indranil Gupta
POPL
1997
ACM
14 years 24 days ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer