Conference paper Open Access

Exploratory Analysis of the Performance of a Configurable CEGAR Framework

Hajdu, Ákos; Micskei, Zoltán


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.291895</identifier>
  <creators>
    <creator>
      <creatorName>Hajdu, Ákos</creatorName>
      <givenName>Ákos</givenName>
      <familyName>Hajdu</familyName>
      <affiliation>Budapest University of Technology and Economics</affiliation>
    </creator>
    <creator>
      <creatorName>Micskei, Zoltán</creatorName>
      <givenName>Zoltán</givenName>
      <familyName>Micskei</familyName>
      <affiliation>Budapest University of Technology and Economics</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Exploratory Analysis of the Performance of a Configurable CEGAR Framework</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2017</publicationYear>
  <subjects>
    <subject>formal verification</subject>
    <subject>cegar</subject>
    <subject>data analysis</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2017-01-30</date>
  </dates>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/291895</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="ISBN" relationType="IsPartOf">978-963-313-243-2</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/minisy17</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-sa/4.0/legalcode">Creative Commons Attribution Share Alike 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;Formal verification techniques can check the correctness of systems in a mathematically precise way. However, their computational complexity often prevents their successful application. The counterexample-guided abstraction refinement (CEGAR) algorithm aims to overcome this problem by automatically building abstractions for the system to reduce its complexity. Previously, we developed a generic CEGAR framework, which incorporates many configurations of the algorithm. In this paper we focus on an exploratory analysis of our framework. We identify parameters of the systems and algorithm configurations, overview some possible analysis methods and present preliminary results. We show that different variants are more efficient for certain tasks and we also describe how the properties of the system and parameters of the algorithm affect the success of verification.&lt;/p&gt;</description>
  </descriptions>
</resource>
67
27
views
downloads
All versions This version
Views 6767
Downloads 2727
Data volume 7.4 MB7.4 MB
Unique views 6767
Unique downloads 2727

Share

Cite as