<?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-22T21:35:17Z</responseDate>
  <request identifier="3123" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3123</identifier>
        <datestamp>2024-03-06T10:33:50Z</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>Termination Analysis of C Programs Using Compiler Intermediate Languages</dc:title>
          <dc:creator>Falke, Stephan</dc:creator>
          <dc:creator>Kapur, Deepak</dc:creator>
          <dc:creator>Sinz, Carsten</dc:creator>
          <dc:subject>termination analysis; C programs; compiler intermediate languages</dc:subject>
          <dc:description>Modeling the semantics of programming languages like C for the&#13;
automated termination analysis of programs is a challenge if complete&#13;
coverage of all language features should be achieved.  On the other&#13;
hand, low-level intermediate languages that occur during the&#13;
compilation of C programs to machine code have a much simpler&#13;
semantics since most of the intricacies of C are taken care of by the&#13;
compiler frontend.  It is thus a promising approach to use these&#13;
intermediate languages for the automated termination analysis of C&#13;
programs. In this paper we present the tool KITTeL based on this&#13;
approach. For this, programs in the compiler intermediate language&#13;
are translated into term rewrite systems (TRSs), and the termination&#13;
proof itself is then performed on the automatically generated TRS.  An&#13;
evaluation on a large collection of C programs shows the effectiveness&#13;
and practicality of KITTeL on "typical" examples.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Stephan Falke and Deepak Kapur and Carsten Sinz</dc:contributor>
          <dc:date>2011</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011)</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.RTA.2011.41</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-31232</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.41</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
