Author of the publication

Formal security proofs with minimal fuss: Implicit computational complexity at work.

, and . Inf. Comput., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Unifying Approach to Data-Independence., and . CONCUR, volume 1877 of Lecture Notes in Computer Science, page 581-595. Springer, (2000)Logical Relations for Dynamic Name Creation., and . CSL, volume 2803 of Lecture Notes in Computer Science, page 575-588. Springer, (2003)Summer School on Coq (NII Shonan Meeting 2014-9)., , and . NII Shonan Meet. Rep., (2014)Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base., , , , and . ECEASST, (2018)(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic., and . CoRR, (2019)Certifying assembly with formal security proofs: The case of BBS., , and . Sci. Comput. Program., 77 (10-11): 1058-1074 (2012)On a Semantic Definition of Data Independence ., and . TLCA, volume 2701 of Lecture Notes in Computer Science, Seite 226-240. Springer, (2003)Reasoning About Transfinite Sequences., und . ATVA, Volume 3707 von Lecture Notes in Computer Science, Seite 248-262. Springer, (2005)A Hierarchy of Monadic Effects for Program Verification Using Equational Reasoning., , und . MPC, Volume 11825 von Lecture Notes in Computer Science, Seite 226-254. Springer, (2019)A trustful monad for axiomatic reasoning with probability and nondeterminism., , , und . J. Funct. Program., (2021)