<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:40:20Z</responseDate>
  <request identifier="2808" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2808</identifier>
        <datestamp>2024-03-06T11:09:26Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Step-Indexing: The Good, the Bad and the Ugly</dc:title>
          <dc:creator>Benton, Nick</dc:creator>
          <dc:creator>Hur, Chung-Kil</dc:creator>
          <dc:subject>Step-Indexing</dc:subject>
          <dc:subject>Logical Relations</dc:subject>
          <dc:subject>Low-Level Languages</dc:subject>
          <dc:subject>Compiler Correctness</dc:subject>
          <dc:description>Over the last decade, step-indices have been widely used for the&#13;
construction of operationally-based logical relations in the presence&#13;
of various kinds of recursion. We first give an argument that&#13;
step-indices, or something like them, seem to be required for defining&#13;
realizability relations between high-level source languages and&#13;
low-level targets, in the case that the low-level allows egregiously&#13;
intensional operations such as reflection or comparison of code&#13;
pointers. We then show how, much to our annoyance, step-indices also&#13;
seem to prevent us from exploiting such operations as aggressively as&#13;
we would like in proving program transformations.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Nick Benton and Chung-Kil Hur</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10351, Modelling, Controlling and Reasoning About State (2010)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.10351.7</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-28085</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10351.7</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
