Right-Universality of Visibly Pushdown Automata - Runtime Verification - page 93

[BJLW08] Benedikt, M., Jeffrey, A., Ley-Wild, R.: Stream Firewalling of XML Con-
straints. In: Proc. SIGMOD Conference, pp. 487-498. ACM-Press (2008)
[BHH + 08] Bouajjani, A., Habermehl, P., Holık, L., Touili, T., Vojnar, T.: Antichain-
based universality and inclusion testing over nondeterministic finite tree
automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS,
vol. 5148, pp. 57-67. Springer, Heidelberg (2008)
[BDG12] Bruyere, V., Ducobu, M., Gauwin, O.: Visibly pushdown automata on
trees: universality and u-universality, CoRR abs/1205.2841 (2012)
[BDG13] Bruyere, V., Ducobu, M., Gauwin, O.: Visibly pushdown automata: Uni-
versality and inclusion via antichains. In: Dediu, A.-H., Martın-Vide, C.,
Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 190-201. Springer,
Heidelberg (2013)
[BYBC10] Bultan, T., Yu, F., Betin-Can, A.: Modular verification of synchronization
with reentrant locks. In: Proc. MEMOCODE, pp. 59-68. IEEE Computer
Society (2010)
[CA07] Chaudhuri, S., Alur, R.: Instrumenting C programs with nested word mon-
itors. In: Bosnacki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595,
pp. 279-283. Springer, Heidelberg (2007)
[CDG + 07] Comon, H., Dauchet, M., Gilleron, R., Loding, C., Jacquemard, F., Lugiez,
D., Tison, S., Tommasi, M.: Tree automata techniques and applications
(2007), http://www.grappa.univ-lille3.fr/tata
[DDHR06] De Wulf, M., Doyen, L., Henzinger, T., Raskin, J.-F.: Antichains: A new
algorithm for checking universality of finite automata. In: Ball, T., Jones,
R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg
(2006)
[FJJ + 12] Fredrikson, M., Joiner, R., Jha, S., Reps, T., Porras, P., Saıdi, H., Yeg-
neswaran, V.: E cient runtime policy enforcement using counterexample-
guided abstraction refinement. In: Madhusudan, P., Seshia, S.A. (eds.)
CAV 2012. LNCS, vol. 7358, pp. 548-563. Springer, Heidelberg (2012)
[FKL13] Friedmann, O., Klaedtke, F., Lange, M.: Ramsey goes visibly pushdown. In:
Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013,
Part II. LNCS, vol. 7966, pp. 224-237. Springer, Heidelberg (2013)
[GN11] Gauwin, O., Niehren, J.: Streamable fragments of forward XPath. In:
Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.)
CIAA 2011. LNCS, vol. 6807, pp. 3-15. Springer, Heidelberg (2011)
[GNR08] Gauwin, O., Niehren, J., Roos, Y.: Streaming tree automata. Information
Processing Letters 109, 13-17 (2008)
[GNT09] Gauwin, O., Niehren, J., Tison, S.: Earliest query answering for determin-
istic nested word automata. In: Kutylowski, M., Charatonik, W., Gebala,
M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 121-132. Springer, Heidelberg
(2009)
[Glucose] Glucose, www.lri.fr/ ~ simon/?page=glucose
[RCB08] Rosu, G., Chen, F., Ball, T.: Synthesizing monitors for safety properties:
This time with calls and returns. In: Leucker, M. (ed.) RV 2008. LNCS,
vol. 5289, pp. 51-68. Springer, Heidelberg (2008)

[TO12] Nguyen, T.V., Ohsaki, H.: On model checking for visibly pushdown au-

tomata. In: Dediu, A.-H., Martın-Vide, C. (eds.) LATA 2012. LNCS,
vol. 7183, pp. 408-419. Springer, Heidelberg (2012)