Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking

2018 ◽  
pp. 139-156 ◽  
Author(s):  
Yassmeen Elderhalli ◽  
Osman Hasan ◽  
Waqar Ahmad ◽  
Sofiène Tahar
Keyword(s):  
Model Checking ◽  
Theorem Proving ◽  
Fault Trees

scholarly journals Compositional Verification using Model Checking and Theorem Proving

2020 ◽  
pp. 305-314
Author(s):  
Diego Marmsoler
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
Embedded Systems ◽  
Theorem Proving ◽  
Formal Modeling ◽  
Compositional Verification ◽  
Modeling And Analysis ◽  
Simple Version ◽  
Evolving Systems ◽  
Alternative Approach

AbstractCollaborative embedded systems form groups in which individual systems collaborate to achieve an overall goal. To this end, new systems may join a group and participating systems can leave the group. Classical techniques for the formal modeling and analysis of distributed systems, however, are mainly based on a static notion of systems and thus are often not well suited for the modeling and analysis of collaborative embedded systems. In this chapter, we propose an alternative approach that allows for the verification of dynamically evolving systems and we demonstrate it in terms of a running example: a simple version of an adaptable and flexible factory.

scholarly journals Formal Requirements Capturing using VRS system

10.29007/q6mc ◽  
2018 ◽  
Author(s):  
Alexander Letichevsky ◽  
Alexander Kolchin ◽  
Oleksandr Letychevskyy jr. ◽  
Stepan Potiyenko ◽  
Vlad Volkov ◽  
...  
Keyword(s):  
Model Checking ◽  
Software Development ◽  
Theorem Proving ◽  
Specification Language ◽  
System Support ◽  
Development Projects ◽  
Short Overview ◽  
Formal Requirements

We give a short overview of main functionalities and specification language of the VRS system. That environment was succesfully used for formalization and verification of ~30 software development projects implemented in Motorola. The system support both model checking and theorem proving techniques enhanced with invariants generation.

scholarly journals Programming Combinations of Deduction and BDD-based Symbolic Calculation

2002 ◽  
Vol 5 ◽  
pp. 56-76 ◽  
Author(s):  
Michael J. C. Gordon
Keyword(s):  
Model Checking ◽  
Theorem Proving ◽  
Binary Decision Diagrams ◽  
Decision Diagrams ◽  
Inference Rules ◽  
Symbolic Calculation ◽  
Binary Decision ◽  
Proof Rules

AbstractA generalisation of Milner's ‘LCF approach’ is described. This allows algorithms based on binary decision diagrams (BDDs) to be programmed as derived proof rules in a calculus of representation judgements. The derivation of representation judgements becomes an LCF-style proof by defining an abstract type for judgements analogous to the LCF type of theorems. The primitive inference rules for representation judgements correspond to the operations provided by an efficient BDD package coded in C (BuDDy). Proof can combine traditional inference with steps inferring representation judgements. The resulting system provides a platform to support a tight and principled integration of theorem proving and model checking. The methods are illustrated by using them to solve all instances of a generalised Missionaries and Cannibals problem.

Sign in / Sign up

Export Citation Format

Share Document