<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Translation Validation of Scheduled Conditional Behavior using Petri Net based Program Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rakshit Mittal</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Soumyadip Bandyopadhyay</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>BITS Pilani, KK Birla Goa Campus</institution>
          ,
          <addr-line>Goa, 403726</addr-line>
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Hasso-Platner Institute</institution>
          ,
          <addr-line>Potsdam, 14482</addr-line>
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Telecom Paris, Institut Polytechnique de Paris</institution>
          ,
          <addr-line>91120</addr-line>
          <country country="FR">France</country>
        </aff>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>cut-points to a cut-point without intermediary cut-points. Similarly in Fig. 1(d),
cut-points are fp01; p02; p03; p04; p05; p06; p07; p08; p09; p011; p012; p013; p015g; the path cover,
1 = f 1 = hft01gi, 2 = hft04gi, 3 = hft03gi, 4 = hft02gi, 5 = hft05g; ft07gi,
6 = hft06gi, 7 = hft07gi, 8 = hft08gig.</p>
      <p>
        The notion of equivalence checking is as follows: \8 paths 2 0 9 an
equivalent path in 1 and vice-versa". A path-based equivalence checking module
takes these sets of paths for both the Petri net models, and using the concept of
path merging as well as extension of paths that we have developed, checks for
equivalence between the paths and returns a Yes/No answer for the semantic
equivalence between source and translated programs. The module does not give
a false positive result, but since the approach is not complete, a `No' answer is
interpreted as `Can't Say'. Equivalence between two expressions is checked using
the Z3 SMT solver [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Using this approach the set of equivalent pairs of paths
is fh 1; ( 1 4)i; h 2; 2jj 3i; h 3; 5i; h 4; 6i; h 5; 7i; h 6; 8ig
      </p>
      <p>Capabilities and limitations: Our approach can handle several uniform and
non-uniform code optimizing and parallelizing transformations for scalar
programs. The major limitation of our method is that it cannot validate array
handling programs. The method also incapable to validate loop shifting class of
transformations.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Chouksey</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karfa</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Veri cation of scheduling of conditional behaviors in highlevel synthesis</article-title>
          .
          <source>IEEE Trans. on Very Large Scale Integration (VLSI) Systems</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Mittal</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Banerjee</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sarkar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bandyopadhyay</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Translation validation of loop involving code optimizing transformations using petri net based models of programs</article-title>
          .
          <source>In: PNSE 2020</source>
          . vol.
          <volume>2651</volume>
          , pp.
          <volume>138</volume>
          {
          <fpage>146</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Moura</surname>
            ,
            <given-names>L.D.</given-names>
          </string-name>
          , Bj rner, N.:
          <article-title>Z3: an e cient smt solver</article-title>
          .
          <source>In: TACAS'08/ETAPS'08 Proceedings of the Theory and Practice of Software</source>
          . pp.
          <volume>337</volume>
          {
          <issue>340</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>