288 search results - page 26 / 58 » Interactive Termination Proofs Using Termination Cores |
196
click to vote
LCN
2008
IEEE
16 years 16 days ago
2008
IEEE
—Carrier Sense Multiple Access (CSMA) protocols in Multi-hop Wireless Networks (MHWN) are known to suffer from different forms of the hidden and exposed terminal problems, leadin...
119
click to vote
BIRTHDAY
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
193
click to vote
TABLEAUX
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
171
click to vote
PKC
2009
Springer
15 years 10 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...
206
click to vote
HASKELL
2009
ACM
16 years 20 days 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...