This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and veriļ¬er. The ļ...
The aggregation of individualsā preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simpliļ¬ca...
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a programās heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...