3573 search results - page 317 / 715 » Reasoning about Codata |
248
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
238
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
244
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
244
click to vote
POPL
2002
ACM
16 years 5 months ago
2002
ACM
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
236
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...