Automated repair for timed systems

Kölbl, Martin; Leue, Stefan; Wies, Thomas

Automated repair for timed systems

Dateien

Koelbl_2-1gelmzvrdev3s7.pdfGröße: 2.46 MBDownloads: 3

Datum

2021

Autor:innen

Kölbl, Martin

Leue, Stefan

Wies, Thomas

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Formal Methods in System Design. Springer. 2021, 59, pp. 136-169. ISSN 0925-9856. eISSN 1572-8102. Available under: doi: 10.1007/s10703-022-00397-5

Zusammenfassung

We present algorithms and techniques for the repair of timed system models, given as networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic traces (TDTs) that are computed by real-time model checking tools, such as UPPAAL, when they detect the violation of a timed safety property. We present an encoding of TDTs in linear real arithmetic and use the MaxSMT capabilities of the SMT solver Z3 to suggest a minimal number of possible syntactic repairs of the analyzed model. The suggested repairs include modified values for clock bounds in location invariants and transition guards, adding or removing clock resets, etc. We then present an admissibility criterion, called functional equivalence, which ensures that the proposed repair preserves the functional behavior of the considered NTA. We discuss a proof-of-concept tool called TarTar that we have developed, implementing the repair and admissibility analysis, and give insights into its design and architecture. We evaluate the proposed repair technique on faulty mutations generated from a diverse suite of case studies taken from the literature. We show that TarTar can admissibly repair for 69–88% of the seeded errors in the considered system models.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

KÖLBL, Martin, Stefan LEUE, Thomas WIES, 2021. Automated repair for timed systems. In: Formal Methods in System Design. Springer. 2021, 59, pp. 136-169. ISSN 0925-9856. eISSN 1572-8102. Available under: doi: 10.1007/s10703-022-00397-5

BibTex

@article{Kolbl2021Autom-58885,
  year={2021},
  doi={10.1007/s10703-022-00397-5},
  title={Automated repair for timed systems},
  volume={59},
  issn={0925-9856},
  journal={Formal Methods in System Design},
  pages={136--169},
  author={Kölbl, Martin and Leue, Stefan and Wies, Thomas}
}

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/58885">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-10-24T13:46:10Z</dc:date>
    <dcterms:abstract xml:lang="eng">We present algorithms and techniques for the repair of timed system models, given as networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic traces (TDTs) that are computed by real-time model checking tools, such as UPPAAL, when they detect the violation of a timed safety property. We present an encoding of TDTs in linear real arithmetic and use the MaxSMT capabilities of the SMT solver Z3 to suggest a minimal number of possible syntactic repairs of the analyzed model. The suggested repairs include modified values for clock bounds in location invariants and transition guards, adding or removing clock resets, etc. We then present an admissibility criterion, called functional equivalence, which ensures that the proposed repair preserves the functional behavior of the considered NTA. We discuss a proof-of-concept tool called TarTar that we have developed, implementing the repair and admissibility analysis, and give insights into its design and architecture. We evaluate the proposed repair technique on faulty mutations generated from a diverse suite of case studies taken from the literature. We show that TarTar can admissibly repair for 69–88% of the seeded errors in the considered system models.</dcterms:abstract>
    <dcterms:issued>2021</dcterms:issued>
    <dc:language>eng</dc:language>
    <dc:creator>Wies, Thomas</dc:creator>
    <dc:contributor>Wies, Thomas</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Kölbl, Martin</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Leue, Stefan</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-10-24T13:46:10Z</dcterms:available>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <dcterms:title>Automated repair for timed systems</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Kölbl, Martin</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/58885"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/58885/1/Koelbl_2-1gelmzvrdev3s7.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/58885/1/Koelbl_2-1gelmzvrdev3s7.pdf"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja

Begutachtet

Unbekannt