Articles dans des revues avec comité de lecture (167)
  1. 149. Bruyère, V., & Raskin, J.-F. (2003). Real-time model-checking: Parameters everywhere. Lecture notes in computer science, 2914, 100-111.
  2. 150. Kremer, S., & Raskin, J.-F. (2003). A game-based verification of non-repudiation and fair exchange protocols. Journal of computer security, 11(3), 399-429.
  3. 151. Schobbens, P.-Y., Raskin, J.-F., & Henzinger, T. A. (2002). Axioms for real-time logics. Theoretical computer science, 274(1-2), 151-182. doi:10.1016/S0304-3975(00)00308-X
  4. 152. Kremer, S., & Raskin, J.-F. (2002). Game Analysis of Abuse-free Contract Signing. Proceedings - Computer Security Foundations Workshop, 206-222. doi:10.1109/CSFW.2002.1021817
  5. 153. Cassez, F. F., Henzinger, T. A., & Raskin, J.-F. (2002). A Comparison of Control Problems for Timed and Hybrid Systems. Lecture notes in computer science, 2289, 134-148. doi:10.1007/3-540-45873-5_13
  6. 154. Delzanno, G., Raskin, J.-F., & Van Begin, L. (2002). Towards the Automated Verification ofMulti-threaded Java Programs. Lecture notes in computer science, 2280, 173-187.
  7. 155. Delzanno, G., Raskin, J.-F., & Van Begin, L. (2002). Towards the automated verification of multithreaded Java programs. Lecture notes in computer science, 2280 LNCS, 173-187.
  8. 156. Kremer, S., & Raskin, J.-F. (2001). A Game-Based Verification of Non-Repudiation and Fair Exchange Protocols. Lecture notes in computer science, 2154, 551-565.
  9. 157. Delzanno, G., Raskin, J.-F., & Van Begin, L. (2001). Attacking Symbolic State Explosion. Lecture notes in computer science, 2102, 298-310. doi:10.1007/3-540-44585-4_28
  10. 158. Henzinger, T. A., & Raskin, J.-F. (2000). Robust Undecidability of Timed and Hybrid Systems. Lecture notes in computer science, 1790, 145-159.
  11. 159. Henzinger, T. A., Mang, F., Majumdar, R. R., & Raskin, J.-F. (2000). Abstract Interpretation of Game Properties. Lecture notes in computer science, 1824, 220-239.
  12. 160. Delzanno, G., & Raskin, J.-F. (2000). Symbolic Representation of Upward Closed Sets. Lecture notes in computer science, 1785, 426-440.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>