scholarly journals Bit-Precise Formal Verification for SystemC Using Satisfiability Modulo Theories Solving

2017 ◽  
pp. 51-63
Author(s):  
Lydia Jaß ◽  
Paula Herber
Keyword(s):  
Formal Verification ◽  
Satisfiability Modulo Theories

scholarly journals Extracting minimal unsatisfiable subformulas in satisfiability modulo theories

2011 ◽  
Vol 8 (3) ◽  
pp. 693-710 ◽  
Author(s):  
Jianmin Zhang ◽  
Shengyu Shen ◽  
Jun Zhang ◽  
Weixia Xu ◽  
LI. Sikun
Keyword(s):  
Formal Verification ◽  
Design Automation ◽  
Search Algorithm ◽  
Satisfiability Modulo Theories ◽  
Experimental Results ◽  
Breadth First Search ◽  
Practical Applications ◽  
Searching Strategy ◽  
Extensive Test ◽  
Boolean Formulas

Explaining the causes of infeasibility of formulas has practical applications in various fields, such as formal verification and electronic design automation. A minimal unsatisfiable subformula provides a succinct explanation of infeasibility and is valuable for applications. The problem of deriving minimal unsatisfiable cores from Boolean formulas has been addressed rather frequently in recent years. However little attention has been concentrated on extraction of unsatisfiable subformulas in Satisfiability Modulo Theories(SMT). In this paper, we propose a depth-firstsearch algorithm and a breadth-first-search algorithm to compute minimal unsatisfiable cores in SMT, adopting different searching strategy. We report and analyze experimental results obtaining from a very extensive test on SMT-LIB benchmarks.

Formal Verification of Control System Software

2019 ◽  
Author(s):  
Pierre-Loïc Garoche
Keyword(s):  
Control System ◽  
Formal Verification ◽  
Formal Analysis ◽  
Critical Systems ◽  
System Software ◽  
Unified Approach ◽  
Verification Methods ◽  
Autonomous Cars ◽  
Computer Scientists ◽  
Verification Techniques

The verification of control system software is critical to a host of technologies and industries, from aeronautics and medical technology to the cars we drive. The failure of controller software can cost people their lives. This book provides control engineers and computer scientists with an introduction to the formal techniques for analyzing and verifying this important class of software. Too often, control engineers are unaware of the issues surrounding the verification of software, while computer scientists tend to be unfamiliar with the specificities of controller software. The book provides a unified approach that is geared to graduate students in both fields, covering formal verification methods as well as the design and verification of controllers. It presents a wealth of new verification techniques for performing exhaustive analysis of controller software. These include new means to compute nonlinear invariants, the use of convex optimization tools, and methods for dealing with numerical imprecisions such as floating point computations occurring in the analyzed software. As the autonomy of critical systems continues to increase—as evidenced by autonomous cars, drones, and satellites and landers—the numerical functions in these systems are growing ever more advanced. The techniques presented here are essential to support the formal analysis of the controller software being used in these new and emerging technologies.

Engineering Theories with Z3

10.29007/x7b4 ◽  
2018 ◽  
Author(s):  
Nikolaj Bjorner
Keyword(s):  
Satisfiability Modulo Theories ◽  
Smt Solver ◽  
Testing Tools ◽  
Software And Hardware ◽  
Design And Testing

Modern Satisfiability Modulo Theories (SMT)solvers are fundamental to many programanalysis, verification, design and testing tools. They are a goodfit for the domain of software and hardware engineering becausethey support many domains that are commonly used by the tools.The meaning of domains are captured by theories that can beaxiomatized or supported by efficient <i>theory solvers</i>.Nevertheless, not all domains are handled by all solvers andmany domains and theories will never be native to any solver.We here explore different theories that extend MicrosoftResearch's SMT solver Z3's basicsupport. Some can be directly encoded or axiomatized,others make use of user theory plug-ins.Plug-ins are a powerful way for tools to supply their custom domains.

HOL2GDT a Formal Verification-Based Design Methodology

2001 ◽  
Author(s):  
Anand Chavan ◽  
Byoung Woo Min ◽  
Shiu-Kai Chin
Keyword(s):  
Formal Verification ◽  
Design Methodology
Sign in / Sign up

Export Citation Format

Share Document