| Model checking lots of systems: efficient verification of temporal properties in software product lines A Classen, P Heymans, PY Schobbens, A Legay, JF Raskin Proceedings of the 32nd ACM/IEEE International Conference on Software …, 2010 | 445 | 2010 |
| Featured transition systems: Foundations for verifying variability-intensive systems and their application to LTL model checking A Classen, M Cordy, PY Schobbens, P Heymans, A Legay, JF Raskin IEEE Transactions on Software Engineering 39 (8), 1069-1089, 2012 | 314 | 2012 |
| Algorithms for omega-regular games with imperfect information K Chatterjee, L Doyen, TA Henzinger, JF Raskin International Workshop on Computer Science Logic, 287-302, 2006 | 297* | 2006 |
| A game-based verification of non-repudiation and fair exchange protocols S Kremer, JF Raskin International Conference on Concurrency Theory, 551-565, 2001 | 223 | 2001 |
| Antichains: A new algorithm for checking universality of finite automata M De Wulf, L Doyen, TA Henzinger, JF Raskin International Conference on Computer Aided Verification, 17-30, 2006 | 222 | 2006 |
| Acacia+, a tool for LTL synthesis A Bohy, V Bruyère, E Filiot, N Jin, JF Raskin Computer Aided Verification: 24th International Conference, CAV 2012 …, 2012 | 178 | 2012 |
| Antichains and compositional algorithms for LTL synthesis E Filiot, N Jin, JF Raskin Formal Methods in System Design 39, 261-296, 2011 | 176* | 2011 |
| The regular real-time languages TA Henzinger, JF Raskin, PY Schobbens Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998 | 175 | 1998 |
| Generalized mean-payoff and energy games K Chatterjee, L Doyen, TA Henzinger, JF Raskin arXiv preprint arXiv:1007.1669, 2010 | 167 | 2010 |
| Faster algorithms for mean-payoff games L Brim, J Chaloupka, L Doyen, R Gentilini, JF Raskin Formal methods in system design 38, 97-118, 2011 | 166 | 2011 |
| Almost ASAP semantics: From timed models to timed implementations M De Wulf, L Doyen, JF Raskin International Workshop on Hybrid Systems: Computation and Control, 296-310, 2004 | 160 | 2004 |
| An antichain algorithm for LTL realizability E Filiot, N Jin, JF Raskin Computer Aided Verification: 21st International Conference, CAV 2009 …, 2009 | 158 | 2009 |
| Expand, enlarge and check: New algorithms for the coverability problem of WSTS G Geeraerts, JF Raskin, L Van Begin Journal of Computer and system Sciences 72 (1), 180-203, 2006 | 127 | 2006 |
| Robust undecidability of timed and hybrid systems TA Henzinger, JF Raskin International Workshop on Hybrid Systems: Computation and Control, 145-159, 2000 | 121 | 2000 |
| The complexity of multi-mean-payoff and multi-energy games Y Velner, K Chatterjee, L Doyen, TA Henzinger, A Rabinovich, JF Raskin Information and Computation 241, 177-196, 2015 | 119 | 2015 |
| Towards the automated verification of multithreaded Java programs G Delzanno, JF Raskin, L Van Begin International Conference on Tools and Algorithms for the Construction and …, 2002 | 119 | 2002 |
| Game analysis of abuse-free contract signing S Kremer, JF Raskin Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, 206-220, 2002 | 116 | 2002 |
| Strategy synthesis for multi-dimensional quantitative objectives K Chatterjee, M Randour, JF Raskin CONCUR 2012–Concurrency Theory: 23rd International Conference, CONCUR 2012 …, 2012 | 115 | 2012 |
| On the optimal reachability problem of weighted timed automata P Bouyer, T Brihaye, V Bruyere, JF Raskin Formal Methods in System Design 31 (2), 135-175, 2007 | 108 | 2007 |
| A comparison of control problems for timed and hybrid systems F Cassez, TA Henzinger, JF Raskin International Workshop on Hybrid Systems: Computation and Control, 134-148, 2002 | 103 | 2002 |
Veronique BruyereUniversity of MonsVerified email at umons.ac.be
