Sciweavers

1888 search results - page 20 / 378
» Proof theory and computational analysis
Sort
View
CADE
2005
Springer
14 years 7 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
JSC
2006
122views more  JSC 2006»
13 years 7 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
CRYPTO
2007
Springer
105views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
Emmanuel Bresson, Yassine Lakhnech, Laurent Mazar&...
ICFP
2010
ACM
13 years 8 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
POPL
2012
ACM
12 years 2 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...