Runtime monitoring is an established technique to enforce a wide range of programsafety and security properties. We present a formalization of monitoring and monitorinlining, for the Java Virtual Machine. Monitors are security automata given in aspecial-purpose monitor specification language, ConSpec. The automata operateon finite or infinite strings of calls to a fixed API, all...

A method is presented for the stepwise refinement of an abstract architecture into a relatively correct lower level architecture that is intended to implement it. A refinement step involves the application of a predefined refinement pattern that provides a routine solution to a standard architectural design problem. A pattern contains an abstract architecture schema and a more detailed schema i...

This paper analyses the case when the political struggle not is channeled through policy choices, but through what information to adopt. The paper presents a simple model to analyze collective decisions of adopting new information when different parties' payoffs are contingent upon the new information. In equilibrium we demonstrate that the adopted information is biased towards “political corre...

Primitives are basic means provided by a microkernel to implementors of operating system services. Intensively used within every OS and commonly implemented in a mixture of high-level and assembly programming languages, primitives are meaningful and challenging candidates for formal verification. We report on the accomplished correctness proof of academic microkernel primitives. We describe how...

For critical software development, containers such as lists, vectors, sets or maps are an attractive alternative to ad-hoc data structures based on pointers. As standards like DO-178C put formal verification and testing on an equal footing, it is important to give users the ability to apply both to the verification of code using containers. In this paper, we present a definition of containers w...

In this article we present a new approach to the problem of calculating compilers. In particular, we develop a simple but general technique that allows us to derive correct compilers from highlevel semantics by systematic calculation, with all details of the implementation of the compilers falling naturally out of the calculation process. Our approach is based upon the use of standard equationa...

We develop a formal basis of correct schema transformations. Schemas are formalized as abstract data types, and correct schema transformations are formalized as information-preserving signature interpretations. Our formalism captures transformations of all schema components, making it possible to transform uniformly constraints and queries along with structures. In addition, our formalism captu...