Sciweavers

FSTTCS
2004
Springer
14 years 3 months ago
Refinement and Separation Contexts
A separation context is a client program which does not dereference internals of a module with which it interacts. We use certain "precise" relations to unambiguously des...
Ivana Mijajlovic, Noah Torp-Smith, Peter W. O'Hear...
FSTTCS
2004
Springer
14 years 4 months ago
Actively Learning to Verify Safety for FIFO Automata
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
FSTTCS
2004
Springer
14 years 4 months ago
Toward a Grainless Semantics for Shared-Variable Concurrency
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...
John C. Reynolds
FSTTCS
2004
Springer
14 years 4 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
FSTTCS
2004
Springer
14 years 4 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
FSTTCS
2004
Springer
14 years 4 months ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis
FSTTCS
2004
Springer
14 years 4 months ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
FSTTCS
2004
Springer
14 years 4 months ago
Adaptive Stabilization of Reactive Protocols
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...
Shay Kutten, Boaz Patt-Shamir
FSTTCS
2004
Springer
14 years 4 months ago
Learning Languages from Positive Data and a Finite Number of Queries
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
Sanjay Jain, Efim B. Kinber