Íîâèêîâ Äìèòðèé ßêîâëåâè÷
Ïîèñê ïî ñàéòó
Àâòîðèçàöèÿ
Çà÷åì íóæíà ðåãèñòðàöèÿ?
Ëîãèí:
Ïàðîëü:
Ðåãèñòðàöèÿ
Çàáûëè ñâîé ïàðîëü?
Äëÿ ñîòðóäíèêîâ ÎÈÏÈ
Äëÿ ñîòðóäíèêîâ ÎÈÏÈ ÍÀÍ Áåëàðóñè 
Äëÿ îáðàùåíèé
Äëÿ îáðàùåíèé

ïðîñèì ïðèíÿòü ó÷àñòèå â îïðîñåçàïîëíèòü àíêåòó

Íîâèêîâ Äìèòðèé ßêîâëåâè÷

Íîâèêîâ Äìèòðèé ßêîâëåâè÷Íîâèêîâ Äìèòðèé ßêîâëåâè÷ – ìëàäøèé íàó÷íûé ñîòðóäíèê ëàáîðàòîðèè ëîãè÷åñêîãî ïðîåêòèðîâàíèÿ ÎÈÏÈ ÍÀÍ Áåëàðóñè.

Ðîäèëñÿ â 1983 ãîäó â ã. Ìèíñêå.

 2006 ãîäó îêîí÷èë Áåëîðóññêèé íàöèîíàëüíûé òåõíè÷åñêèé óíèâåðñèòåò (ÁÍÒÓ) ïî ñïåöèàëüíîñòè «Ïðîãðàììíîå îáåñïå÷åíèå èíôîðìàöèîííûõ òåõíîëîãèé» ñ ïðèñâîåíèåì êâàëèôèêàöèè èíæåíåðà-ïðîãðàììèñòà.

 2009 ãîäó îêîí÷èë àñïèðàíòóðó ïðè ÎÈÏÈ ÍÀÍ Áåëàðóñè.

Çàùèòèë êàíäèäàòñêóþ äèññåðòàöèþ íà òåìó «Âåðèôèêàöèÿ ëîãè÷åñêèõ îïèñàíèé êîìáèíàöèîííûõ óñòðîéñòâ ïðè íàëè÷èè ôóíêöèîíàëüíîé íåîïðåäåëåííîñòè» (ïî ñïåöèàëüíîñòè 05.13.12 - ñèñòåìû àâòîìàòèçàöèè ïðîåêòèðîâàíèÿ).

Îáëàñòü íàó÷íûõ èíòåðåñîâ:
âåðèôèêàöèÿ ïðîöåññîâ ïðîåêòèðîâàíèÿ ìèêðîýëåêòðîííûõ óñòðîéñòâ.

Ñïèñîê íàó÷íûõ ïóáëèêàöèé:

1. Íîâèêîâ, Ä.ß. Íàõîæäåíèå ìíîæåñòâà âñåõ ïðîñòûõ èìïëèöåíò áóëåâîé ôóíêöèè îáõîäîì òðîè÷íîãî äåðåâà ïîèñêà / Ä.ß. Íîâèêîâ //

Èçâåñòèÿ Íàö. àêàä. íàóê Áåëàðóñè. Ñåð. ôèç-ìàò. íàóê. – 2006. – ¹ 5. – Ñ. 9–11.

2. ×åðåìèñèíîâà, Ë.Ä. Ïðîâåðêà ñõåìíîé ðåàëèçàöèè ÷àñòè÷íûõ áóëåâûõ ôóíêöèé / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Âåñòíèê Òîìñêîãî ãîñóäàðñòâåííîãî óíèâåðñèòåòà. Ñåð. Óïðàâëåíèå, âû÷èñëèòåëüíàÿ òåõíèêà è èíôîðìàòèêà. – 2008. – ¹ 4. – Ñ. 102–111.

3. Cheremisinova, L. Simulation-based approach to verification of logical descriptions with functional indeterminacy / L. Cheremisinova, D. Novikov // Information Theories and Applicatons. – 2008. – Vol. 15, – ¹ 3. – P. 218-224.

4. Cheremisinova, L. Using SAT for combinational implementation checking / L. Cheremisinova, D. Novikov // Information Science and Computing. – 2008. – ¹ 7. – P. 203–210.

5. Cheremisinova, L. SAT-based method of verification using logarithmic encoding / L. Cheremisinova, D. Novikov // Information Science and Computing. – 2009. – ¹ 15. – P. 107–114.

6. Áèáèëî, Ï.Í. Ïðîãðàììíûé êîìïëåêñ MICEL âûñîêîóðîâíåâîãî è ëîãè÷åñêîãî ñèíòåçà ïàðàëëåëüíûõ àëãîðèòìîâ ëîãè÷åñêîãî óïðàâëåíèÿ / Ï.Í. Áèáèëî, Ñ.Í. Êàðäàø, Í.À. Êèðèåíêî, Ä.À. Êî÷àíîâ, Ï.Â. Ëåîí÷èê, Ä.ß. Íîâèêîâ, Â.È. Ðîìàíîâ, Ä.È. ×åðåìèñèíîâ // Óïðàâëÿþùèå ñèñòåìû è ìàøèíû. – 2009. – ¹ 5. Ñ. 81–88.

7. ×åðåìèñèíîâà, Ë.Ä. Âåðèôèêàöèÿ ìíîãîáëî÷íûõ ñòðóêòóð ñ ôóíêöèîíàëüíîé íåîïðåäåëåííîñòüþ / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Èçâåñòèÿ Íàö. àêàä. íàóê Áåëàðóñè. Ñåð. ôèç-òåõí. íàóê. – 2009. – ¹ 2. – Ñ. 98–105.

8. ×åðåìèñèíîâà, Ë.Ä. Ôîðìàëüíàÿ âåðèôèêàöèÿ îïèñàíèé ñ ôóíêöèîíàëüíîé íåîïðåäåëåííîñòüþ íà îñíîâå ïðîâåðêè âûïîëíèìîñòè ÊÍÔ / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Àâòîìàòèêà è âû÷èñëèòåëüíàÿ òåõíèêà. – 2010. – ¹ 1. – Ñ. 5–16.

9. Íîâèêîâ, Ä.ß. Ìåòîä ïðîâåðêè ðåàëèçóåìîñòè ñèñòåìû ÷àñòè÷íî îïðåäåëåííûõ áóëåâûõ ôóíêöèé íà îñíîâå ëîãàðèôìè÷åñêîãî êîäèðîâàíèÿ / Íîâèêîâ Ä.ß. // Ìîëîäåæü â íàóêå – 2009: ïðèë. ê æóðí. «Âåñöi Íàöûÿíàëüíàé àêàäýìii íàâóê Áåëàðóñi». Ñåð. ôèç-ìàò. íàóê. – 2010. – ×. 5. – Ñ. 31-37.

10. Íîâèêîâ, Ä.ß. Âåðèôèêàöèÿ ôóíêöèîíàëüíûõ îïèñàíèé ñ íåîïðåäåëåííîñòüþ íà îñíîâå ïàðàôàçíîãî ïðåäñòàâëåíèÿ áóëåâûõ ôóíêöèé / Ä.ß. Íîâèêîâ, Ë.Ä. ×åðåìèñèíîâà // Èíôîðìàòèêà. – 2010. – ¹ 3. Ñ. 54 – 62.

11. Íîâèêîâ, Ä.ß. Ñâåäåíèå çàäà÷è ïðîâåðêè ðåàëèçóåìîñòè ëîãè÷åñêèõ îïèñàíèé ê áóëåâûì âû÷èñëåíèÿì / Ä.ß. Íîâèêîâ, Ë.Ä. ×åðåìèñèíîâà // Òàíàåâñêèå ÷òåíèÿ : äîêëàäû òðåòüåé ìåæäóíàð. íàó÷. êîíô., Ìèíñê, 28 ìàðòà 2007 ã. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Â.Ñ. Ãîðäîí. – Ìèíñê, 2007. – Ñ. 131–135.

12. ×åðåìèñèíîâà, Ë. Âåðèôèêàöèÿ ëîãè÷åñêèõ îïèñàíèé ñ ôóíêöèîíàëüíîé íåîïðåäåëåííîñòüþ / Ë. ×åðåìèñèíîâà, Ä. Íîâèêîâ // Knowledge-Dialogue-Solution : Proceedings of the XIII-th Int. Conf., Varna, 23 june – 03 juli 2007 / Inst. of Informaton Theories and Appl. FOI ITHEA ; edited by V.P. Gladun [et al.]. – Sofia, 2007.– P. 78-84.

13. Cheremisinova, L.D. Verification of multi-block structures with functional indeterminacy / L.D. Cheremisinova, D.Ya. Novikov // Àâòîìàòèçàöèÿ ïðîåêòèðîâàíèÿ äèñêðåòíûõ óñòðîéñòâ (CAD DD’07) : Ìàòåðèàëû VI ìåæäóíàð. êîíô., Ìèíñê, 14-15 íîÿáðÿ 2007 ã. : â 2 ò. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Ñ.Ñ. Ìîéñåé÷èê. – Ìèíñê, 2007. – Ò. 2. – Ñ. 103–108.

14. Novikov, D.Ya. An efficient method for finding prime implicates / D.Ya. Novikov // Àâòîìàòèçàöèÿ ïðîåêòèðîâàíèÿ äèñêðåòíûõ óñòðîéñòâ (CAD DD’07) : Ìàòåðèàëû VI ìåæäóíàð. êîíô., Ìèíñê, 14-15 íîÿáðÿ 2007 ã : â 2 ò. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Ñ.Ñ. Ìîéñåé÷èê. – Ìèíñê, 2007. – Ò. 2. – Ñ. 95–102.

15. Cheremisinova, L. SAT-Based Approach to Verification of Logical Descriptions with Functional Indeterminacy / L. Cheremisinova, D. Novikov // 8th International Workshop on Boolean Problems : Proceedings of the Workshop, Freiberg, 18 – 19 September 2008 / Techn. univ. Bergakademie ; edited by B. Steinbach. – Freiberg, 2008. – P. 59–66.

16. ×åðåìèñèíîâà, Ë.Ä. Ïðîâåðêà ðåàëèçóåìîñòè ëîãè÷åñêèõ îïèñàíèé ñ ôóíêöèîíàëüíîé íåîïðåäåëåííîñòüþ / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Ïðîáëåìû ïðîåêòèðîâàíèÿ è ïðîèçâîäñòâà ðàäèîýëåêòðîííûõ ñðåäñòâ : ñáîðíèê ìàòåðèàëîâ Ìåæäóíàð. íàó÷.-òåõíè÷. êîíô., Íîâîïîëîöê, 29-30 ìàÿ 2008 ã. : â 3-õ ò. / Ïîëîö. ãîñ. óí-ò ; ðåäêîë.: À.Ï. Äîñòàíêî [è äð.]. – Íîâîïîëîöê, 2008. – Ò. III. Èíôîðìàòèêà. – Ñ. 76–79.

17. Íîâèêîâ, Ä.ß. Èìïëèêàòèâíûé ìåòîä àíàëèçà áóëåâûõ ôóíêöèé íà ðåàëèçóåìîñòü / Ä.ß. Íîâèêîâ, Ë.Ä. ×åðåìèñèíîâà // ×åòâåðòûé Áåëîðóññêèé êîñìè÷åñêèé êîíãðåññ : Ìàòåðèàëû êîíãðåññà, Ìèíñê, 27-29 îêòÿáðÿ 2009 ã. : â 2 ò. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: À.Â. Òóçèêîâ [è äð.]. – Ìèíñê, 2009. – Ò. 2. – Ñ. 67–71.

18. Cheremisinova, L. SAT-Based Group Method for Verification of Logical Descriptions with Functional Indeterminacy / L. Cheremisinova, D. Novikov // IEEE East-West Design and Test Symposium (EWDTS’09) : Proceedings of the Symposium, Moscow, September 18 - 21, 2009 / Kharkov National University of Radioelectronics ; edited by S. Chumachenko. – Kharkov, 2009. – P. 31–34.

19–À. ×åðåìèñèíîâà, Ë.Ä. Ïðîâåðêà ðåàëèçóåìîñòè ôóíêöèîíàëüíî íåîïðåäåëåííîãî îïèñàíèÿ íà îñíîâå êîäèðîâàíèÿ óñëîâèé / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Òàíàåâñêèå ÷òåíèÿ : äîêëàäû ÷åòâåðòîé ìåæäóíàð. íàó÷. êîíô., Ìèíñê, 29–30 ìàðòà 2010 ã. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Í.À. Ðóäàÿ [è äð.]. – Ìèíñê, 2010. – Ñ. 135–140.

20. Cheremisinova, L. SAT-Based Implicative Method of Implementation Checking for Incompletely Specified Boolean Functions/ L. Cheremisinova, D. Novikov // 9‑th International Workshop on Boolean Problems : Proceedings of the Workshop, Freiberg, 16 – 17 September 2010 / Techn. univ. Bergakademie ; edited by B. Steinbach. – Freiberg, 2010. – P. 97–102.

21. Íîâèêîâ, Ä.ß. Âåðèôèêàöèÿ ÷àñòè÷íî îïðåäåëåííûõ ñòðóêòóðíûõ îïèñàíèé / Ä.ß. Íîâèêîâ // Ñîâðåìåííûå ñðåäñòâà ñâÿçè : ìàòåðèàëû XII Ìåæäóíàð. íàó÷íî-òåõí. êîíô., Ìèíñê, 24-28 ñåíò. 2007 ã. / Âûñøèé ãîñóä. êîëëåäæ ñâÿçè ; ðåäêîë.: Ì.À. Áàðêóí [è äð.]. – Ìèíñê, 2007. – Ñ. 65.

22. Cheremisinova, L.D. An approach to implementation checking / L.D. Cheremisinova, D.Ya. Novikov // Ñåäüìàÿ Ðîññèéñêàÿ êîíô. ñ ìåæäóíàð. ó÷àñòèåì : òåçèñû äîêëàäîâ, Òîìñê, 2-5 ñåíòÿáðÿ 2008 ã. / Òîìñêèé ãîñóä. óíèâåñèòåò ; ðåäêîë.: Í.È. Øèäëîâñêàÿ. – Òîìñê, 2008. – Ñ. 64.

23. ×åðåìèñèíîâà, Ë.Ä. Àëãîðèòìè÷åñêèå ñðåäñòâà ïðîâåðêè ðåàëèçóåìîñòè ñèñòåì ÷àñòè÷íî îïðåäåëåííûõ áóëåâûõ ôóíêöèé / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Èíôîðìàöèîííûå òåõíîëîãèè â ïðîìûøëåííîñòè (ITI*2008) : òåçèñû äîêëàäîâ ïÿòîé Ìåæäóíàð. íàó÷íî-òåõí. êîíô., Ìèíñê, 22–24 îêòÿáðÿ 2008 ã. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Å.Â. Âëàäèìèðîâ. – Ìèíñê, 2008. – Ñ. 206–207.

24. ×åðåìèñèíîâà, Ë.Ä. Âåðèôèêàöèÿ ôóíêöèîíàëüíî íåîïðåäåëåííûõ ëîãè÷åñêèõ îïèñàíèé êîìáèíàöèîííûõ ñõåì / Ë.Ä. ×åðåìèñèíîâà, Ä.ß. Íîâèêîâ // Êîìïüþòåðíûå íàóêè è èíôîðìàöèîííûå òåõíîëîãèè : ìàòåðèàëû Ìåæäóíàð. íàó÷. êîíô., Ñàðàòîâ, 01-04 èþëÿ 2009 / Ñàðàò. óí-ò ; ðåäêîë.: Â.À. Òâåðäîõëåáîâ [è äð.]. – Ñàðàòîâ, 2009. – Ñ. 250–251.

25. Íîâèêîâ, Ä.ß. Îðãàíèçàöèÿ ýêñïåðèìåíòàëüíîãî êîìïëåêñà äëÿ òåñòèðîâàíèÿ àëãîðèòìîâ âåðèôèêàöèè / Ä.ß. Íîâèêîâ, Ë.Ä. ×åðåìèñèíîâà // Èíôîðìàöèîííûå òåõíîëîãèè â ïðîìûøëåííîñòè (ITI*2010) : òåçèñû äîêëàäîâ øåñòîé Ìåæäóíàð. íàó÷íî-òåõí. êîíô., Ìèíñê, 28–29 îêòÿáðÿ 2010 ã. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ïîä ðåä.: Å.Â. Âëàäèìèðîâà. – Ìèíñê, 2010. – Ñ. 204–205.

26. Cheremisinova, L.D. SAT based method of implementation checking for incompletely specified Boolean functions / L.D. Cheremisinova, D.Ya. Novikov // Àâòîìàòèçàöèÿ ïðîåêòèðîâàíèÿ äèñêðåòíûõ óñòðîéñòâ (CAD DD’10) : Ìàòåðèàëû VII ìåæäóíàð. êîíô., Ìèíñê, 16-17 íîÿáðÿ 2010 ã. / ÎÈÏÈ ÍÀÍ Áåëàðóñè ; ðåäêîë.: Ñ.Ñ. Ìîéñåé÷èê. – Ìèíñê, 2010. – Ñ. 226–233.