Checking Finite Traces Using Alternating Automata

Authors:
Bernd Finkbeiner;Henny Sipma
Affiliations:
Computer Science Department, Stanford University, Stanford, CA 94305, USA. finkbeiner@cs.uni-sb.de;Computer Science Department, Stanford University, Stanford, CA 94305, USA. sipma@cs.stanford.edu
Venue:
Formal Methods in System Design
Year:
2004

Citing 12
Cited 18

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

Formal Methods in System Design
Using Runtime Analysis to Guide Model Checking of Java Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
The Temporal Rover and the ATG Rover

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Synthesizing Monitors for Safety Properties

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Specification and Verification of Concurrent Programs by forall-Automata

Temporal Logic in Specification
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Temporal Logic Query Checking

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Synthesizing Dynamic Programming Algorithms fromLinear Temporal Logic Formulae

Synthesizing Dynamic Programming Algorithms fromLinear Temporal Logic Formulae
Testing Linear Temporal Logic Formulae on Finite Execution Traces

Testing Linear Temporal Logic Formulae on Finite Execution Traces

Combining test case generation and runtime verification

Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Engineering of An Assertion-based PSLSimple-Verilog Dynamic Verifier by Alternating Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Statistical Model Checking in BioLab: Applications to the Automated Analysis of T-Cell Receptor Signaling Pathway

CMSB '08 Proceedings of the 6th International Conference on Computational Methods in Systems Biology
Run-Time Monitoring of Electronic Contracts

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Model Checking Merged Program Traces

Electronic Notes in Theoretical Computer Science (ENTCS)
LTL Path Checking Is Efficiently Parallelizable

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems

Autonomous Agents and Multi-Agent Systems
Temporal Assertions using AspectJ

Electronic Notes in Theoretical Computer Science (ENTCS)
Rule systems for run-time monitoring: from eagle to ruler

RV'07 Proceedings of the 7th international conference on Runtime verification
Optimized temporal monitors for SystemC

RV'10 Proceedings of the First international conference on Runtime verification
Runtime Verification for LTL and TLTL

ACM Transactions on Software Engineering and Methodology (TOSEM)
Past time LTL runtime verification for microcontroller binary code

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Tracechecks: defining semantic interfaces with temporal logic

SC'06 Proceedings of the 5th international conference on Software Composition
Combining time and frequency domain specifications for periodic signals

RV'11 Proceedings of the Second international conference on Runtime verification
Monitoring realizability

RV'11 Proceedings of the Second international conference on Runtime verification
Monitoring temporal information flow

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Optimized temporal monitors for SystemC

Formal Methods in System Design
Runtime verification of microcontroller binary code

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alternating automata have been commonly used as a basis for static verification of reactive systems. In this paper we show how alternating automata can be used in runtime verification. We present three algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a linear-time temporal logic formula. The three methods start from the same alternating automaton but traverse the automaton in different ways: depth-first, breadth-first, and backwards, respectively. We then show how an extension of these algorithms, that collects statistical data while verifying the execution trace, can be used for a more detailed analysis of the runtime behavior. All three methods have been implemented and experimental results are presented.