<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology-d-neural-ai</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology - D: Neural &amp; AI</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/83126.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">83126</article-id>
<title-group>
<article-title>Optimizing the Running Time of a Trigger Search Algorithm Based on the Principles of Formal Verification of Artificial Neural Networks</article-title>
<subtitle>Optimizing Formal Verification for Neural Triggers</subtitle>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Tonkikh</surname><given-names>Aleksey</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Stroeva</surname><given-names>Ekaterina</given-names></name></contrib>
</contrib-group>
<aff id="aff1">RUSSIA, Moscow State University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2024-08-28">
<day>28</day>
<month>08</month>
<year>2024</year>
</pub-date>
<volume>24</volume>
<issue>D1</issue>
<fpage>11</fpage>
<lpage>19</lpage>
<abstract><p>The article examines the problem of scalability of the algorithm for searching for a trigger in images, which is based on the operating principle of the Deep Poly formal verification algorithm. The existing implementation had a number of shortcomings. According to them, the requirements for the optimized version of the algorithm were formulated, which were brought to practical implementation. Achieved 4 times acceleration compared to the original implementation.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>formal verification</kwd>
<kwd>machine learning</kwd>
<kwd>trigger injection attacks</kwd>
<kwd>backdoor attacks your</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume24/2-Optimizing-the-Running-Time.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/optimizing-the-running-time-of-a-trigger-search-algorithm-based-on-the-principles-of-formal-verification-of-artificial-neural-networks/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>The article examines the problem of scalability of the algorithm for searching for a trigger in images, which is based on the operating principle of the Deep Poly formal verification algorithm. The existing implementation had a number of shortcomings. According to them, the requirements for the optimized version of the algorithm were formulated, which were brought to practical implementation. Achieved 4 times acceleration compared to the original implementation</p>
</sec>
</body>
</article>