Zur Kurzanzeige

dc.contributor.authorKöhnen, Christoph
dc.contributor.editorKönig-Ries, Birgitta
dc.contributor.editorScherzinger, Stefanie
dc.contributor.editorLehner, Wolfgang
dc.contributor.editorVossen, Gottfried
dc.date.accessioned2023-02-23T14:00:24Z
dc.date.available2023-02-23T14:00:24Z
dc.date.issued2023
dc.identifier.isbn978-3-88579-725-8
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/40389
dc.description.abstractJSON Schema is a schema language for the popular data exchange format JSON. This paper introduces an approach to convert regular expressions, which appear in ECMA-262 syntax in JSON Schema, into an alternative syntax such that they may be compiled to finite-state automata.This is a step towards generating witnesses, i.e., JSON instances which are valid w.r.t. the given JSON Schema specification. Specifically, we address the challenge that the ECMA-262 pattern syntax uses anchor symbols to mark the beginning and end of a word, which is not compatible with available libraries for automata manipulation. We implement an algorithm proposed by Dominik Freydenberger to convert regular expressions into brics syntax. We show that we successfully address over 97% of the patterns found in a collection of thousands of JSON Schema specifications collected from GitHub.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofBTW 2023
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-331
dc.titleWitness Generation for JSON Schema Patternsen
dc.typeText/Conference Paper
dc.identifier.doi10.18420/BTW2023-79
gi.conference.locationDresden, Germany
gi.conference.date06.-10. März 2023
gi.citation.startPage1113
gi.citation.endPage1119
gi.citation.publisherPlaceBonn


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige