<?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-20T11:57:04Z</responseDate>
  <request identifier="5968" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:5968</identifier>
        <datestamp>2024-03-06T10:37:23Z</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>Compositional Compiler Verification for a Multi-Language World</dc:title>
          <dc:creator>Ahmed, Amal</dc:creator>
          <dc:subject>verified compilation; compositional compiler correctness</dc:subject>
          <dc:subject>multi-language semantics</dc:subject>
          <dc:subject>typed low-level languages</dc:subject>
          <dc:description>Verified compilers are typically proved correct under severe&#13;
restrictions on what the compiler's output may be linked with, from no&#13;
linking at all to linking only with code compiled from the same source&#13;
language.  Such assumptions contradict the reality of how we use these&#13;
compilers since most software systems today are comprised of&#13;
components written in different languages compiled by different&#13;
compilers to a common target, as well as low-level libraries that may&#13;
be handwritten in the target language.&#13;
&#13;
The key challenge in verifying compilers for today's world of&#13;
multi-language software is how to formally state a compiler&#13;
correctness theorem that is compositional along two dimensions.&#13;
First, the theorem must guarantee correct compilation of components&#13;
while allowing compiled code to be composed (linked) with&#13;
target-language components of arbitrary provenance, including those&#13;
compiled from other languages.  Second, the theorem must support&#13;
verification of multi-pass compilers by composing correctness proofs&#13;
for individual passes.  In this talk, I will describe a methodology&#13;
for verifying compositional compiler correctness for a higher-order&#13;
typed language and discuss the challenges that lie ahead.  I will&#13;
argue that compositional compiler correctness is, in essence, a&#13;
language interoperability problem: for viable solutions in the long&#13;
term, high-level languages must be equipped with principled&#13;
foreign-function interfaces that specify safe interoperability&#13;
between high-level and low-level components, and between more&#13;
precisely and less precisely typed code.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Amal Ahmed</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)</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/LIPIcs.FSCD.2016.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-59680</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
