Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
Abstract. The paper presents a combination of interactive and automatic tools in the area of software verification. We have integrated a newly developed software model checker int...
Matthias Daum, Stefan Maus, Norbert Schirmer, M. N...
Interacting State Machines (ISMs) are used to model reactive systems and to express and verify their properties. They can be seen both as automata exchanging messages simultaneousl...