797 search results - page 34 / 160 » Eliminating Proofs from Programs |
129
click to vote
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
97
Voted
TCC
2010
Springer
15 years 7 months ago
2010
Springer
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
CSL
2005
Springer
15 years 6 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
97
Voted
CEFP
2009
Springer
14 years 10 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
144
click to vote
MKM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...