## Checking Finite Traces using Alternating Automata (2001)

Citations: | 38 - 4 self |

### BibTeX

@MISC{Finkbeiner01checkingfinite,

author = {Bernd Finkbeiner and Henny Sipma},

title = {Checking Finite Traces using Alternating Automata},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present three algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a future linear-time temporal logic formula. The three methods are all based on alternating automata, but traverse the automaton in different ways: depth-first, breadth-first, and backwards, respectively. All three methods have been implemented and experimental results are presented. We outline an extension to these algorithms that is applicable to ltl formulas containing both past and future operators.

### Citations

485 |
Automata on infinite objects
- Thomas
- 1988
(Show Context)
Citation Context ... is true at that state. The definitions of the past temporal operators remain unchanged for finite sequences of states. 2.2. Alternating Automata Automata on infinite words, also known as ω-automata (=-=Thomas, 1990-=-), are a convenient way to represent temporal formulas. For every linear temporal formula there exists an automaton on infinite words such that a sequence of states satisfies the temporal formula if a... |

393 |
Temporal verification of reactive systems: Safety
- Manna, Pnueli
- 1995
(Show Context)
Citation Context ...0, s1, . . .. Given a model σ, a state formula p and temporal formulas ϕ and ψ, we present an inductive definition for the notion of a formula ϕ holding at a position j ≥ 0 in σ, denoted by (σ, j)sϕ (=-=Manna and Pnueli, 1995-=-). 3 main.tex; 4/04/2003; 11:35; p.3s4 For a state formula: (σ, j)sp iff sj For the boolean connectives:sp, that is, p holds on state sj. (σ, j)sϕ ∧ ψ iff (σ, j)sϕ and (σ, j)sψ (σ, j)sϕ ∨ ψ iff (σ, j)... |

222 | An Automata-Theoretic Approach to Linear Temporal Logic, in \Logics for Concurrency { Structure versus Automata
- Vardi
- 1996
(Show Context)
Citation Context ... an efficient data structure for many problems in the specification and verification of reactive systems. Because of their succinctness they are a convenient way to represent temporal specifications (=-=Vardi, 1996-=-; Vardi, 1997). They also have been commonly used as a basis for static verification (Vardi, 1995). In this paper we show how alternating automata can be used in the verification of individual traces,... |

82 | Automata on in objects - Thomas - 1990 |

76 | Using runtime analysis to guide model checking of java programs - Havelund - 2000 |

72 | Runtime assurance based on formal specifications
- Lee, Kannan, et al.
- 1999
(Show Context)
Citation Context ...pic was initiated (Havelund and Rosu, 2001; Havelund and Rosu, 2002a) as satellite workshops of the International Conference on Computer Aided Verification. Recent work includes the MaC architecture (=-=Lee et al., 1999-=-), which provides both program instrumentation and runtime checking, given a temporal specification. A prototype implementation, Java-Mac (Kim et al., 2001), demonstrates the architecture for Java pro... |

41 | Java-MaC: a run-time assurance tool for Java programs - Kim, Kannan, et al. - 2001 |

31 | Temporal Veri of Reactive Systems: Safety - Manna, Pnueli - 1995 |

25 | The Temporal Rover and ATG - Drusinsky |

24 | Temporal Logic Query Checking - Bruns, Godefroid - 2001 |

23 | Alternating automata and program verification
- Vardi
- 1995
(Show Context)
Citation Context ...systems. Because of their succinctness they are a convenient way to represent temporal specifications (Vardi, 1996; Vardi, 1997). They also have been commonly used as a basis for static verification (=-=Vardi, 1995-=-). In this paper we show how alternating automata can be used in the verification of individual traces, also known as runtime verification. In our approach, alternating automata are used as an interme... |

16 | Verifying temporal properties of reactive systems: A step tutorial - Bjorner, Browne, et al. - 1999 |

13 | Synthesizing Monitors for Safety Properties”. In Tools and Algorithms for Construction and Analysis of Systems (TACAS’02 - Havelund, Rosu - 2002 |

12 | Testing Linear Temporal Logic Formulae on Finite Execution Traces - Havelund, Rosu - 2001 |

12 |
Specification and Verification of Concurrent Programs by ∀-automata
- Manna, Pnueli
- 1987
(Show Context)
Citation Context ...a particular temporal formula, we can check whether it is accepted by the corresponding automaton. Alternating automata (Vardi, 1996) are a generalization of nondeterministic automata and ∀-automata (=-=Manna and Pnueli, 1987-=-). Nondeterministic automata have an existential flavor: a word is accepted if it is accepted by some path through the automaton. ∀-automata, on the other hand have a universal flavor: a word is accep... |

11 | Synthesizing dynamic programming algorithms from linear temporal logic formulae - Rosu, Havelund - 2001 |

5 | Alternating automata: Checking truth and validity for temporal logics - Vardi - 1997 |

3 | Speci and veri of concurrent programs by 8-automata - Manna, Pnueli - 1987 |

3 | Alternating the temporal picture for safety - Manna, Sipma - 2000 |

2 | Testing linear temporal logic formulae on execution traces - Havelund, Rosu - 2000 |

1 | 2002, ‘Collecting Statistics over Runtime Executions - Finkbeiner, Sankaranarayanan, et al. |

1 | eds.): 2001, ‘Runtime Verification 2001 - Havelund, Rosu |

1 | eds.): 2002a, ‘Runtime Verification 2001 - Havelund, Rosu |

1 | Sipma: 2000, ‘Alternating the Temporal Picture for Safety - Manna, B |

1 | Havelund: 2001, ‘Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae - Ro¸su, K |