Tender System Verification with Satisfiability Modulo Theories

Author(s):  
Rene Davila ◽  
Rocio Aldeco-Perez ◽  
Everardo Barcenas
10.29007/x7b4 ◽  
2018 ◽  
Author(s):  
Nikolaj Bjorner

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.


2014 ◽  
Vol 668-669 ◽  
pp. 879-883 ◽  
Author(s):  
Yi Gang Sun ◽  
Li Sun

In order to avoid the complex mathematical modeling and ensure the reliability of avionics system verification, this paper has designed an interfaces emulation and verification platform of avionics system based on QAR data. Platform includes 2 parts: Emulator and Simulator. Simulator generates the flight environmental data which is come from QAR and transforms the data into excitation signal of devices. Emulator emulates the interface features of avionic devices according to the ICD and can be replaced with real devices. By comparing the actual input-output data of devices with QAR theoretical data, this platform can evaluate the running performance of avionic systems or devices and the rationality of the ICD.


2003 ◽  
Vol 68 (5) ◽  
pp. 85-100 ◽  
Author(s):  
C. Bui Thanh ◽  
H. Klaudel ◽  
F. Pommereau

Sign in / Sign up

Export Citation Format

Share Document