Sciweavers

12774 search results - page 42 / 2555
» A Framework for Proof Systems
Sort
View
158
Voted
CADE
2005
Springer
16 years 4 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
128
Voted
MKM
2007
Springer
15 years 10 months ago
Cooperative Repositories for Formal Proofs
We present a new framework for the online development of formalized mathematics. This framework allows wiki-style collaboration while providing users with a rendered and browsable ...
Pierre Corbineau, Cezary Kaliszyk
129
Voted
EUROCRYPT
2007
Springer
15 years 10 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
132
Voted
ITP
2010
109views Mathematics» more  ITP 2010»
15 years 5 months ago
A Tactic Language for Declarative Proofs
Influenced by the success of the MIZAR system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier...
Serge Autexier, Dominik Dietrich
155
Voted
SAT
2009
Springer
153views Hardware» more  SAT 2009»
15 years 10 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller