Sciweavers

1362 search results - page 255 / 273
» Means, Correlations and Bounds
Sort
View
POPL
2007
ACM
15 years 10 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
POPL
2005
ACM
15 years 10 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
ICFP
2005
ACM
15 years 9 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
PPOPP
2010
ACM
15 years 7 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
MOBICOM
2009
ACM
15 years 4 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin