632 search results - page 76 / 127 » Combining programming with theorem proving |
100
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
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 ļ...
CP
2005
Springer
15 years 7 months ago
2005
Springer
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...
108
click to vote
ICFP
2001
ACM
16 years 1 months ago
2001
ACM
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...
103
click to vote
SAS
2007
Springer
15 years 8 months ago
2007
Springer
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...
101
click to vote
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
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...