We explore of use of the tool BeepBeep, a monitor for the temporal logic LTL-FO+, in interpreting assembly traces, focusing on security-related applications. LTL-FO+ is an extension of LTL, which includes first order quantification. We show that LTL-FO+ is a sufficiently expressive formalism to state a number of interesting program behaviors, and demonstrate experimentally that BeepBeep can eff...

The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called connguration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be ...

Propositional temporal logic is now well established, both in its theory and its utility for practical applications in computing. In contrast, predicate, or first-order, temporal logic has been less studied. Unpublished results of Lindström and Scott in the 1960s showed that even weak fragments of first-order temporal logic are highly undecidable, and these and later similar results (see, e.g.,...

Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear time temporal logic. However, metric properties of real time cannot be expressed in this logic. The simplest modalities with metric properties are “X will happen within units of time”. The extension of TL by all these modalities w...