The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a ...
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...