<?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>Tree interpolation in Vampire</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</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">Ashutosh</namePart>
  <namePart type="family">Gupta</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">335E5684-F248-11E8-B48F-1D18A9856A87</identifier></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">Bernhard</namePart>
  <namePart type="family">Kragl</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">320FC952-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-7745-9117</description></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>



<name type="corporate">
  <namePart>Rigorous Systems Engineering</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2013_LPAR_Blanc.pdf">https://research-explorer.ista.ac.at/download/2237/7858/2013_LPAR_Blanc.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2013</dateIssued><place><placeTerm type="text">Stellenbosch, South Africa</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><identifier type="doi">10.1007/978-3-642-45221-5_13</identifier>
<part><detail type="volume"><number>8312</number></detail><extent unit="pages">173 - 181</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-45221-5_13&quot;&gt;10.1007/978-3-642-45221-5_13&lt;/a&gt;</ama>
<ista>Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.</ista>
<short>R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.</short>
<mla>Blanc, Régis, et al. &lt;i&gt;Tree Interpolation in Vampire&lt;/i&gt;. Vol. 8312, Springer, 2013, pp. 173–81, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-45221-5_13&quot;&gt;10.1007/978-3-642-45221-5_13&lt;/a&gt;.</mla>
<ieee>R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.</ieee>
<apa>Blanc, R., Gupta, A., Kovács, L., &amp;#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-45221-5_13&quot;&gt;https://doi.org/10.1007/978-3-642-45221-5_13&lt;/a&gt;</apa>
<chicago>Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-45221-5_13&quot;&gt;https://doi.org/10.1007/978-3-642-45221-5_13&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>2237</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:56:29Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2020-08-11T10:09:42Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
