It is hard to statically check a system’s conformance to its runtime architectural structure. Previous approaches address the code architecture, change the language radically, mandate implementation frameworks, or use dynamic analyses that cannot check all possible program runs. We propose a static approach that supports existing object-oriented implementations, but relies on program annotation...

This paper presents an alternative view on propo-sitional disjunctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new proposi-tional atoms and controls the \execution" of the...

This paper considers a generic approach to runtime verification of temporal properties over firstorder theories. This allows especially for the verification of multi-threaded, object-oriented systems. It presents a general framework lifting monitor synthesis procedures for propositional temporal logics to a temporal logic over structures within some first-order theory. To evaluate such specific...

The scope of high-performance computing is rapidly expanding from single parallel systems to clusters of heterogeneous sequential and parallel systems. Moreover, as applications become more complex, they grow more irregular, with data-dependent execution behavior, and more dynamic, with time-varying resource demands. Consequently, even small changes in application structure can lead to large ch...

There has been a lot of interest lately from people solving constrained optimization problems for Constraint Programming (CP). Constraint programming cannot be described as a technique by itself but perhaps better as a class of computer languages tailored to the expression and resolution of problems which are non-deterministic in nature, with a fast program development and eecient runtime perfo...

Generic array programming abstracts from structural properties of arrays, such as rank (number of axes/dimensions) and shape (number of element along each axis/dimension). This allows for abstract program specifications and, as such, is desirable from a software engineering perspective. However, generic programming in this sense does have an adverse effect on runtime performance when executed n...

This project provides a way for programmers to insert runtime context-sensitive code into their C programs. The idea is that a program will execute a piece of code only if the program is in a given calling context (i.e., a stack of procedure calls). One way to accomplish this technique is for the program to examine the runtime stack, determine if it matches a given context, then execute the con...

Behavioral conflict is one of the key issues in the practical application of AOP (Aspect-Oriented Programming) technology. Based on the ideas of design by contract and behavioral subtyping, we propose an approach that detects the behavioral conflict automatically at runtime. Use Java annotation to describe the contracts of the base program and aspect code, then extract these contracts through t...

Today’s information systems record real-time information about business processes. This enables the monitoring of business constraints at runtime. In this paper, we present a novel runtime verification framework based on linear temporal logic and colored automata. The framework continuously verifies compliance with respect to a predefined constraint model. Our approach is able to provide meanin...

Probabilistic model-checking aims to prove whether a Markov decision process (MDP) satisfies temporal logic specification. The underlying methods rely on an often unrealistic assumption that the MDP is precisely known. Consequently, parametric MDPs (pMDPs) extend with transition probabilities are functions over unspecified parameters. parameter synthesis problem compute instantiation of these p...