Sciweavers

1894 search results - page 345 / 379
» A TLA Proof System
Sort
View
ICS
2010
Tsinghua U.
15 years 1 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
ICDCS
2000
IEEE
15 years 1 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 9 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
TMI
2010
204views more  TMI 2010»
14 years 8 months ago
Camera Augmented Mobile C-Arm (CAMC): Calibration, Accuracy Study, and Clinical Applications
—Mobile C-arm is an essential tool in everyday trauma and orthopedics surgery. Minimally invasive solutions, based on X-ray imaging and coregistered external navigation created a...
Nassir Navab, Sandro Michael Heining, Jörg Tr...
ESOP
2009
Springer
15 years 4 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell