Studienarbeit STUD-2270

Bibliograph.
Daten
Decker, Normann: A Continuous Truth Domain for Runtime Verification.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Studienarbeit Nr. 2270 (2010).
39 Seiten, englisch.
CR-Klassif.F.3.1 (Specifying and Verifying and Reasoning about Programs)
D.2.4 (Software Engineering Software/Program Verification)
Kurzfassung

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.

Volltext und
andere Links
PDF (324821 Bytes)
Zugriff auf studentische Arbeiten aufgrund vorherrschender Datenschutzbestimmungen nur innerhalb der Fakultät möglich
Abteilung(en)Universität Stuttgart, Institut für Formale Methoden der Informatik, Theoretische Informatik
BetreuerBollig, Benedikt
Eingabedatum18. November 2010
   Publ. Informatik