<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><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-05-31T04:18:45Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/34958" metadataPrefix="mods">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/34958</identifier><datestamp>2026-02-03T12:26:43Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><mods:mods xmlns:doc="http://www.lyncode.com/xoai" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Jin, Xianhao</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Servant-Cortés, Francisco Javier</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2024-10-30T12:58:39Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2024-10-30T12:58:39Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2018</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="citation">Xianhao Jin and Francisco Servant. 2018. The hidden cost of code completion: understanding the impact of the recommendation-list length on its efficiency. In Proceedings of the 15th International Conference on Mining Software Repositories (MSR '18). Association for Computing Machinery, New York, NY , USA, 70–73. DOI: https://doi.org/10.1145/3196398.3196474</mods:identifier>
   <mods:identifier type="uri">https://hdl.handle.net/10630/34958</mods:identifier>
   <mods:abstract>Automatic code completion is a useful and popular technique that software developers use to write code more effectively and efficiently. However, while the benefits of code completion are clear, its cost is yet not well understood. We hypothesize the existence of a hidden cost of code completion, which mostly impacts developers when code completion techniques produce long recommendations. We study this hidden cost of code completion by evaluating how the length of the recommendation list affects other factors that may cause inefficiencies in the process. We study how common long recommendations are, whether they often provide low-ranked correct items, whether they incur longer time to be assessed, and whether they were more prevalent when developers did not select any item in the list. In our study, we observe evidence for all these factors, confirming the existence of a hidden cost of code completion.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by-nc-nd/4.0/</mods:accessCondition>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:accessCondition type="useAndReproduction">Attribution-NonCommercial-NoDerivatives 4.0 Internacional</mods:accessCondition>
   <mods:subject>
      <mods:topic>Software - Mantenimiento</mods:topic>
   </mods:subject>
   <mods:titleInfo>
      <mods:title>The Hidden Cost of Code Completion: Understanding the Impact of the Recommendation-list Length on its Efficiency.</mods:title>
   </mods:titleInfo>
   <mods:genre>conference output</mods:genre>
</mods:mods>
</metadata></record></GetRecord></OAI-PMH>