Checking of circuit implementation of incompletely specified Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 4 (5).

Checking of circuit implementation of incompletely specified Boolean functions

The task of logical verification iswell studied for the case when both compared descriptions are completely specified and are given as structural representations. This case is reduced to checking on whether two combinational circuits are equivalent. In contrast to that, here the verification task is examined for a case, when desired functionality of the system under design is incompletely specified.

Download file
Counter downloads: 309

Keywords

верификация , комбинационная схема , моделирование , verification , combinational circuit , simulation

Authors

NameOrganizationE-mail
Cheremisinova L.D. cld@newman.bas-net.by
Novikov D.Ya. yakov_nov@tut.by
Всего: 2

References

Drechsler R. (Ed.). Advanced Formal Verification. Kluwer Academic Publishers, 2004.
Mishchenko A., Chatterjee S., Brayton R., Een N. Improvements to Combinational Equivalence Checking // Proc. ICCAD'06, Nov. 5 - 9, 2006. San Jose, CA, 2006.
Ganai M.K., Zhang L., Ashar P., Gupta A., Malik S. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver // Proc. ACM/IEEE Design Automation Conference, 2002. P. 747 - 750.
Goldberg E., Novikov Y. BerkMin: A fast and robust SAT-Solver // Proc. European Design and Test Conference, 2002. P. 142 - 149.
Kuehlmann A., Cornelis A.J. van Eijk. Combinational and Sequential Equivalence Checking // Logic synthesis and Verification / Eds. S. Hassoun, T. Sasao, R.K. Brayton). Kluwer Academic Publishers, 2002. P. 343 - 372.
Закревский А.Д., Поттосин Ю.В., Черемисинова Л.Д. Основы логического проектирования. Кн. 3. Проектирование устройств логического управления. Минск: ОИПИ НАН Беларуси, 2006.
Cheremisinova L. Simulation-based approach to verification of logical descriptions with functional indeterminacy / L. Cheremisinova, D. Novikov // Information Theories & Applications (IJ ITA). 2008. V. 15. No. 3. P. 218 - 224.
Tseitin G.C. On the Complexity of Derivation in Propositional Calculus // Studies in Constructive Mathematics and Mathematical Logic. 1968. Part 2. P. 115 - 125. Reprinted in J. Siekmann and G.Wrightson, eds., Automation of Reasoning, Springer-Verlag, 1983. V. 2. P. 466 - 483.
 Checking of circuit implementation of incompletely specified Boolean functions             | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 4 (5).

Checking of circuit implementation of incompletely specified Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2008. № 4 (5).

Download file