<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-014-12-1929</article-id>
      <article-id pub-id-type="publisher-id">29108</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>D.2.1 - Requirements/Specifications</subject>
          <subject>D.2.4 - Software/Program Verification</subject>
          <subject>D.3.1 - Formal Definitions and Theory</subject>
          <subject>D.4.6 - Security and Protection</subject>
          <subject>F.3.1 - Specifying and Verifying and Reasoning about Programs</subject>
          <subject>F.4.1 - Mathematical Logic</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>ASM Refinement Preserving Invariants</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Schellhorn</surname>
            <given-names>Gerhard</given-names>
          </name>
          <email xlink:type="simple">schellhorn@informatik.uni-augsburg.de</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">University of Augsburg, , Germany</addr-line>
        <institution>University of Augsburg</institution>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Gerhard Schellhorn (<email xlink:type="simple">schellhorn@informatik.uni-augsburg.de</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2008</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>06</month>
        <year>2008</year>
      </pub-date>
      <volume>14</volume>
      <issue>12</issue>
      <fpage>1929</fpage>
      <lpage>1948</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/F60AC6AA-0D49-52EA-B602-AF6C7183BDF6">F60AC6AA-0D49-52EA-B602-AF6C7183BDF6</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000358">7000358</uri>
      <permissions>
        <copyright-statement>Gerhard Schellhorn</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal verification of the refinements of the Mondex case study with the interactive theorem prover KIV. The refinement definition we give differs from the one we gave in earlier work which preserves partial and total correctness assertions of ASM runs. The reason is that the main goal of the refinement of the Mondex protocol is to preserve a security invariant, while total correctness is not preserved. To preserve invariants, the definition of generalized forward simulation is limited to the use of "small" diagrams, which contain of a single protocol step. We show a technique that allows to use the natural "big" diagrams that consist of an atomic action being refined by a full protocol run.</p>
      </abstract>
    </article-meta>
  </front>
</article>
