Peter Schneider-kamp, Informatik Und, Prof Dr, Jürgen Giesl, Prof Michael Codish
The most fundamental decision problem in computer science is the halting problem, i.e., given a description of a program and an input, decide whether the program terminates after finitely many steps...
In the classical framework of graph algorithms, program logics, and corresponding model checking games, one considers changes of system states and movements of agents within a system, but the...
Abstract State Machines: Verification Problems and Computational Power (2008)
Informatik Und, Antje Nowack, Aus Düsseldorf, ...
Abstract State Machines (ASMs) bilden die Basis einer Methode zur Software-
Informatik Und, Dr. –ing Hermann Ney
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. To my family Acknowledgements Firstly, I would like to thank my supervisor, Prof. Dr.-Ing. Hermann Ney, head...
Games on Pushdown Graphs and Extensions (2008)
Informatik Und, Berichter Prof, Dr. Wolfgang Thomas, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. Two player games are a standard model of reactive computation, where e.g. one player is the controller and the...
Informatik Und, Dr. Pierre Alliez, Prof Dr, Leif Kobbelt, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar.
INFINITE GRAPHS GENERATED BY TREE REWRITING (2008)
Informatik Und, Christof Löding, ...
online verfügbar. Finite graphs and algorithms on finite graphs are an important tool for the verification of finite-state systems. To transfer the methods for finite systems, at least partially, to...
Informatik Und, Colin Hirsch, Aus Wien Österreich, ...
Tag der mündlichen Prüfung: 17.7.2002 Diese Dissertation ist auf den Internetseiten der Hochschule online verfügbar. Thank You
Pure and Applied Fixed-Point Logics (2008)
Informatik Und, Stephan Kreutzer, Aus Aachen Deutschland, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar.
Informatik Und, Aachen Erlangung, Martin Leucker, ...
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automatatheoretic approach has proven to...
Virtual Humanoids and Presence in Virtual Environments (2007)
Informatik Und, Jakob T. Valvoda, Aus Prag, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. The broad range of methods for virtual humanoids and their evaluation as avatars in virtual environments is...
Temporal Assertions for Sequential and Concurrent Programs (2007)
Volker Stolz, Informatik Und, Aachen Erlangung, ...
In this thesis, we present an extension to the well-known concept of assertions: temporal assertions allow the specification and validation of modal safety properties of an application at runtime. We...
Parallel Algorithms for Verification of Large Systems (2006)
Michael Weber, Informatik Und, Michael Weber, Berichter Prof, ...
vorgelegt von
Benedikt Bollig, Informatik Und, Aachen Erlangung, ...
Tag der mündlichen Prüfung: 07.03.2005 A message-passing automaton is an abstract model for the implementation of a distributed system whose components communicate via message exchange and thereby...