338 search results - page 34 / 68 » Locally checkable proofs |
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
CCS
2005
ACM
14 years 2 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
STOC
1997
ACM
14 years 1 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
FM
2009
Springer
14 years 3 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...