d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...