Sciweavers

3552 search results - page 55 / 711
» Proof theory in the abstract
Sort
View
ENTCS
2007
96views more  ENTCS 2007»
15 years 1 months ago
A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract)
ed Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt Xavier Leroy INRIA Rocquencourt We propose a benchmark to compare theorem-proving sys...
Andrew W. Appel, Xavier Leroy
101
Voted
EUROCRYPT
2008
Springer
15 years 3 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
ICFP
2008
ACM
16 years 1 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
JLP
2010
59views more  JLP 2010»
14 years 8 months ago
The proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
Florent Kirchner, César Muñoz
ICFP
2004
ACM
16 years 1 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao