C
Christian Schallhart
Researcher at University of Oxford
Publications - 78
Citations - 3271
Christian Schallhart is an academic researcher from University of Oxford. The author has contributed to research in topics: Model checking & Test suite. The author has an hindex of 22, co-authored 78 publications receiving 2993 citations. Previous affiliations of Christian Schallhart include Technische Universität Darmstadt & Technische Universität München.
Papers
More filters
Proceedings ArticleDOI
On the Structure and Complexity of Rational Sets of Regular Languages
TL;DR: In this article, the authors show closure properties of general and finite regular languages (RSRLs) under common set theoretic operations, and prove complexity results for checking equivalence and inclusion of star-free RSRLs and for checking whether a regular language is a member of a general or star free RSRL.
Book ChapterDOI
DIADEM: Domains to Databases
TL;DR: All real estate offers, all airline flights, or all your local restaurants’ menus automatically collected from hundreds or thousands of agencies, travel agencies, or restaurants, presented as a single homogeneous dataset.
Proceedings ArticleDOI
Exploring the web with OXPath
TL;DR: The main features of the language are reviewed, a set-theoretic formal semantics for full OXPath is proposed, and a sophisticated memory management that minimizes page buffering is discussed.
Slope Testing for Activity Diagrams and Safety Critical Software
Andreas Holzer,Visar Januzaj,Stefan Kugele,Christian Schallhart,Michael Tautschnig,Helmut Veith,Boris Langer +6 more
TL;DR: A new methodology called slope testing is proposed where an abstract test suite is concretized covering the model to obtain a corresponding concrete test suite on the implementation to systematically expose the potential deficiencies in the mapping between model and code.
Journal ArticleDOI
Closure properties and complexity of rational sets of regular languages
TL;DR: This paper provides a systematic theoretical foundation for FQL test specifications, which are in fact rational sets of regular languages (RSRLs), and proves complexity results for equivalence, inclusion, and membership checking.