Sciweavers

204 search results - page 26 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 28 days ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
FLOPS
2008
Springer
13 years 9 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
MKM
2007
Springer
14 years 1 months ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel
FMCAD
2006
Springer
13 years 11 months ago
An Integration of HOL and ACL2
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...
Michael J. C. Gordon, James Reynolds, Warren A. Hu...
AIPS
1996
13 years 9 months ago
Deduction-Based Refinement Planning
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
Werner Stephan, Susanne Biundo