Gorschwin Fey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gorschwin Fey has a total of 136 co-authors. Here are the top co-authors by number of shared publications:
- Rolf Drechsler
Faculty 03 Mathematics and Computer Science, University of Bremen
32 shared publications Mehdi Dehbashi
Institute of Computer Science, University of Bremen, Bremen, Germany
8 shared publicationsHeinz Riener
Cole Polytechnique Fdrale de Lausanne, Lausanne, Switzerland
6 shared publications- Heinz Riener
Institute of Space Systems, German Aerospace Center, Germany
6 shared publications - Jaan Raik
Department of Computer Systems, Tallinn University of Technology, Tallinn, Estonia
6 shared publications Jan Malburg
6 shared publications
Latest Publications
- Open Access
- 14 October 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 55 (2) , 103-135
Synthesizing adaptive test strategies from temporal logic specifications
Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems from a given temporal logic specification using formal methods. The computed strategies are guaranteed to reveal certain simple faults ineveryrealization of the specification and foreverybehavior of the uncontrollable part of the system’s environment. The proposed approach supports different assumptions on occurrences of faults (ranging from a single transient fault to a persistent fault) and by default aims at unveiling the weakest one. We argue that such tests are also sensitive for more complex bugs. Since the specification may not define the system behavior completely, we use reactive synthesis algorithms with partial information. The computed strategies areadaptive test strategiesthat react to behavior at runtime. We work out the underlying theory of adaptive test strategy synthesis and present experiments for a safety-critical component of a real-world satellite system. We demonstrate that our approach can be applied to industrial specifications and that the synthesized test strategies are capable of detecting bugs that are hard to detect with random testing.
- 14 October 2019
- Published by Springer Nature in Formal Methods in System Design
- Vol. 55 (2) , 103-135
Open AccessSynthesizing adaptive test strategies from temporal logic specifications
Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems from a given temporal logic specification using formal methods. The computed strategies are guaranteed to reveal certain simple faults ineveryrealization of the specification and foreverybehavior of the uncontrollable part of the system’s environment. The proposed approach supports different assumptions on occurrences of faults (ranging from a single transient fault to a persistent fault) and by default aims at unveiling the weakest one. We argue that such tests are also sensitive for more complex bugs. Since the specification may not define the system behavior completely, we use reactive synthesis algorithms with partial information. The computed strategies areadaptive test strategiesthat react to behavior at runtime. We work out the underlying theory of adaptive test strategy synthesis and present experiments for a safety-critical component of a real-world satellite system. We demonstrate that our approach can be applied to industrial specifications and that the synthesized test strategies are capable of detecting bugs that are hard to detect with random testing.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-116
Engineering of an Effective Automatic Dynamic Assertion Mining Platform
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-116
Engineering of an Effective Automatic Dynamic Assertion Mining Platform
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15, 485-491
Local Monitoring of Embedded Applications and Devices using Artificial Neural Networks
Reliability, security, and safety become even more challenging in times of the Internet of Things (IoT). Devices operate jointly in large distributed networks and may affect each other's functionality due to failures or attacks. Identifying abnormal system behavior is therefore the solution to protect the device itself and other network participants to ensure service availability and system integrity. We propose a monitor concept based on long short-term memory recurrent neural networks which adapts to new devices by learning the nominal behavior automatically. No fault model is needed to identify erroneous behavior. The monitor can operate locally on the device, so our approach addresses the limited bandwidth and connectivity of IoT devices. Experiments evaluate our approach for a simulated controller under varying runtime conditions.
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15, 485-491
Local Monitoring of Embedded Applications and Devices using Artificial Neural Networks
Reliability, security, and safety become even more challenging in times of the Internet of Things (IoT). Devices operate jointly in large distributed networks and may affect each other's functionality due to failures or attacks. Identifying abnormal system behavior is therefore the solution to protect the device itself and other network participants to ensure service availability and system integrity. We propose a monitor concept based on long short-term memory recurrent neural networks which adapts to new devices by learning the nominal behavior automatically. No fault model is needed to identify erroneous behavior. The monitor can operate locally on the device, so our approach addresses the limited bandwidth and connectivity of IoT devices. Experiments evaluate our approach for a simulated controller under varying runtime conditions.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 172-175
Design Understanding: From Logic to Specification
We present an outline of the field of Design Understanding and summarize state-of-the-art research in deriving human-understandable knowledge in form of logic properties from an unknown design.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 172-175
Design Understanding: From Logic to Specification
We present an outline of the field of Design Understanding and summarize state-of-the-art research in deriving human-understandable knowledge in form of logic properties from an unknown design.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards Self-Explaining Digital Systems: A Design Methodology for the Next Generation
As digital systems get ever more complex, their behaviour may at times appear unfathomable. Users will only be prepared to accept this if they are convinced that the system does indeed work correctly. Thus, we argue the need for self-explaining systems: systems that are able to explain their behaviour, and the reasons for it. In this paper, we propose first steps towards a design methodology for such systems, and argue that beyond user acceptance, self-explanation also has other applications such as self-verification and reconfiguration. We propose a conceptual framework for self-explaining systems, discuss how to achieve completeness, and consider implementation aspects.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards Self-Explaining Digital Systems: A Design Methodology for the Next Generation
As digital systems get ever more complex, their behaviour may at times appear unfathomable. Users will only be prepared to accept this if they are convinced that the system does indeed work correctly. Thus, we argue the need for self-explaining systems: systems that are able to explain their behaviour, and the reasons for it. In this paper, we propose first steps towards a design methodology for such systems, and argue that beyond user acceptance, self-explanation also has other applications such as self-verification and reconfiguration. We propose a conceptual framework for self-explaining systems, discuss how to achieve completeness, and consider implementation aspects.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 147-152
Software-Level TMR Approach for On-Board Data Processing in Space Applications
Handling faults in computing systems is often expensive in terms of power, area and financial costs. In domains requiring high reliability in harsh environments, like the space domain, special highly reliable components are used, which may adversely impact the processing performance. In this paper, we propose the STROBES algorithm for fault handling in a multi-node embedded system which can be composed of standard commercial off-the-shelf components. In particular, it does not require underlying synchronization, but relies on embedded system's properties to derive bounds for communication and processing times. The algorithm can handle asynchronous behavior between the nodes up to user-defined bounds, in addition to a fault in the state or fail-stop failure of a single node. Theoretical analysis shows that this is sufficient for extended operating times. Experimental data show the efficient behavior of the STROBES algorithm for practical application with different state and time bounds.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 147-152
Software-Level TMR Approach for On-Board Data Processing in Space Applications
Handling faults in computing systems is often expensive in terms of power, area and financial costs. In domains requiring high reliability in harsh environments, like the space domain, special highly reliable components are used, which may adversely impact the processing performance. In this paper, we propose the STROBES algorithm for fault handling in a multi-node embedded system which can be composed of standard commercial off-the-shelf components. In particular, it does not require underlying synchronization, but relies on embedded system's properties to derive bounds for communication and processing times. The algorithm can handle asynchronous behavior between the nodes up to user-defined bounds, in addition to a fault in the state or fail-stop failure of a single node. Theoretical analysis shows that this is sufficient for extended operating times. Experimental data show the efficient behavior of the STROBES algorithm for practical application with different state and time bounds.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 117-122
Augmenting All Solution SAT Solving for Circuits with Structural Information
All solutions SAT (All-SAT) is important in applications where we require enumerating all satisfying assignments of a propositional formula, e.g., when reasoning over many or all possible test patterns in Automatic Test Pattern Generation (ATPG). We applied structural analysis starting from primary inputs or primary outputs to generalize a current total assignment to a partial assignment. This speeds up the determination of all satisfying assignments. The experiments were conducted using a large number of random instances and different available All-SAT solvers. We show that structural analysis techniques can significantly speed up enumeration of all satisfying assignments of combinational circuits and yield the the second largest number of total satisfying assignments from all compared All-SAT solvers.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 117-122
Augmenting All Solution SAT Solving for Circuits with Structural Information
All solutions SAT (All-SAT) is important in applications where we require enumerating all satisfying assignments of a propositional formula, e.g., when reasoning over many or all possible test patterns in Automatic Test Pattern Generation (ATPG). We applied structural analysis starting from primary inputs or primary outputs to generalize a current total assignment to a partial assignment. This speeds up the determination of all satisfying assignments. The experiments were conducted using a large number of random instances and different available All-SAT solvers. We show that structural analysis techniques can significantly speed up enumeration of all satisfying assignments of combinational circuits and yield the the second largest number of total satisfying assignments from all compared All-SAT solvers.
- Open Access
- 11 November 2017
- Published by Springer Nature
- p. 15-38
Designing Reliable Cyber-Physical Systems
- 11 November 2017
- Published by Springer Nature
- p. 15-38
Open AccessDesigning Reliable Cyber-Physical Systems
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 533-538
Towards Making Fault Injection on Abstract Models a More Accurate Tool for Predicting RT-Level Effects
Fault injection and fault simulation are a typical approach to analyze the effect of a fault on a hardware/software system. Often fault injection is done on abstract models of the system either to retrieve early results when no implementation is available, yet, or to speed-up the runtime intensive fault simulation on detailed models. The simulation results from the abstract model are typically inaccurate because details of the concrete hardware are missing. Here, we propose an approach to relate faults from an abstract untimed algorithmic model to their counterparts in the concrete register transfer models. This allows to understand which faults are covered on the concrete model and to speed up the fault simulation process. We use a mapping between both models' variables and mapped timing states for fault injection to corresponding variables on both models. After fault simulations the results are compared to check, whether a given fault produces the same behavior on both models. The results show that an injected fault to corresponding variables leads to the same behavior of both models for a large share of faults.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 533-538
Towards Making Fault Injection on Abstract Models a More Accurate Tool for Predicting RT-Level Effects
Fault injection and fault simulation are a typical approach to analyze the effect of a fault on a hardware/software system. Often fault injection is done on abstract models of the system either to retrieve early results when no implementation is available, yet, or to speed-up the runtime intensive fault simulation on detailed models. The simulation results from the abstract model are typically inaccurate because details of the concrete hardware are missing. Here, we propose an approach to relate faults from an abstract untimed algorithmic model to their counterparts in the concrete register transfer models. This allows to understand which faults are covered on the concrete model and to speed up the fault simulation process. We use a mapping between both models' variables and mapped timing states for fault injection to corresponding variables on both models. After fault simulations the results are compared to check, whether a given fault produces the same behavior on both models. The results show that an injected fault to corresponding variables leads to the same behavior of both models for a large share of faults.