Student Thesis STUD-2270

BibliographyDecker, Normann: A Continuous Truth Domain for Runtime Verification.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Student Thesis No. 2270 (2010).
39 pages, english.
CR-SchemaF.3.1 (Specifying and Verifying and Reasoning about Programs)
D.2.4 (Software Engineering Software/Program Verification)
Abstract

Specification formalisms like LTL specify properties for infinite traces whereas monitors only observe finite prefixes. These can be conclusive, however, in general they are not. Restricting monitors to only two possible conclusions is therefore inappropriate in many cases and known approaches distinguish only between a small number of verdicts. We extend the setting to an infinite, continuous domain that enables us to further discriminate runs and allows for more detailed appraisals in presence of inconclusive information. The concept of continuous space induces new notions of monitorability that we study and relate to well known classes.

Full text and
other links
PDF (324821 Bytes)
Access to students' publications restricted to the faculty due to current privacy regulations
Department(s)University of Stuttgart, Institute of Formal Methods in Computer Science, Theoretical Computer Science
Superviser(s)Bollig, Benedikt
Entry dateNovember 18, 2010
   Publ. Computer Science