• Publications
  • Influence
Verification of Reactive Systems: Formal Methods and Algorithms
TLDR
All important results on m-calculus, w-automata, and temporal logics are presented, and the relationships between these formalisms are shown, and state-of-the-art verification procedures for them are described.
Verification of Reactive Systems
  • K. Schneider
  • Computer Science
    Texts in Theoretical Computer Science
  • 2004
data type such as lists, can be used to encode numbers, it moreover follows that first-order logic can not characterize such abstract data types (up to isomorphisms between the interpretations). For
Teaching cyber-physical systems: a programming approach
TLDR
An extension of the synchronous programming language Quartz is proposed to model, simulate, and verify cyber-physical systems, and an operational semantics of this language is developed that formally specifies a simulator and a translation to hybrid state transition systems for the formal verification of these systems.
Embedding imperative synchronous languages in interactive theorem provers
  • K. Schneider
  • Computer Science
    Proceedings Second International Conference on…
  • 25 June 2001
TLDR
A new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow is presented, and Quartz (an Esterel variant) is embedded in the interactive theorem prover HOL.
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
TLDR
It is shown how large parts of the formulas can be translated to the simpler logic CTL, which accelerates the LTL model checking by orders of magnitude which is shown by experimental results.
Multithreaded code from synchronous programs: Extracting independent threads for OpenMP
TLDR
This paper presents the compilation of synchronous programs to multi-threaded OpenMP-based C programs and shows how viable tasks can be constructed from the actions of a program and shows the feasibility of the approach.
Synthesis of Parallel Sorting Networks using SAT Solvers
TLDR
This paper investigates whether and how it is possible to use the power of modern SAT solvers to automatically synthesize optimal sorting networks (with minimal depth) and was able to reproduce the known results up to size 10, but could so far not obtain larger optimal networks.
A Verified Hardware Synthesis of Esterel Programs
TLDR
A variant of the Esterel language is embedded in the interactive theorem prover HOL so that it can formally reason about programs of the language and about the language itself Based on a separation of the control and data flow of the programs, a new translation to equation systems is defined.
Safe Automotive Software
TLDR
The problems of development of vehicle systems according to ISO 26262 are described and an approach for a safety-oriented reference architecture is presented that introduces adaptive software safety cages to reduce safety requirements for vehicle control systems.
Solving Games Using Incremental Induction
TLDR
This paper shows how to compute a solution of games by using incremental induction, which is often much faster compared to otherwise used fixpoint-based model checking algorithms.
...
...