7988 search results - page 1379 / 1598 » A Useful Undecidable Theory |
156
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
132
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
142
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
155
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
143
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...