5158 search results - page 903 / 1032 » Generalization of the Dempster-Shafer Theory |
191
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
206
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
217
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
212
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
182
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...