<?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>Invariant synthesis for combined theories</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

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



<name type="personal">
  <namePart type="given">Dirk</namePart>
  <namePart type="family">Beyer</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">Ritankar</namePart>
  <namePart type="family">Majumdar</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Andrey</namePart>
  <namePart type="family">Rybalchenko</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>VMCAI: Verification, Model Checking and Abstract Interpretation</namePart>
</name>






<abstract lang="eng">We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of programmer-specified invariant templates, our algorithm reduces the invariant synthesis problem to a sequence of arithmetic constraint satisfaction queries. Since the combination of linear arithmetic and uninterpreted functions is a widely applied predicate domain for program verification, our algorithm provides a powerful tool to statically and automatically reason about program correctness. The algorithm can also be used for the synthesis of invariants over arrays and set data structures, because satisfiability questions for the theories of sets and arrays can be reduced to the theory of linear arithmetic with uninterpreted functions. We have implemented our algorithm and used it to find invariants for a low-level memory allocator written in C.</abstract>

<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2007</dateIssued>
</originInfo>



<relatedItem type="host"><identifier type="doi">10.1007/978-3-540-69738-1_27</identifier>
<part><detail type="volume"><number>4349</number></detail><extent unit="pages">378 - 394</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<apa>Beyer, D., Henzinger, T. A., Majumdar, R., &amp;#38; Rybalchenko, A. (2007). Invariant synthesis for combined theories (Vol. 4349, pp. 378–394). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Springer. &lt;a href=&quot;https://doi.org/10.1007/978-3-540-69738-1_27&quot;&gt;https://doi.org/10.1007/978-3-540-69738-1_27&lt;/a&gt;</apa>
<chicago>Beyer, Dirk, Thomas A Henzinger, Ritankar Majumdar, and Andrey Rybalchenko. “Invariant Synthesis for Combined Theories,” 4349:378–94. Springer, 2007. &lt;a href=&quot;https://doi.org/10.1007/978-3-540-69738-1_27&quot;&gt;https://doi.org/10.1007/978-3-540-69738-1_27&lt;/a&gt;.</chicago>
<ista>Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. 2007. Invariant synthesis for combined theories. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 4349, 378–394.</ista>
<ama>Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. Invariant synthesis for combined theories. In: Vol 4349. Springer; 2007:378-394. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-540-69738-1_27&quot;&gt;10.1007/978-3-540-69738-1_27&lt;/a&gt;</ama>
<ieee>D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Invariant synthesis for combined theories,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, vol. 4349, pp. 378–394.</ieee>
<mla>Beyer, Dirk, et al. &lt;i&gt;Invariant Synthesis for Combined Theories&lt;/i&gt;. Vol. 4349, Springer, 2007, pp. 378–94, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-540-69738-1_27&quot;&gt;10.1007/978-3-540-69738-1_27&lt;/a&gt;.</mla>
<short>D. Beyer, T.A. Henzinger, R. Majumdar, A. Rybalchenko, in:, Springer, 2007, pp. 378–394.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>4572</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:09:32Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2021-01-12T07:59:48Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
