David von Oheimb

Learn More
AVISPA is a push-button tool for the automated validation of Internet security-sensitive protocols and applications. It provides a modular and expressive formal language for specifying protocols and their security properties, and integrates different back-ends that implement a variety of state-of-the-art automatic analysis techniques. To the best of our(More)
HOLCF is the de nitional extension of Church s Higher Order Logic with Scott s Logic for Computable Functions that has been implemented in the theorem prover Isabelle This results in a exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive(More)
In this article we present Bali, the formalization of a large (hitherto sequential) sublanguage of Java. We give its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on these deenitions, we can express soundness of the type system, an important design goal claimed to be reached by the designers of(More)
We define NanoJava, a kernel of Java tailored to the investigation of Hoare logics. We then introduce a Hoare logic for this language featuring an elegant approach for expressing auxiliary variables: by universal quantification on the outer logical level. Furthermore, we give simple means of handling side-effecting expressions and dynamic binding within(More)
This article presents a Hoare-style calculus for a substantial subset of Java Card, which we call Java . In particular, the language includes side-effecting expressions, mutual recursion, dynamic method binding, full exception handling, and static class initialization. The Hoare logic of partial correctness is proved not only sound (w.r.t. our operational(More)
We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarifying the impact of transitive vs. intransitive policies on unwinding. Inspired partially by Mantel’s observations on unwinding for event systems, we remove the restriction on the unwinding(More)
This paper introduces ASLan++, the AVANTSSAR Specification Language. ASLan++ has been designed for formally specifying dynamically composed security-sensitive web services and serviceoriented architectures, their associated security policies, as well as their security properties, at both communication and application level. We introduce the main concepts of(More)
Java<inf>light</inf> is a large sequential sublanguage of Java. We formalize its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on this formalization, we can express and prove type soundness. All definitions and proofs have been done formally in the theorem prover Isabelle/HOL. Thus this paper(More)
We present a the rst sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call by value parameters as well as global and local variables For such a language we formalize an operational and an axiomatic semantics of partial correctness and prove their equivalence Global and local(More)