<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-437</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>ИТЕРАТИВНЫЕ ПОЧТИ ПСЕВДОИСЧЕРПЫВАЮЩИЕ ВЕРОЯТНОСТНЫЕ ТЕСТЫ</article-title><trans-title-group xml:lang="en"><trans-title></trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ярмолик</surname><given-names>С. В.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ярмолик</surname><given-names>В. Н.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2010</year></pub-date><pub-date pub-type="epub"><day>08</day><month>06</month><year>2018</year></pub-date><volume>0</volume><issue>2(26)</issue><fpage>66</fpage><lpage>75</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмолик С.В., Ярмолик В.Н., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Ярмолик С.В., Ярмолик В.Н.</copyright-holder><copyright-holder xml:lang="en">Ярмолик С.В., Ярмолик В.Н.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/437">https://inf.grid.by/jour/article/view/437</self-uri><abstract><p>Предлагается метод построения почти псевдоисчерпывающих вероятностных тестов, характеризующихся большей полнотой покрытия в сравнении с вероятностными и детерминированными тестами при такой же их временной сложности. Данные тесты позволяют генерировать всевозможные двоичные комбинации на любых k из N входов тестируемого цифрового устройства. Показывается их эффективность для малых значений k и небольшого числа итераций. Приводятся экспериментальные исследования для случая тестирования ОЗУ.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Tang, D.T. Exhaustive Test Pattern Generation with Constant Weight Vectors / D.T. Tang,</mixed-citation><mixed-citation xml:lang="en">Tang, D.T. Exhaustive Test Pattern Generation with Constant Weight Vectors / D.T. Tang,</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">L.S. Woo // IEEE Transactions on Computers. – 1983. – Vol. C–32, № 12. – P. 1145–1150.</mixed-citation><mixed-citation xml:lang="en">L.S. Woo // IEEE Transactions on Computers. – 1983. – Vol. C–32, № 12. – P. 1145–1150.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Tang, D.T. Iterative Exhaustive Pattern Generation for Logic Testing / D.T. Tang, C.L. Chen // IBM Journal Res. Develop. – 1984. – Vol. 28, № 2. – P. 212–219.</mixed-citation><mixed-citation xml:lang="en">Tang, D.T. Iterative Exhaustive Pattern Generation for Logic Testing / D.T. Tang, C.L. Chen // IBM Journal Res. Develop. – 1984. – Vol. 28, № 2. – P. 212–219.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Karpovsky, M.G. Pseudo-Exhaustive Word-Oriented DRAM Testing / M.G. Karpovsky,</mixed-citation><mixed-citation xml:lang="en">Karpovsky, M.G. Pseudo-Exhaustive Word-Oriented DRAM Testing / M.G. Karpovsky,</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">V.N. Yarmolik, A.J. Goor // EUROTEST Conference : proc. Int. Conf., Paris, France, 6–9 March 1995 / IEEE Computer Society. – Washington, USA, 1995. – P. 126–132.</mixed-citation><mixed-citation xml:lang="en">V.N. Yarmolik, A.J. Goor // EUROTEST Conference : proc. Int. Conf., Paris, France, 6–9 March 1995 / IEEE Computer Society. – Washington, USA, 1995. – P. 126–132.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Levitin, L.B. Efficient Exhaustive Test Based on MDS Codes // L.B. Levitin,</mixed-citation><mixed-citation xml:lang="en">Levitin, L.B. Efficient Exhaustive Test Based on MDS Codes // L.B. Levitin,</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">M.G. Karpovsky // IEEE Int. Symposium on Information Theory : proc. Int. Conf. / IEEE Computer Society. – Ann Arbor, USA, 1986. – P. 64.</mixed-citation><mixed-citation xml:lang="en">M.G. Karpovsky // IEEE Int. Symposium on Information Theory : proc. Int. Conf. / IEEE Computer Society. – Ann Arbor, USA, 1986. – P. 64.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Barzilai, Z. Exhaustive Generation of Bit Pattern with Application to VLSI Self-Testing /</mixed-citation><mixed-citation xml:lang="en">Barzilai, Z. Exhaustive Generation of Bit Pattern with Application to VLSI Self-Testing /</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Z. Barzilai, D. Coppersmith, A. Rozenberg // IEEE Transactions on Computers. – 1983. – Vol. C–31, № 2. – P. 190–194.</mixed-citation><mixed-citation xml:lang="en">Z. Barzilai, D. Coppersmith, A. Rozenberg // IEEE Transactions on Computers. – 1983. – Vol. C–31, № 2. – P. 190–194.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Karpovsky, M.G. Transparent Memory BIST / M.G. Karpovsky, V.N. Yarmolik // IEEE</mixed-citation><mixed-citation xml:lang="en">Karpovsky, M.G. Transparent Memory BIST / M.G. Karpovsky, V.N. Yarmolik // IEEE</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Workshop on Memory Technology Design and Testing : proc. Int. Conf., San Jose, CA, USA,</mixed-citation><mixed-citation xml:lang="en">Workshop on Memory Technology Design and Testing : proc. Int. Conf., San Jose, CA, USA,</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">–9 August 1994 / IEEE Computer Society. – San Jose, USA, 1994. – P. 106–111.</mixed-citation><mixed-citation xml:lang="en">–9 August 1994 / IEEE Computer Society. – San Jose, USA, 1994. – P. 106–111.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Grindal, M. Combination Testing Strategies / M. Grindal, J. Offutt, S.F. Andler // GMU</mixed-citation><mixed-citation xml:lang="en">Grindal, M. Combination Testing Strategies / M. Grindal, J. Offutt, S.F. Andler // GMU</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Technical Report ISE-TR-04-05. – July, 2004. – 32 p.</mixed-citation><mixed-citation xml:lang="en">Technical Report ISE-TR-04-05. – July, 2004. – 32 p.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Кулямин, В.В. Комбинаторика слов и построение тестовых последовательностей /</mixed-citation><mixed-citation xml:lang="en">Кулямин, В.В. Комбинаторика слов и построение тестовых последовательностей /</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">В.В. Кулямин // Труды ИСП РАН. − 2004. − № 8 (1). – С. 25−40.</mixed-citation><mixed-citation xml:lang="en">В.В. Кулямин // Труды ИСП РАН. − 2004. − № 8 (1). – С. 25−40.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Hartman, A. Problems and Algorithms for Covering Arrays / A. Hartman, L. Raskin // Discrete Mathematics. – 2004. − № 284. – P. 149−156.</mixed-citation><mixed-citation xml:lang="en">Hartman, A. Problems and Algorithms for Covering Arrays / A. Hartman, L. Raskin // Discrete Mathematics. – 2004. − № 284. – P. 149−156.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik, S.V. Multi-Background Memory Testing / S.V. Yarmolik, I. Mrozek // Mixed</mixed-citation><mixed-citation xml:lang="en">Yarmolik, S.V. Multi-Background Memory Testing / S.V. Yarmolik, I. Mrozek // Mixed</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Design of Integrated Circuits and Systems (MIXDES’07) : proc. of the 14th Int. Conf., Ciechocinek, Poland, 21–23 June 2007 / Technical University of Lodz. – Ciechocinek, Poland, 2007. – P. 511–516.</mixed-citation><mixed-citation xml:lang="en">Design of Integrated Circuits and Systems (MIXDES’07) : proc. of the 14th Int. Conf., Ciechocinek, Poland, 21–23 June 2007 / Technical University of Lodz. – Ciechocinek, Poland, 2007. – P. 511–516.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik, S.V. Optimal Memory Address Seeds for Pattern Sensitive Faults Detection /</mixed-citation><mixed-citation xml:lang="en">Yarmolik, S.V. Optimal Memory Address Seeds for Pattern Sensitive Faults Detection /</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">S.V. Yarmolik, B. Sokol // IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS’2006) : proc. Int. Conf., Prague, Czech Republic, 18–21 April 2006 / Czech Technical University Publishing House. – Prague, Czech Republic, 2006 – P. 220–221.</mixed-citation><mixed-citation xml:lang="en">S.V. Yarmolik, B. Sokol // IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS’2006) : proc. Int. Conf., Prague, Czech Republic, 18–21 April 2006 / Czech Technical University Publishing House. – Prague, Czech Republic, 2006 – P. 220–221.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Das, D. Exhaustive and Near-Exhaustive Memory Testing Techniques and their BIST Implementations / D. Das, M.G. Karpovsky // Journal of Electronic Testing: Theory and Applications. – 1997. – Vol. 10. – P. 215–229.</mixed-citation><mixed-citation xml:lang="en">Das, D. Exhaustive and Near-Exhaustive Memory Testing Techniques and their BIST Implementations / D. Das, M.G. Karpovsky // Journal of Electronic Testing: Theory and Applications. – 1997. – Vol. 10. – P. 215–229.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Курбацкий, А.Н. Анализ эффективности многократных маршевых тестов запоминающиx устройств / А.Н. Курбацкий, С.В. Ярмолик // Весн. Гродн. дзярж. ун-та імя Я. Купалы. Cер. 2. Матэматыка. Фізіка. Інфарматыка, вылічальная тэхніка і кіраванне. Біялогія. – 2008. – № 2 (68). – С. 103–107.</mixed-citation><mixed-citation xml:lang="en">Курбацкий, А.Н. Анализ эффективности многократных маршевых тестов запоминающиx устройств / А.Н. Курбацкий, С.В. Ярмолик // Весн. Гродн. дзярж. ун-та імя Я. Купалы. Cер. 2. Матэматыка. Фізіка. Інфарматыка, вылічальная тэхніка і кіраванне. Біялогія. – 2008. – № 2 (68). – С. 103–107.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Adams, R.D. High Performance Memory Testing: Design Principles, Fault Modeling and</mixed-citation><mixed-citation xml:lang="en">Adams, R.D. High Performance Memory Testing: Design Principles, Fault Modeling and</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Self-Test / R.D. Adams. – N.Y. : Kluwer Academic Publishers, 2003. – 247 p.</mixed-citation><mixed-citation xml:lang="en">Self-Test / R.D. Adams. – N.Y. : Kluwer Academic Publishers, 2003. – 247 p.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Неразрушающее тестирование запоминающих устройств / В.Н. Ярмолик [и др.]. –</mixed-citation><mixed-citation xml:lang="en">Неразрушающее тестирование запоминающих устройств / В.Н. Ярмолик [и др.]. –</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Минск : Бестпринт, 2005. – 230 с.</mixed-citation><mixed-citation xml:lang="en">Минск : Бестпринт, 2005. – 230 с.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Mrozek, I. Problemu Funkcjonalnego Testowania Pamieci RAM / I. Mrozek, V. Yarmolik. –</mixed-citation><mixed-citation xml:lang="en">Mrozek, I. Problemu Funkcjonalnego Testowania Pamieci RAM / I. Mrozek, V. Yarmolik. –</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Bialystok : Oficyna Wydawnicza Politechniki Bialostockiej, 2009. – 264 str.</mixed-citation><mixed-citation xml:lang="en">Bialystok : Oficyna Wydawnicza Politechniki Bialostockiej, 2009. – 264 str.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
