| DC Field | Value | Language |
|---|
| dc.contributor.author | Cheremisinova, L. D. | - |
| dc.contributor.author | Черемисинова Л. Д. | - |
| dc.date.accessioned | 2015-02-11T11:35:28Z | - |
| dc.date.accessioned | 2017-07-19T08:27:06Z | - |
| dc.date.available | 2015-02-11T11:35:28Z | - |
| dc.date.available | 2017-07-19T08:27:06Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Cheremisinova, L. D. SAT based approaches to verification of logical descriptions with functional indeterminacy / L. D. Cheremisinova // Информационные технологии и системы 2012 (ИТС 2012) : материалы международной научной конференции, БГУИР, Минск, Беларусь, 24 октября 2012 г. = Information Technologies and Systems 2012 (ITS 2012) : Proceeding of The International Conference, BSUIR, Minsk, 24th October 2012 / редкол. : Л. Ю. Шилин [и др.]. – Минск : БГУИР, 2012. – C. 182–183. | ru_RU |
| dc.identifier.isbn | 978-985-488-926-9 | - |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/3057 | - |
| dc.description.abstract | The problem under consideration is to check
whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional
indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely
or incompletely specified Boolean functions. SAT based verification methods are considered that formulate the verification problem as checking satisfiability of a conjunctive
normal form. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | БГУИР | ru_RU |
| dc.subject | материалы конференций | ru_RU |
| dc.subject | design automation | ru_RU |
| dc.subject | verification | ru_RU |
| dc.subject | testing | ru_RU |
| dc.title | SAT based approaches to verification of logical descriptions with functional indeterminacy | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | ИТС 2012
|
