<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>ABC: Algebraic Bound Computation for loops</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Régis</namePart>
  <namePart type="family">Blanc</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Thomas A</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40876CD8-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-2985-7724</description></name>
<name type="personal">
  <namePart type="given">Thibaud</namePart>
  <namePart type="family">Hottelier</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Laura</namePart>
  <namePart type="family">Kovács</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>



<name type="personal"><namePart type="given">Edmund M</namePart><namePart type="family">Clarke</namePart>
  <role> <roleTerm type="text">editor</roleTerm> </role></name>
<name type="personal"><namePart type="given">Andrei</namePart><namePart type="family">Voronkov</namePart>
  <role> <roleTerm type="text">editor</roleTerm> </role></name>




<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ToHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>LPAR: Logic for Programming, Artificial Intelligence and Reasoning</namePart>
</name>






<abstract lang="eng">We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2010</dateIssued><place><placeTerm type="text">Dakar, Senegal</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Logic for Programming, Artificial Intelligence, and Reasoning</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="eIssn">1611-3349</identifier>
  <identifier type="isbn">9783642175107</identifier>
  <identifier type="ISI">000309668000007</identifier><identifier type="doi">10.1007/978-3-642-17511-4_7</identifier>
<part><detail type="volume"><number>6355</number></detail><extent unit="pages">103-118</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. &lt;i&gt;Logic for Programming, Artificial Intelligence, and Reasoning&lt;/i&gt;. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-17511-4_7&quot;&gt;10.1007/978-3-642-17511-4_7&lt;/a&gt;</ama>
<ista>Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.</ista>
<apa>Blanc, R., Henzinger, T. A., Hottelier, T., &amp;#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &amp;#38; A. Voronkov (Eds.), &lt;i&gt;Logic for Programming, Artificial Intelligence, and Reasoning&lt;/i&gt; (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-17511-4_7&quot;&gt;https://doi.org/10.1007/978-3-642-17511-4_7&lt;/a&gt;</apa>
<ieee>R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in &lt;i&gt;Logic for Programming, Artificial Intelligence, and Reasoning&lt;/i&gt;, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.</ieee>
<mla>Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” &lt;i&gt;Logic for Programming, Artificial Intelligence, and Reasoning&lt;/i&gt;, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-17511-4_7&quot;&gt;10.1007/978-3-642-17511-4_7&lt;/a&gt;.</mla>
<chicago>Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In &lt;i&gt;Logic for Programming, Artificial Intelligence, and Reasoning&lt;/i&gt;, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-17511-4_7&quot;&gt;https://doi.org/10.1007/978-3-642-17511-4_7&lt;/a&gt;.</chicago>
<short>R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>10908</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-03-21T08:14:35Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-30T09:51:13Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
