QBM - Mapping User-Specified Functions to Programmable Logic through a QBF Satisfiability Problem

01/06/2018
by   Thomas B. Preußer, et al.
0

This is a brief overview on the background behind the test set formulas generated by the QBM tool. After establishing its application context, its formal approach to the generation of QBF formulas and the concrete test set formulas are described. Finally, some related work will be credited and the source to obtain the open-source tool will be identified.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2019

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the ∃^*∀^* Fragment

Hyperproperties are properties that refer to multiple computation traces...
research
08/01/2020

The test set for the TransCoder system

The TransCoder system translates source code between Java, C++, and Pyth...
research
02/02/2020

Avocado: Open-Source Flexible Constrained Interaction Testing for Practical Application

This paper presents the outcome of a research collaboration between acad...
research
08/31/2020

A process algebra with global variables

In standard process algebra, parallel components do not share a common s...
research
03/30/2018

Generation of complete test sets

We use testing to check if a combinational circuit N always evaluates to...
research
03/30/2022

PLCverif: Status of a Formal Verification Tool for Programmable Logic Controller

Programmable Logic Controllers (PLC) are widely used for industrial auto...
research
05/20/2019

Accelerated Discovery of Sustainable Building Materials

Concrete is the most widely used engineered material in the world with m...

Please sign up or login with your details

Forgot password? Click here to reset