Right-Universality of Visibly Pushdown Automata - Archive ouverte HAL Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2013

Right-Universality of Visibly Pushdown Automata

Véronique Bruyère
  • Function : Author
  • PersonId : 941082
Marc Ducobu
  • Function : Author
  • PersonId : 941083


Visibly pushdown automata (VPAs) express properties on structures with a nesting relation such as program traces with nested method calls. In the context of runtime verification, we are interested in the following problem: given u, the beginning of a program trace, and A, a VPA expressing a property to be checked on this trace, can we ensure that any extension uv of u will be accepted by A? We call this property right-universality w.r.t. u. We propose an online algorithm detecting at the earliest position of the trace, whether this trace is accepted by A. The decision problem associated with right-universality is ExpTime-complete. Our algorithm uses antichains and other optimizations, in order to avoid the exponential blow-up in most cases. This is confirmed by promising experiments conducted on a prototype implementation.
Fichier principal
Vignette du fichier
rightuniv-RV13-long.pdf (318.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00946193 , version 1 (13-02-2014)



Véronique Bruyère, Marc Ducobu, Olivier Gauwin. Right-Universality of Visibly Pushdown Automata. 4th International Conference on Runtime Verification, Sep 2013, Rennes, France. pp.76-93, ⟨10.1007/978-3-642-40787-1_5⟩. ⟨hal-00946193⟩


108 View
259 Download



Gmail Facebook X LinkedIn More