September 30, 2020 Software Open Access

Kabir, Ifaz; Li, Yufeng; Lhoták, Ondřej

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.4060109</identifier>
  <creators>
    <creator>
      <creatorName>Kabir, Ifaz</creatorName>
      <givenName>Ifaz</givenName>
      <familyName>Kabir</familyName>
      <affiliation>University of Alberta</affiliation>
    </creator>
    <creator>
      <creatorName>Li, Yufeng</creatorName>
      <givenName>Yufeng</givenName>
      <familyName>Li</familyName>
      <affiliation>University of Waterlooo</affiliation>
    </creator>
    <creator>
      <creatorName>Lhoták, Ondřej</creatorName>
      <givenName>Ondřej</givenName>
      <familyName>Lhoták</familyName>
      <affiliation>University of Waterloo</affiliation>
    </creator>
  </creators>
  <titles>
    <title>ιDOT: A DOT Calculus with Object Initialization (Coq Formalization)</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2020</publicationYear>
  <subjects>
    <subject>Scala</subject>
    <subject>DOT</subject>
    <subject>dependent object types</subject>
    <subject>type systems</subject>
    <subject>type safety</subject>
    <subject>type soundness</subject>
    <subject>Coq</subject>
    <subject>initialization</subject>
    <subject>effect systems</subject>
    <subject>iDOT</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2020-09-30</date>
  </dates>
  <resourceType resourceTypeGeneral="Software"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/4060109</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.4060108</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;This is the artifact for our OOPSLA&amp;#39;20 paper that presents &amp;iota;DOT, a Dependent Object Types calculus with a type and effect system to ensure safe initialization of objects. This artifact contains the proof of type safety for the &amp;iota;DOT calculus, formalized in the Coq proof assistant.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Paper abstract:&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;The &lt;em&gt;Dependent Object Types (DOT)&lt;/em&gt; calculus serves as a foundation of the Scala programming language, with a machine-verified soundness proof. However, Scala&amp;#39;s type system has been shown to be unsound due to null references, which are used as default values of fields of objects before they have been initialized. This paper proposes &lt;strong&gt;&amp;iota;DOT&lt;/strong&gt;, an extension of DOT for ensuring safe initialization of objects. DOT was previously extended to &amp;kappa;DOT with the addition of mutable fields and constructors. To &amp;kappa;DOT, &amp;iota;DOT adds an &lt;em&gt;initialization effect system&lt;/em&gt; that statically prevents the possibility of reading a null reference from an uninitialized object. To design &amp;iota;DOT, we have reformulated the Freedom Before Commitment object initialization scheme in terms of disjoint subheaps to make it easier to formalize in an effect system and prove sound. Soundness of &amp;iota;DOT depends on the interplay of three systems of rules: a type system close to that of DOT, an effect system to ensure definite assignment of fields in each constructor, and an initialization system that tracks the initialization status of objects in a stack of subheaps. We have proven the overall system sound and verified the soundness proof using the Coq proof assistant.&lt;/p&gt;</description>
  </descriptions>
</resource>