1226 search results - page 71 / 246 » Proofs, Programs and Abstract Complexity |
111
click to vote
JLP
2011
14 years 6 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
116
click to vote
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
242
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
132
click to vote
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
125
Voted
TCC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...