1716 search results - page 182 / 344 » Proving Conditional Termination |
129
click to vote
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
143
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
104
Voted
CASES
2004
ACM
15 years 6 months ago
2004
ACM
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...
128
Voted
AGTIVE
2003
Springer
15 years 6 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
115
click to vote
PKC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...