Book Chapter10.1007/978-3-662-46681-0_51
Shield Synthesis
Roderick Bloem,Bettina Könighofer,Robert Könighofer,Chao Wang +3 more
- 11 Apr 2015
- pp 533-548
TL;DR: In this paper, the authors propose a safety shield that is attached to the design to enforce the properties at run time, where model checking and reactive synthesis fail, because it only considers a small set of critical properties, as opposed to the complex design, or the complete specification in the case of reactive synthesis.
read more
Abstract: Scalability issues may prevent users from verifying critical properties of a complex hardware design. In this situation, we propose to synthesize a "safety shield" that is attached to the design to enforce the properties at run time. Shield synthesis can succeed where model checking and reactive synthesis fail, because it only considers a small set of critical properties, as opposed to the complex design, or the complete specification in the case of reactive synthesis. The shield continuously monitors the input/output of the design and corrects its erroneous output only if necessary, and as little as possible, so other non-critical properties are likely to be retained. Although runtime enforcement has been studied in other domains such as action systems, reactive systems pose unique challenges where the shield must act without delay. We thus present the first shield synthesis solution for reactive hardware systems and report our experimental results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Safe Reinforcement Learning via Shielding
TL;DR: A new approach to learn optimal policies while enforcing properties expressed in temporal logic by synthesizing a reactive system called a shield, which monitors the actions from the learner and corrects them only if the chosen action causes a violation of the specification.
485
Shield Synthesis
Roderick Bloem,Bettina Könighofer,Robert Könighofer,Chao Wang +3 more
- 11 Apr 2015
TL;DR: In this paper, the authors propose a safety shield that is attached to the design to enforce the properties at run time, where model checking and reactive synthesis fail, because it only considers a small set of critical properties, as opposed to the complex design, or the complete specification in the case of reactive synthesis.
Introduction to Model Checking
Edmund M. Clarke,Thomas A. Henzinger,Helmut Veith +2 more
- 01 Jan 2018
TL;DR: This chapter is an introduction and short survey of model checking and aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.
88
An Inductive Synthesis Framework for Verifiable Reinforcement Learning
TL;DR: Experimental results over a wide range of cyber-physical applications demonstrate that software-inspired formal verification techniques can be used to realize trustworthy reinforcement learning systems with low overhead.
73
Runtime Failure Prevention and Reaction
Yliès Falcone,Leonardo Mariani,Antoine Rollet,Saikat Saha +3 more
- 11 Feb 2018
TL;DR: This chapter presents an overall vision of the problem of ensuring highly-dependable behaviours at runtime based on the concept of autonomic monitor, and presents the two families of relevant approaches for this purpose.
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
The temporal logic of programs
Amir Pnueli
- 30 Sep 1977
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
5.8K
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Edmund M. Clarke,E. Allen Emerson +1 more
- 01 May 1981
TL;DR: It is shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification and it is believed that this approach may in the long run turn out to be quite practical.
2.6K
On the synthesis of a reactive module
Amir Pnueli,Roni Rosner +1 more
- 03 Jan 1989
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.
1.7K