Towards a Wide Acceptance of Formal Methods to the Design of Safety Critical Software: an Approach Based on UML and Model Checking

2015 ◽  
pp. 612-627 ◽  
Author(s):  
Eduardo Rohde Eras ◽  
Luciana Brasil Rebelo dos Santos ◽  
Valdivino Alexandre de Santiago Júnior ◽  
Nandamudi Lankalapalli Vijaykumar
Keyword(s):  
Model Checking ◽  
Formal Methods ◽  
Safety Critical ◽  
Wide Acceptance

scholarly journals Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems

2013 ◽  
Vol 23 (4) ◽  
pp. 675-675
Author(s):  
AZER BESTAVROS ◽  
ASSAF KFOURY
Keyword(s):  
Computer Science ◽  
Formal Methods ◽  
Wide Spectrum ◽  
Critical Systems ◽  
Research Groups ◽  
Special Issue ◽  
Mathematical Structures ◽  
Safety Critical ◽  
Safety Critical Systems ◽  
Final Selection

The papers included in this special issue of Mathematical Structures in Computer Science were selected from a larger set we solicited from leading research groups on both sides of the Atlantic. They cover a wide spectrum of tutorials, recent results and surveys in the area of lightweight and practical formal methods in the design and analysis of safety-critical systems. All the papers we received were submitted to a rigorous process of review and revision, based on which we made our final selection.

The practice of formal methods in safety-critical systems

1995 ◽  
Vol 28 (1) ◽  
pp. 77-87 ◽  
Author(s):  
Shaoying Liu ◽  
Victoria Stavridou ◽  
Bruno Dutertre
Keyword(s):  
Formal Methods ◽  
Critical Systems ◽  
Safety Critical ◽  
Safety Critical Systems

Reliability analysis and safety model checking of Safety-Critical and control Systems: A case study of NPP control system

2022 ◽  
Vol 166 ◽  
pp. 108812
Author(s):  
Vinay Kumar ◽  
Kailash Chandra Mishra ◽  
Pooja Singh ◽  
Aditya Narayan Hati ◽  
Mohan Rao Mamdikar ◽  
...  
Keyword(s):  
Control System ◽  
Model Checking ◽  
Reliability Analysis ◽  
Control Systems ◽  
Safety Critical ◽  
And Control

scholarly journals Verifiable and Interpretable Reinforcement Learning through Program Synthesis

2019 ◽  
Vol 33 ◽  
pp. 9902-9903
Author(s):  
Abhinav Verma
Keyword(s):  
Neural Network ◽  
Machine Learning ◽  
Neural Networks ◽  
Reinforcement Learning ◽  
Programming Languages ◽  
Formal Methods ◽  
Domain Knowledge ◽  
Policy Search ◽  
Safety Critical ◽  
Symbolic Methods

We study the problem of generating interpretable and verifiable policies for Reinforcement Learning (RL). Unlike the popular Deep Reinforcement Learning (DRL) paradigm, in which the policy is represented by a neural network, the aim of this work is to find policies that can be represented in highlevel programming languages. Such programmatic policies have several benefits, including being more easily interpreted than neural networks, and being amenable to verification by scalable symbolic methods. The generation methods for programmatic policies also provide a mechanism for systematically using domain knowledge for guiding the policy search. The interpretability and verifiability of these policies provides the opportunity to deploy RL based solutions in safety critical environments. This thesis draws on, and extends, work from both the machine learning and formal methods communities.

Model Checking for SpaceWire Error Detection Module

2012 ◽  
Vol 241-244 ◽  
pp. 3020-3025
Author(s):  
Ling Ling Dong ◽  
Yong Guan ◽  
Xiao Juan Li ◽  
Zhi Ping Shi ◽  
Jie Zhang ◽  
...  
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Temporal Logic ◽  
Error Detection ◽  
System Model ◽  
Linear Search ◽  
Kripke Structure ◽  
Mathematical Methods ◽  
Safety Critical ◽  
Correctness Of Programs

Considerable attention has been devoted to prove the correctness of programs. Formal verification overcomes the incompleteness by applying mathematical methods to verify a design. SpaceWire is a well known communication standard. For safety-critical applications an approach is needed to validate the completeness of SpareWire design. This paper addresses formal verification of SpareWire error detection module. The system model was constructed by Kripke structure, and the properties were presented by linear temporal logic (LTL). Compared the verification of LTL with CTL (branch temporal logic), LTL properties could improve the verification efficiency due to its linear search. The error priority was checked using simulation guided by model checking. After some properties were modified, all possible behaviors of the module satisfied the specification. This method realizes complete validation of the error detection module.

Sign in / Sign up

Export Citation Format

Share Document