Sciweavers

12774 search results - page 71 / 2555
» A Framework for Proof Systems
Sort
View
TPHOL
2003
IEEE
14 years 2 months ago
MetaPRL - A Modular Logical Environment
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
Jason Hickey, Aleksey Nogin, Robert L. Constable, ...
WOLLIC
2009
Springer
14 years 3 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
CRYPTO
2012
Springer
215views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
We develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full sec...
Allison B. Lewko, Brent Waters
ROOM
2000
13 years 10 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark