21324 search results - page 3957 / 4265 » Making the case for computing |
235
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
241
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
230
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
240
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
147
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...