Articles dans des revues avec comité de lecture (167)
  1. 89. Classen, A., Heymans, P., Legay, A., & Raskin, J.-F. (2010). Model Checking lots of Systems: Efficient Verification of Temporal Properties in Software Product Lines. Proceedings - International Conference on Software Engineering, 335-344.
  2. 90. Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., & Torunxzyk, S. (2010). Energy and Mean-Payoff Games with Imperfect Information. Lecture notes in computer science, 6247, 260-274. doi:10.1007/978-3-642-15205-4_22
  3. 91. Classen, A., Heymans, P., Schobbens, P.-Y., Legay, A., & Raskin, J.-F. (2010). Model checking lots of systems: Efficient verification of temporal properties in software product lines. Proceedings - International Conference on Software Engineering, 1, 335-344. doi:10.1145/1806799.1806850
  4. 92. Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2010). Generalized mean-payoff and energy games. Leibniz international proceedings in informatics, 8, 505-516. doi:10.4230/LIPIcs.FSTTCS.2010.505
  5. 93. Ganty, P., Maquet, N., & Raskin, J.-F. (2010). Fixpoint Guided Abstraction for Alternating Automata. Theoretical computer science, 38-39, 3444-3459.
  6. 94. Di Giampaolo, B., Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2010). Safraless Procedures for Timed Specifications. Lecture notes in computer science, 6246, 2-22. doi:10.1007/978-3-642-15297-9_2
  7. 95. Doyen, L., & Raskin, J.-F. (2010). Antichain algorithms for finite automata. Lecture notes in computer science, 6015, 2-22. doi:10.1007/978-3-642-12002-2_2
  8. 96. Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., & Talbot, J.-M. (2010). Properties of Visibly Pushdown Transducers (MFCS). Lecture notes in computer science, 6281.
  9. 97. Cassez, F. F., Jessen, J. J., Larsen, K. G., Raskin, J.-F., & Reynier, P.-A. (2009). Automatic synthesis of robust and optimal controllers - An industrial case study. Lecture notes in computer science, 5469, 90-104. doi:10.1007/978-3-642-00602-9_7
  10. 98. Ganty, P., Maquet, N., & Raskin, J.-F. (2009). Fixpoint guided abstraction refinement for alternating automata. Lecture notes in computer science, 5642 LNCS, 155-164. doi:10.1007/978-3-642-02979-0_19
  11. 99. Filiot, E., Jin, N., & Raskin, J.-F. (2009). An antichain algorithm for LTL realizability. Lecture notes in computer science, 5643 LNCS, 263-277. doi:10.1007/978-3-642-02658-4_22
  12. 100. Doyen, L., & Raskin, J.-F. (2009). Improved Algorithms for the Automata-Based Approach to Model-Checking. Logical methods in computer science, 5(1), 1-20.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>