Conference paper Open Access

Working with first-order proofs and provers

Raskin, Mikhail; Welzel, Christoph


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">automated reasoning</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">computer-aided proofs</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">first-order logic</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">verification</subfield>
  </datafield>
  <controlfield tag="005">20200120164934.0</controlfield>
  <controlfield tag="001">2633990</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">1–2 April, 2019</subfield>
    <subfield code="g">ELS 2019</subfield>
    <subfield code="a">12-th European Lisp Symposium</subfield>
    <subfield code="c">Genova, Italy</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">TU Munich</subfield>
    <subfield code="a">Welzel, Christoph</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">348243</subfield>
    <subfield code="z">md5:3e0c889375c79d1c8c6da7ec7f041852</subfield>
    <subfield code="u">https://zenodo.org/record/2633990/files/first-order-proof-handling.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">https://european-lisp-symposium.org/2019/</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-04-01</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-els</subfield>
    <subfield code="o">oai:zenodo.org:2633990</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">TU Munich</subfield>
    <subfield code="0">(orcid)0000-0002-6660-5673</subfield>
    <subfield code="a">Raskin, Mikhail</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Working with first-order proofs and provers</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-els</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">787367</subfield>
    <subfield code="a">Parametrized Verification and Synthesis</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution Non Commercial No Derivatives 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming practical. Currently, the most powerful automated proof search tools use first-order logic while popular interactive proof assistants use higher-order logic.&lt;br&gt;
&lt;br&gt;
We present our work-in-progress set of tools that aim to eventually provide a usable first-order logic computer-assisted proof environment.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">arxiv</subfield>
    <subfield code="i">isIdenticalTo</subfield>
    <subfield code="a">arXiv:1904.01079</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.2633989</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.2633990</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
111
47
views
downloads
All versions This version
Views 111111
Downloads 4747
Data volume 16.4 MB16.4 MB
Unique views 104104
Unique downloads 4545

Share

Cite as