<?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-25T23:25:15Z</responseDate>
  <request identifier="6109" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:6109</identifier>
        <datestamp>2024-03-06T10:38:00Z</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>Program Tailoring: Slicing by Sequential Criteria</dc:title>
          <dc:creator>Li, Yue</dc:creator>
          <dc:creator>Tan, Tian</dc:creator>
          <dc:creator>Zhang, Yifei</dc:creator>
          <dc:creator>Xue, Jingling</dc:creator>
          <dc:subject>Program Slicing</dc:subject>
          <dc:subject>Program Analysis</dc:subject>
          <dc:subject>API Protocol Analysis</dc:subject>
          <dc:description>Protocol and typestate analyses often report some sequences of&#13;
statements ending at a program point P that needs to be&#13;
scrutinized, since P may be erroneous or imprecisely&#13;
analyzed. Program slicing focuses only on the behavior at P by&#13;
computing a slice of the program affecting the values at P. In&#13;
this paper, we propose to restrict our attention to the subset of&#13;
that behavior at P affected by one or several statement&#13;
sequences, called a sequential criterion (SC). By leveraging the&#13;
ordering information in a SC, e.g., the temporal order in a few&#13;
valid/invalid API method invocation sequences, we introduce a&#13;
new technique, program tailoring, to compute a tailored program&#13;
that comprises the statements in all possible execution paths&#13;
passing through at least one sequence in SC in the given&#13;
order. With a prototyping implementation, Tailor, we show why&#13;
tailoring is practically useful by conducting two case studies on&#13;
seven large real-world Java applications. For program&#13;
debugging and understanding, Tailor can complement program&#13;
slicing by removing SC-irrelevant statements. For program&#13;
analysis, Tailor can enable a pointer analysis, which is&#13;
unscalable to a program, to perform a more focused and therefore&#13;
potentially scalable analysis to its specific parts containing&#13;
hard language features such as reflection.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Yue Li and Tian Tan and Yifei Zhang and Jingling Xue</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 56, 30th European Conference on Object-Oriented Programming (ECOOP 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.ECOOP.2016.15</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-61092</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2016.15</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>
