In today’s fast-paced world, while the number of channels of television programming available is increasing rapidly, the time available to watch them remains the same or is decr...
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite programming. A corresponding Symmetric Reduction Lemma is s...
Synchronous languages allow a high level, concurrent, and deterministic description the behavior of reactive systems. Thus, they can be used advantageously for the programming of ...
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...