Sciweavers

2019 search results - page 282 / 404
» Programming with Shared Data Abstractions
Sort
View
TROB
2002
149views more  TROB 2002»
14 years 9 months ago
LOST: localization-space trails for robot teams
Abstract-We describe Localization-Space Trails (LOST), a method that enables a team of robots to navigate between places of interest in an initially unknown environment using a tra...
Richard T. Vaughan, Kasper Støy, Gaurav S. ...
SOSP
2007
ACM
15 years 6 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
15 years 10 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
LFP
1992
140views more  LFP 1992»
14 years 11 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
IJCAI
1993
14 years 11 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo