<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01833nab a2200253 i 4500</leader>
  <controlfield tag="001">acta86960</controlfield>
  <controlfield tag="005">20250415123726.0</controlfield>
  <controlfield tag="008">250415s2022    hu      o     000   eng d</controlfield>
  <datafield tag="022" ind1=" " ind2=" ">
   <subfield code="a">2676-993X</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
   <subfield code="a">10.14232/actacyb.283176</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">SZTE Egyetemi Kiadványok Repozitórium</subfield>
   <subfield code="b">hun</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Szécsi Péter György</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Improved loop execution modeling in the Clang static analyzer</subfield>
   <subfield code="h">[elektronikus dokumentum] /</subfield>
   <subfield code="c"> Szécsi Péter György</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">University of Szeged, Institute of Informatics</subfield>
   <subfield code="b">Szeged</subfield>
   <subfield code="c">2022</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">909-921</subfield>
  </datafield>
  <datafield tag="490" ind1="0" ind2=" ">
   <subfield code="a">Acta cybernetica</subfield>
   <subfield code="v">25 No. 4</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The LLVM Clang Static Analyzer is a source code analysis tool which aims to find bugs in C, C++, and Objective-C programs using symbolic execution, i.e. it simulates the possible execution paths of the code. Currently the simulation of the loops is somewhat naive (but efficient), unrolling the loops a predefined constant number of times. However, this approach can result in a loss of coverage in various cases. This study aims to introduce two alternative approaches which can extend the current method and can be applied simultaneously: (1) determining loops worth to fully unroll with applied heuristics, and (2) using a widening mechanism to simulate an arbitrary number of iteration steps. These methods were evaluated on numerous open source projects, and proved to increase coverage in most of the cases. This work also laid the infrastructure for future loop modeling improvements.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
   <subfield code="a">Természettudományok</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
   <subfield code="a">Számítás- és információtudomány</subfield>
  </datafield>
  <datafield tag="695" ind1=" " ind2=" ">
   <subfield code="a">Programanalízis, Programozás</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2="1">
   <subfield code="a">Horváth Gábor</subfield>
   <subfield code="e">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2="1">
   <subfield code="a">Porkoláb Zoltán</subfield>
   <subfield code="e">aut</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">http://acta.bibl.u-szeged.hu/86960/1/cybernetica_025_numb_004_909-921.pdf</subfield>
   <subfield code="z">Dokumentum-elérés </subfield>
  </datafield>
 </record>
</collection>
