Sciweavers

4099 search results - page 93 / 820
» A Framework for Interactive Proof
Sort
View
JOC
2011
104views more  JOC 2011»
14 years 22 days ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
TPHOL
2000
IEEE
15 years 2 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
CATS
2006
14 years 11 months ago
Mechanically Verifying Correctness of CPS Compilation
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
Ye Henry Tian
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
ACMDIS
2006
ACM
15 years 3 months ago
An empirical framework for designing social products
Designers generally agree that understanding the context of use is important in designing products. However, technologically advanced products such as personal robots engender com...
Bilge Mutlu