Articles dans des revues avec comité de lecture (185)
173.
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.
174.
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.
175.
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
176.
Delzanno, G., & Raskin, J.-F. (2000). Symbolic Representation of Upward Closed Sets. Lecture notes in computer science, 1785, 426-440.
177.
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.
178.
Henzinger, T. A., & Raskin, J.-F. (2000). Robust Undecidability of Timed and Hybrid Systems. Lecture notes in computer science, 1790, 145-159.
179.
Raskin, J.-F., & Schobbens, P.-Y. (1999). Models Generation of a Fictitious Clock Real-Time Logic Using Sharing-Trees. Electronic Notes in Theoretical Computer Science, 23(2), 131-149.
180.
Raskin, J.-F., & Schobbens, P.-Y. (1999). The Logic of “Initially” and “Next”: Completeness and Complexity. Information processing letters, 69(5), 221-225.
181.
Raskin, J.-F., & Schobbens, P.-Y. (1999). The Logic of Event Clocks: Decidability, Complexity and Expressiveness. Journal of automata, languages and combinatorics, 4(3), 247-284.
182.
Henzinger, T. A., Raskin, J.-F., & Schobbens, P.-Y. (1998). Axioms for Real-Time Logics. Lecture notes in computer science, 1466, 219-236.
183.
Henzinger, T. A., Raskin, J.-F., & Schobbens, P.-Y. (1998). The Regular Real-Time Languages. Lecture notes in computer science, 1443, 580-591.
184.
Raskin, J.-F., & Schobbens, P.-Y. (1997). State Clock Logic:: a decidable Real-Time Logic. Lecture notes in computer science, 1201, 31-47.