Automata-Based Verification of Temporal Properties on Running Programs
نویسندگان
چکیده
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Büchi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.
منابع مشابه
Dynamic Sync-Programs for Modular Verification of Biological Systems
We propose dynamic sync-programs, a bio-inspired automata-based formalism for the description and the modular verification of properties of biological systems. The formalism allows entities to be created dynamically, in particular by other already running entities, as it often happens in biological systems. Moreover, multiple copies of the same entities can be present at the same time in a syst...
متن کاملMonitoring Execution Traces using Metric Alternating Automata
We present an automata based verification framework to monitor a running system against a high level specification. Our framework includes specification formalisms to express system properties and verification algorithms to check an execution trace of a system against the intended behavior. Linear Temporal Logic (LTL) is a widely used specification language to express temporal properties of a s...
متن کاملFrom First-order Temporal Logic to Parametric Trace Slicing
Parametric runtime verification is the process of verifying properties of execution traces of (data carrying) events produced by a running system. This paper considers the relationship between two widely-used specification approaches to parametric runtime verification: trace slicing and first-order temporal logic. This work is a first step in understanding this relationship. We introduce a tech...
متن کاملTimed Automata Approach to Can Verification
This article deals with verification of real time distributed system focusing on CAN model by timed automata and specification of verified properties by temporal logic. Such system, based on several CPUs, consists of an application SW running under real-time operating system (e.g. OSEK) and using standard broadcast communications based on the Controller Area Network (CAN). The crucial problem i...
متن کاملGames in Verification
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over some alphabet. Thus,programs and specificationscan be viewed as descriptions of languagesover some alphabet....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001