<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rdf:RDF [
 <!ENTITY rdf 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'>
 <!ENTITY rdfs 'http://www.w3.org/2000/01/rdf-schema#'>
 <!ENTITY owl 'http://www.w3.org/2002/07/owl#'>
 <!ENTITY swrc 'http://swrc.ontoware.org/ontology#'>
 <!ENTITY xsd 'http://www.w3.org/2001/XMLSchema#'>
]>



<rdf:RDF
xml:base="http://www.bibsonomy.org/author/Voronkov"
 xmlns:rdf="&rdf;"
 xmlns:rdfs="&rdfs;"
 xmlns:owl="&owl;"
 xmlns:swrc="&swrc;"
 xmlns:xsd="&xsd;"
 >

 

<owl:Ontology rdf:about="">
  <rdfs:comment>BibSonomy publications for/author/Voronkov</rdfs:comment>
  <owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/>
</owl:Ontology>
  <rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27a25264408a57ece5dc2fe1b502e58fc/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>LPAR</swrc:booktitle><swrc:crossref>conf/lpar/2000</swrc:crossref><swrc:pages>179-188</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>A PVS Proof Obligation Generator for Lustre Programs.</swrc:title><swrc:volume>1955</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-05 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://link.springer.de/link/service/series/0558/bibs/1955/19550179.htm"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-05"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Cécile Canovas-Dumas" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Paul Caspi" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Michel Parigot" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23243e0f0682be8e5360b3bd3eb932077/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>142-156</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Combining Equational Tree Automata over AC and ACI Theories.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_10"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Joe Hendrix" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hitoshi Ohsaki" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/222f49e4520f49014905317d2c02e9f13/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>48-62</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Finer Is Better: Abstraction Refinement for Rewriting Approximations.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_4"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Yohan Boichut" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Roméo Courbis" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Pierre-Cyrille Héam" /></rdf:_3>
  <rdf:_4><swrc:Person swrc:name="Olga Kouchnarenko" /></rdf:_4>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2741600ea98092d896add91a34d794ccf/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>351-365</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_24"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Sorin Stratulat" /></rdf:_1>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/280c304bddf149bd4e7f73b493911430c/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>306-320</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Confluence by Decreasing Diagrams.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_21"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Vincent van Oostrom" /></rdf:_1>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2659c7a380152a474c4ebb56ab55228f0/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>157-171</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Closure of Hedge-Automata Languages by Hedge Rewriting.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_11"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Florent Jacquemard" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Michaël Rusinowitch" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2899485bd6b8d56a66fc2e0af86d90628/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>246-260</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Nominal Unification from a Higher-Order Perspective.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_17"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Jordi Levy" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Mateu Villaret" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d609161e99f684c47e5aca276e8ec92b/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>172-186</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>On Normalisation of Infinitary Combinatory Reduction Systems.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_12"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Jeroen Ketema" /></rdf:_1>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/266edd209490a711e5c15936b03ee8b21/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>366-380</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Deciding Innermost Loops.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_25"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="René Thiemann" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Jürgen Giesl" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Peter Schneider-Kamp" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/249df67775a62f3154ff18ca0ce4df60e/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>RTA</swrc:booktitle><swrc:crossref>conf/rta/2008</swrc:crossref><swrc:pages>63-78</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>A Needed Rewriting Strategy for Data-Structures with Pointers.</swrc:title><swrc:volume>5117</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-08-02 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-70590-1_5"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-70588-8"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-08-02"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Rachid Echahed" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Nicolas Peltier" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Andrei Voronkov" /></rdf:_1>
  </rdf:Seq>
</swrc:editor></rdf:Description>
</rdf:RDF>