Solving of Constraint Satisfaction Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111989" target="_blank" >RIV/00216305:26230/14:PU111989 - isvavai.cz</a>
Result on the web
<a href="http://www.feec.vutbr.cz/EEICT/2014/sbornik/03doktorskeprojekty/10pocitacovesystemy/02-xcekan00@stud.fit.vutbr.cz.pdf" target="_blank" >http://www.feec.vutbr.cz/EEICT/2014/sbornik/03doktorskeprojekty/10pocitacovesystemy/02-xcekan00@stud.fit.vutbr.cz.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Solving of Constraint Satisfaction Problem
Original language description
The goal of this paper is to find a suitable solver for Coverage Directed Test Generation that is one of the functional verification techniques. In order to do this, we summarized information about the Constraint Satisfaction Problem. The problem consists of finding a solution (assignments for variables) that must satisfy certain constraints. Moreover, we created a survey about existing constraint solvers and compare their pros and cons. In the final part of the paper we propose a solution how to integrate an appropriate constraint solver into the process of test generation.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 20th Conference STUDENT EEICT 2014
ISBN
978-80-214-4924-4
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
291-295
Publisher name
Faculty of Information Technology BUT
Place of publication
Brno
Event location
Brno
Event date
Apr 24, 2014
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)