Long gone are the days when program veri? cation was a task carried out merely by hand
with paper and pen. For one, we are increasingly interested in proving actual program …

We introduce a reasoning infrastructure for proving statements about resource consumption
in a fragment of the Java Virtual Machine Language (JVML). The infrastructure is based on a …

We present interpretations of type systems for secure information flow in Hoare logic,
complementing previous encodings in binary (eg relational) program logics. Treating base …

Object invariants define the consistency of objects. They have subtle semantics because of
call-backs, multi-object invariants and subclassing. Several visible-state verification …

Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to
regain structure and modularity in a domain where structure is essentially absent. The field …

Abstract Dynamic Logic with Traces and Coinduction is a new program logic that has an
explicit syntactic representation of both programs and their traces. This allows to prove …

We present how common Java Card security properties can be formalised in Dynamic Logic
and verified, mostly automatically, with the KeY system. The properties we consider, are a …

Through their global, uniform provision of services and their distributed nature, global
computers have the potential to profoundly enhance our daily life. However, they will not …

The JAVA CARD transaction mechanism allows to protect sensitive operations on smart
cards against problems due to card tears or power losses. Statements within a transaction …

Programs contain bugs. Finding program bugs is important, especially in situations where
safety and security of a program is required. This thesis proposes a number of analysis …