107 search results - page 7 / 22 » Tactics for Hierarchical Proof |
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...
PODC
1987
ACM
13 years 11 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
ENTCS
2010
13 years 7 months ago
2010
Components provide an easy to use programming paradigm allowing for better re-usability of application code. In the context of distributed programming, autonomous hierarchical com...