Publikation:

Ultimate Automizer and the Search for Perfect Interpolants : (Competition Contribution)

Vorschaubild

Dateien

Heizmann_2-1npawkfevwrnu3.pdf
Heizmann_2-1npawkfevwrnu3.pdfGröße: 166.49 KBDownloads: 227

Datum

2018

Autor:innen

Heizmann, Matthias
Chen, Yu-Fang
Dietsch, Daniel
Greitschus, Marius
Hoenicke, Jochen
Li, Yong
Nutz, Alexander
Musa, Betim
Schindler, Tanja
et al.

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1npawkfevwrnu3
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-319-89963-3_30
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz

CC BY 4.0

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Bookpart

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

BEYER, Dirk, ed., Marieke HUISMAN, ed.. Tools and Algorithms for the Construction and Analysis of Systems : 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018. Cham: Springer International Publishing, 2018, pp. 447-451. Lecture Notes in Computer Science. 10806. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-89962-6. Available under: doi: 10.1007/978-3-319-89963-3_30

Zusammenfassung

Ultimate Automizer is a software verifier that generalizes proofs for traces to proofs for larger parts for the program. In recent years the portfolio of proof producers that are available to Ultimate has grown continuously. This is not only because more trace analysis algorithms have been implemented in Ultimate but also due to the continuous progress in the SMT community. In this paper we explain how Ultimate Automizer dynamically selects trace analysis algorithms and how the tool decides when proofs for traces are “good” enough for using them in the abstraction refinement.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Ultimate Automizer, Abstraction Refinement, Program Paths, Unsatisfiable Core, CEGAR Loop

Konferenz

TACAS: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, TACAS 2018, 14. Apr. 2018 - 20. Apr. 2018, Thessaloniki
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HEIZMANN, Matthias, Yu-Fang CHEN, Daniel DIETSCH, Marius GREITSCHUS, Jochen HOENICKE, Yong LI, Alexander NUTZ, Betim MUSA, Christian SCHILLING, Tanja SCHINDLER, 2018. Ultimate Automizer and the Search for Perfect Interpolants : (Competition Contribution). TACAS: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, TACAS 2018. Thessaloniki, 14. Apr. 2018 - 20. Apr. 2018. In: BEYER, Dirk, ed., Marieke HUISMAN, ed.. Tools and Algorithms for the Construction and Analysis of Systems : 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018. Cham: Springer International Publishing, 2018, pp. 447-451. Lecture Notes in Computer Science. 10806. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-89962-6. Available under: doi: 10.1007/978-3-319-89963-3_30
BibTex
@inproceedings{Heizmann2018Ultim-53644,
  year={2018},
  doi={10.1007/978-3-319-89963-3_30},
  title={Ultimate Automizer and the Search for Perfect Interpolants : (Competition Contribution)},
  number={10806},
  isbn={978-3-319-89962-6},
  issn={0302-9743},
  publisher={Springer International Publishing},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Tools and Algorithms for the Construction and Analysis of Systems : 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018},
  pages={447--451},
  editor={Beyer, Dirk and Huisman, Marieke},
  author={Heizmann, Matthias and Chen, Yu-Fang and Dietsch, Daniel and Greitschus, Marius and Hoenicke, Jochen and Li, Yong and Nutz, Alexander and Musa, Betim and Schilling, Christian and Schindler, Tanja}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53644">
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/53644/1/Heizmann_2-1npawkfevwrnu3.pdf"/>
    <dc:creator>Chen, Yu-Fang</dc:creator>
    <dc:contributor>Dietsch, Daniel</dc:contributor>
    <dc:creator>Heizmann, Matthias</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/53644/1/Heizmann_2-1npawkfevwrnu3.pdf"/>
    <dc:contributor>Nutz, Alexander</dc:contributor>
    <dc:contributor>Schilling, Christian</dc:contributor>
    <dc:contributor>Musa, Betim</dc:contributor>
    <dc:creator>Musa, Betim</dc:creator>
    <dc:contributor>Hoenicke, Jochen</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-11T10:08:24Z</dcterms:available>
    <dc:contributor>Schindler, Tanja</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-11T10:08:24Z</dc:date>
    <dc:creator>Nutz, Alexander</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53644"/>
    <dc:contributor>Li, Yong</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
    <dc:contributor>Greitschus, Marius</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Heizmann, Matthias</dc:contributor>
    <dc:contributor>Chen, Yu-Fang</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Li, Yong</dc:creator>
    <dc:creator>Dietsch, Daniel</dc:creator>
    <dc:language>eng</dc:language>
    <dcterms:title>Ultimate Automizer and the Search for Perfect Interpolants : (Competition Contribution)</dcterms:title>
    <dcterms:issued>2018</dcterms:issued>
    <dc:creator>Schindler, Tanja</dc:creator>
    <dc:creator>Schilling, Christian</dc:creator>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <dcterms:abstract xml:lang="eng">Ultimate Automizer is a software verifier that generalizes proofs for traces to proofs for larger parts for the program. In recent years the portfolio of proof producers that are available to Ultimate has grown continuously. This is not only because more trace analysis algorithms have been implemented in Ultimate but also due to the continuous progress in the SMT community. In this paper we explain how Ultimate Automizer dynamically selects trace analysis algorithms and how the tool decides when proofs for traces are “good” enough for using them in the abstraction refinement.</dcterms:abstract>
    <dc:creator>Hoenicke, Jochen</dc:creator>
    <dc:creator>Greitschus, Marius</dc:creator>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen