Sciweavers

328 search results - page 46 / 66
» Proving Termination of Communicating Programs
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
KBSE
2003
IEEE
14 years 29 days ago
A Programmable Client-Server Model: Robust Extensibility via DSLs
The client-server model has been successfully used to support a wide variety of families of services in the context of distributed systems. However, its server-centric nature make...
Charles Consel, Laurent Réveillère
INFOCOM
2005
IEEE
14 years 1 months ago
Asymptotically optimal transmission policies for low-power wireless sensor networks
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...
Ioannis Ch. Paschalidis, Wei Lai, David Starobinsk...
SPAA
2009
ACM
14 years 2 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
DAGSTUHL
1996
13 years 9 months ago
What Not to Do When Writing an Interpreter for Specialisation
A partial evaluator, given a program and a known "static" part of its input data, outputs a specialised or residual program in which computations depending only on the st...
Neil D. Jones