All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Pure methods for roDOT

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10485862" target="_blank" >RIV/00216208:11320/24:10485862 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.4230/LIPICS.ECOOP.2024.13" target="_blank" >https://doi.org/10.4230/LIPICS.ECOOP.2024.13</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPICS.ECOOP.2024.13" target="_blank" >10.4230/LIPICS.ECOOP.2024.13</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Pure methods for roDOT

  • Original language description

    Object-oriented programming languages typically allow mutation of objects, but pure methods are common too. There is great interest in recognizing which methods are pure, because it eases analysis of program behavior and allows modifying the program without changing its behavior. The roDOT calculus is a formal calculus extending DOT with reference mutability. In this paper, we explore purity conditions in roDOT and pose a SEF guarantee, by which the type system guarantees that methods of certain types are side-effect free. We use the idea from ReIm to detect pure methods by argument types. Applying this idea to roDOT required just a few changes to the type system, but necessitated re-working a significant part of the soundness proof. In addition, we state a transformation guarantee, which states that in a roDOT program, calls to SEF methods can be safely reordered without changing the outcome of the program. We proved type soundness of the updated roDOT calculus, using multiple layers of typing judgments. We proved the SEF guarantee by applying the Immutability guarantee, and the transformation guarantee by applying the SEF guarantee within a framework for reasoning about safe transformations of roDOT programs. All proofs are mechanized in Coq.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    ECOOP 2024

  • ISBN

    978-3-95977-341-6

  • ISSN

  • e-ISSN

  • Number of pages

    29

  • Pages from-to

    1-29

  • Publisher name

    Schloss Dagstuhl - Leibniz-Zentrum für Informatik

  • Place of publication

    Neuveden

  • Event location

    Videň

  • Event date

    Sep 16, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article