Recently, we developed an approach for automated termination proofs of Java Bytecode
(JBC), which is based on constructing and analyzing termination graphs. These graphs …

Program debloating aims to enhance the performance and reduce the attack surface of
bloated applications. Several techniques have been recently proposed to specialize …

Scalability is a major challenge in symbolic execution. The large number of paths that need
to be explored and the large size of the constraints that must be carried often compromise …

Computer programs commonly repeat work. Short programs go through the same
initialisation sequence each time they are run, and long-running servers may be given a …

We present a prototypical implementation of a partial evaluator for Java programs based on
the verification system KeY. We argue that using a program verifier as technological basis …

Symbolic execution is a technique enabling the automatic generation of test inputs that
exercise a set of execution paths within a code unit to be tested. If the paths cover a sufficient …

We present a program transformation framework based on symbolic execution and
deduction. Its virtues are:(i) behavior preservation of the transformed program is guaranteed …

Trust in software is typically achieved via stabilisation efforts over long periods of use.
Adaptation to changing circumstances, however, often requires substantial change of the …

Programmable network data planes have extended the capabilities of packet processing in
network devices by allowing custom processing pipelines and agnostic packet processing …

Constraint-based testing is an automatic test case generation approach where the tested
application is transformed into constraints whose solutions are adequate test data. In …