1894 search results - page 173 / 379 » A TLA Proof System |
131
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
147
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
147
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
117
click to vote
SSS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a rigorous treatment to structured overlay maintenance in decentralized peerto-peer (P2P) systems subject to various system and network failures. we prese...
134
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...