Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at runtime whether an assertion, such as a precondition or class invariant, holds. In this work, we show how separation logic can be used to verify that these executable specifications will always hold at runtime. Both ...

The purpose of this paper is to provide an overview of the current trends and practices in small-satellite software verification and validation. This document is not intended to promote a specific software assurance method. Rather, it seeks to present an unbiased survey of software assurance methods used to verify and validate small satellite software and to make mention of the benefits and val...

We present two new statistical algorithms for probabilistic verification of long-run properties. The algorithms use statistical sampling of execution trajectories to verify long-run properties of stochastic discrete-event systems. The algorithms differ in the techniques used to ensure that sample trajectories remain finite, but have similar time complexity. Our work is a significant improvement...

This paper presents an approach for incrementally adjusting the timing behavior of legacy real-time software according to explicit timing specifications expressed in the Timing Definition Language (TDL). The primary goal of such a migration is to achieve predictable timing behavior, which enables application of formal verification methods to the legacy system. Our approach entails a minimal ins...

Many parallel programs are written in a single-program, multipledata (SPMD) style, in which synchronization is provided using collective operations that all threads execute simultaneously. If these operations are not properly aligned on all threads, deadlock can occur, and many compiler analyses and optimizations that depend on proper alignment fail. In this paper, we discuss the flaws in the T...

Zusammenfassung Die kontinuierliche Verringerung der Strukturgrößen führt zu einer erhöhten Fehleranfälligkeit von digitalen Schaltungen. Sowohl Produktionsfehler als auch transiente Fehler können die Funktionsfähigkeit beeinflussen. Deshalb wird die Untersuchung der Fehlertoleranz im Entwicklungsprozess zunehmend wichtig. In dieser Arbeit wird ein formales Verfahren zur Berechnung der Fehlerto...

Coordination languages allow us to separate interaction behavior from the sequential functional aspects of the components of concurrent systems. This helps us to reduce the complexities of such systems making them easier to design and to understand. However, there is still a gap between formal approaches to coordination and their implementation in programming languages. For example, CSP is ofte...

Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often overlap each other. This makes a set of simple patterns difficult to interpret and sequences difficult to mine. Furthermore, group behaviour is complex. Objects in a group may behave similarly for a period of time (an...

In bounded program verification a finite set of execution traces is exhaustively checked in order to find violations to a given specification (i.e. errors). SAT-based bounded verifiers rely on SAT-Solvers as their back-end decision procedure, accounting for most of the execution time due to their exponential time complexity. In this paper we sketch a novel approach to improve SAT-based bounded ...

Service-Oriented Computing (SOC) has been used in business environments in order to integrate heterogeneous systems. The dynamic nature of these environments causes changes in the application requirements. As a result, service composition must be flexible, dynamic and adaptive, which motivate the need to ensure the service composition behavior at runtime. The development of adaptive service com...