We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous techniques and toolsâ€¦ (More)

To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can be translated intoâ€¦ (More)

In many situations, we are interested in controllers that implement a good trade-off between conflicting objectives, e.g., the speed of a car versus its fuel consumption, or the transmission rate ofâ€¦ (More)

We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we aim for aâ€¦ (More)

We show how to automatically construct a system that satisfies a given logical specification and has an optimal average behavior with respect to a specification with fractional costs. Whenâ€¦ (More)

The next generation airborne collision avoidance system, ACASÂ X, departs from the traditional deterministic model on which the current system, TCAS, is based. To increase robustness, ACASÂ X relies onâ€¦ (More)

We present a formalism, algorithms and tools to synthesise reactive systems that behave efficiently, i.e., which achieve an optimal trade-off between a given cost and reward model. Synthesis aims toâ€¦ (More)

We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we require that aâ€¦ (More)