Ducobu, M. (2013). Antichains for QBF evaluation and VPA decision problems. Unpublished doctoral thesis, Université de Mons. Jury: . |
Ducobu, M. (26 September 2013). Right-Universality of Visibly Pushdown Automata. Paper presented at Runtime Verification, Rennes, France. |
Ducobu, M. (04 April 2013). Visibly Pushdown Automata: Universality and Inclusion via Antichains. Paper presented at 7th International Conference on Language and Automata Theory and Applications (LATA 2013), Bilbao, Spain. |
Bruyère, V., Ducobu, M., & Gauwin, O. (2013). Visibly Pushdown Automata: Universality and Inclusion via Antichains. Paper presented at Language and Automata Theory and Applications, Bilbao, Spain. |
Ducobu, M. (24 September 2012). Visibly pushdown automata on trees: universality and u-universality. Paper presented at CFV seminar, Bruxelles, Belgium. |
Ducobu, M. (12 September 2012). Visibly pushdown automata on trees: universality and u-universality. Paper presented at Mons Days of Theoretical Computer Science, Louvain-la-Neuve, Belgium. |
Bruyère, V., Ducobu, M., & Gauwin, O. (2012). Visibly pushdown automata on trees: universality and u-universality. Eprint/Working paper retrieved from https://orbi.umons.ac.be/20.500.12907/27348. |
![]() | Brihaye, T., Bruyère, V., Doyen, L., Ducobu, M., & Raskin, J.-F. (2011). Antichain-Based QBF Solving. Paper presented at Automated Technology for Verification and Analysis, Taipei, Taiwan. |
Ducobu, M. (05 April 2011). Antichain-based QBF Solving. Paper presented at Déjeuners Informatiques de l'UMONS, UMONS, Belgium. |
Ducobu, M. (22 March 2011). Antichain-based QBF solving. Poster session presented at Matinée des chercheurs, UMONS, Belgium. |
Ducobu, M. (11 February 2011). Antichain-based QBF solving. Paper presented at CFV seminar, Bruxelles, Belgium. |