171 search results - page 13 / 35 » CoSP: a general framework for computational soundness proofs |
ASIAN
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
UIALL
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Recent trends in software development directed toward intelligence, distribution, and mobility need to be followed by an increased sophistication in user interface design...
108
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
CADE
2004
Springer
15 years 12 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
113
click to vote
TPHOL
2000
IEEE
15 years 4 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...