The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...