Sciweavers

7106 search results - page 1257 / 1422
» Restricted Complexity, General Complexity
Sort
View
155
Voted
PLDI
2009
ACM
15 years 11 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
151
Voted
SAC
2009
ACM
15 years 11 months ago
Using geo-spatial session tagging for smart multicast session discovery
IP multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP u...
Piyush Harsh, Richard Newman
SAC
2009
ACM
15 years 11 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
SENSYS
2009
ACM
15 years 11 months ago
The case for a network protocol isolation layer
Network protocols are typically designed and tested individually. In practice, however, applications use multiple protocols concurrently. This discrepancy can lead to failures fro...
Jung Il Choi, Maria A. Kazandjieva, Mayank Jain, P...
SPAA
2009
ACM
15 years 11 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
« Prev « First page 1257 / 1422 Last » Next »