10715 search results - page 94 / 2143 » Proofs from Tests |
115
Voted
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
119
click to vote
FMCAD
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
90
Voted
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
116
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...