Temporal Assertions using AspectJ

TL;DR: In this paper, a three-valued semantics (with truth values true, false, inconclusive) is introduced as an adequate interpretation as to whether a partial observation of a running system meets an LTL or TLTL property.

TL;DR: A 3-valued semantics (true, false, inconclusive) for LTL and TLTL on finite traces is defined that resembles the infinite trace semantics in a suitable and intuitive manner.

TL;DR: The results show that metric first-order temporal logic can serve as an effective specification language for expressing and monitoring a wide variety of practically relevant system properties.

TL;DR: This chapter focuses specifically on checking execution traces against requirements formalized in terms of monitors, and shows on examples how such monitors can be written using aspect-oriented programming, exemplified by ASPECTJ.

TL;DR: In this article, the authors present a detailed overview of the Java Virtual Machine, including the internal structure of the class file format, the internal form of Fully Qualified Class and Interface names, and the implementation of new class instances.

TL;DR: A new tool, called Eraser, is described, for dynamically detecting data races in lock-based multithreaded programs, which uses binary rewriting techniques to monitor every shared-monory reference and verify that consistent locking behavior is observed.

TL;DR: Two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java programs to generate a set of warnings which can be used to guide a model checker, thereby reducing the search space.

TL;DR: An algorithm is presented which takes an LTL formula and generates an efficient dynamic programming algorithm which tests whether the LTL model is satisfied by a finite trace of events given as input.