Reliable Evidence: Auditability by Typing

Reliable Evidence: Auditability by Typing,10.1007/978-3-642-04444-1_11,Nataliya Guts,Cédric Fournet,Francesco Zappa Nardelli

Reliable Evidence: Auditability by Typing   (Citations: 9)
BibTex | RIS | RefWorks Download
Many protocols rely on audit trails to allow an impartial judge to ver- ify a posteriori some property of a protocol run. However, in current practice the choice of what data to log is left to the programmer's intuition, and there is no guarantee that it constitutes enough evidence. We give a precise definition of auditability and we show how typechecking can be used to statically verify that a protocol always logs enough evidence. We apply our approach to several examples, including a full-scale auction-like protocol programmed in ML.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: