April 1, 2019 Conference paper Open Access

Raskin, Mikhail; Welzel, Christoph

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.2633990</identifier>
  <creators>
    <creator>
      <creatorName>Raskin, Mikhail</creatorName>
      <givenName>Mikhail</givenName>
      <familyName>Raskin</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-6660-5673</nameIdentifier>
      <affiliation>TU Munich</affiliation>
    </creator>
    <creator>
      <creatorName>Welzel, Christoph</creatorName>
      <givenName>Christoph</givenName>
      <familyName>Welzel</familyName>
      <affiliation>TU Munich</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Working with first-order proofs and provers</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2019</publicationYear>
  <subjects>
    <subject>automated reasoning</subject>
    <subject>computer-aided proofs</subject>
    <subject>first-order logic</subject>
    <subject>verification</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2019-04-01</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/2633990</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="arXiv" relationType="IsIdenticalTo">arXiv:1904.01079</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.2633989</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/els</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode">Creative Commons Attribution Non Commercial No Derivatives 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&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;</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/100010661</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/787367/">787367</awardNumber>
      <awardTitle>Parametrized Verification and Synthesis</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>