Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

2008 ◽  
pp. 290-304 ◽  
Author(s):  
Tommi Junttila ◽  
Jori Dubrovin
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Satisfiability Modulo Theories

scholarly journals Verification Method of Safety Properties of Embedded Assembly Program by Combining SMT-Based Bounded Model Checking and Reduction of Interrupt Handler Executions

Electronics ◽  
2020 ◽  
Vol 9 (7) ◽  
pp. 1060
Author(s):  
Satoshi Yamane ◽  
Junpei Kobashi ◽  
Kosuke Uemura
Keyword(s):  
Model Checking ◽  
High Reliability ◽  
Bounded Model Checking ◽  
Point Of View ◽  
Satisfiability Modulo Theories ◽  
Prototype Model ◽  
Safety Properties ◽  
Verification Method ◽  
Interrupt Handler ◽  
Direct Operation

Embedded software has properties dependent on hardware (direct operation of address spaces, memory mapped I/O, interruption, etc.). Therefore, demands about the established method of formal verifications corresponding to those properties are increasing from the point of view of shorter development and high reliability. Our study aims at enabling a formal verification with Satisfiability Modulo Theories-Based Bounded Model Checking (SMT-Based BMC) of safety for embedded assembly codes. Our proposed method generates models of assembly codes in detail with the fixed-sized bit-vectors theory. The models generated by our method include interrupts, and the size of the models is reduced using Interrupt Handler Execution Reduction (IHER) technique. In this paper, we have developed the verification method of safety properties of embedded assembly program by combining SMT-Based Bounded Model Checking and Reduction of Interrupt Handler Executions. Moreover, we show the evaluation of our method by experiments using prototype model checker.

scholarly journals SMT Encoding of Hybrid Systems in dReal

10.29007/s3b9 ◽  
2018 ◽  
Author(s):  
Kyungmin Bae ◽  
Soonho Kong ◽  
Sicun Gao
Keyword(s):  
Model Checking ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Hybrid Systems ◽  
Bounded Model Checking ◽  
Satisfiability Modulo Theories ◽  
Real Numbers ◽  
The Real ◽  
Real Functions ◽  
Nonlinear Hybrid

Analysis problems of hybrid systems, involving nonlinear real functions and ordinary differential equations, can be reduced to SMT (satisfiability modulo theories) problems over the real numbers. The dReal solver can automatically check the satisfiability of such SMT formulas up to a given precision δ > 0. This paper explains how bounded model checking problems of hybrid systems are encoded in dReal. In particular, a novel SMT syntax of dReal enables to effectively represent networks of hybrid systems in a modular way. We illustrate SMT encoding in dReal with simple nonlinear hybrid systems.

Bounded Model Checking for Probabilistic Computation Tree Logic

2012 ◽  
Vol 23 (7) ◽  
pp. 1656-1668 ◽  
Author(s):  
Cong-Hua ZHOU ◽  
Zhi-Feng LIU ◽  
Chang-Da WANG
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Probabilistic Computation ◽  
Computation Tree Logic ◽  
Computation Tree

Bounded model checking of high-integrity software

2013 ◽  
Vol 33 (3) ◽  
pp. 9-10
Author(s):  
Sagar Chaki
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
High Integrity

scholarly journals Contradictory antecedent debugging in bounded model checking

2009 ◽  
Author(s):  
Daniel Grosse ◽  
Robert Wille ◽  
Ulrich Kuehne ◽  
Rolf Drechsler
Keyword(s):  
Model Checking ◽  
Bounded Model Checking

scholarly journals Symbolic Causality Checking Using Bounded Model Checking

2015 ◽  
pp. 203-221 ◽  
Author(s):  
Adrian Beer ◽  
Stephan Heidinger ◽  
Uwe Kühne ◽  
Florian Leitner-Fischer ◽  
Stefan Leue
Keyword(s):  
Model Checking ◽  
Bounded Model Checking
Sign in / Sign up

Export Citation Format

Share Document