Temporal Assertions with Parametrized Propositions*

Authors:
Volker Stolz
Affiliations:
-
Venue:
Journal of Logic and Computation
Year:
2010

Citing 0
Cited 4

Policy monitoring in first-order temporal logic

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Data-centric property formulation for passive testing of communication protocols

ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
A formal data-centric approach for passive testing of communication protocols

IEEE/ACM Transactions on Networking (TON)
Using passive testing based on symbolic execution and slicing techniques: Application to the validation of communication protocols

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend our previous approach to run-time verification of a single finite path against a formula in next-free Linear-Time Logic (LTL) with free variables and quantification. We discuss the design space of quantification and introduce a binary operator that binds values based on the current state. The binding semantics of propositions containing quantified variables is a pure top-down evaluation. The alternating binding automaton corresponding to a formula is evaluated in a breadth-first manner, allowing us to detect refuted formulae during execution.