2005 · 199 citations · 13 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSoftware EngineeringFinite AutomataModel CheckingRuntime SystemsSpecification LanguagesTemporal LogicVerificationAutomata In Formal VerificationBüchi AutomataFinite Automata TheoryLinear Temporal LogicRuntime AnalysisRuntime VerificationTemporal Logic SpecificationTemporal Verification
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 finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Buchi 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.
13
E. M. Clarke, Orna Grümberg, D. Long · 1996 · 6.9K citations
Introduction to automata theory, languages, and computation
Computer Languages · 1980 · 6.9K citations
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
Willem Visser, Klaus Havelund, Guillaume Brat et al. · Automated Software Engineering · 2003 · 1.4K citations