4099 search results - page 165 / 820 » A Framework for Interactive Proof |
150
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
158
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
117
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
147
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
120
click to vote
DATE
2009
IEEE
15 years 9 months ago
2009
IEEE
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...