Collecting Statistics Over Runtime Executions

Authors:
Bernd Finkbeiner;Sriram Sankaranarayanan;Henny B. Sipma
Affiliations:
Aff1 Aff2;Computer Science Department, Stanford University, Stanford, USA 94305;Computer Science Department, Stanford University, Stanford, USA 94305
Venue:
Formal Methods in System Design
Year:
2005

Citing 16
Cited 4

Quantitative temporal reasoning

Real-Time Systems
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
Random sampling techniques for space efficient online computation of order statistics of large datasets

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Alternation

Journal of the ACM (JACM)
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

Formal Methods in System Design
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Min-max computation tree logic

Artificial Intelligence
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
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
Gprof: A call graph execution profiler

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
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

Simulation-based verification using Temporally Attributed Boolean Logic

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Statistical runtime checking of probabilistic properties

RV'07 Proceedings of the 7th international conference on Runtime verification
TRACECONTRACT: a scala DSL for trace analysis

FM'11 Proceedings of the 17th international conference on Formal methods
Runtime verification with state estimation

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics over runtime executions of a program we can answer complex queries, such as "what is the average number of packet transmissions'' in a communication protocol, or "how often does a particular process enter the critical section while another process remains waiting'' in a mutual exclusion algorithm. To decouple the evaluation strategy of the queries from the definition of the temporal operators, we introduce algebraic alternating automata as an automata-based intermediate representation. Algebraic alternating automata are an extension of alternating automata that produce a value instead of acceptance or rejection for each trace. Based on the translation of the formulas from the query language to algebraic alternating automata, we obtain a simple and efficient query evaluation algorithm. The approach is illustrated with examples and experimental results.