| Abstraction and counterexample-guided refinement in model checking of hybrid systems E Clarke, A Fehnker, Z Han, B Krogh, J Ouaknine, O Stursberg, ... International journal of foundations of computer science 14 (04), 583-604, 2003 | 266 | 2003 |
| On the decidability of metric temporal logic J Ouaknine, J Worrell 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 188-197, 2005 | 262 | 2005 |
| Sudoku as a SAT Problem. I Lynce, J Ouaknine AI&M, 2006 | 249 | 2006 |
| State/event-based software model checking S Chaki, EM Clarke, J Ouaknine, N Sharygina, N Sinha International Conference on Integrated Formal Methods, 128-147, 2004 | 240 | 2004 |
| Some recent results in metric temporal logic J Ouaknine, J Worrell International Conference on Formal Modeling and Analysis of Timed Systems, 1-13, 2008 | 221 | 2008 |
| Deciding bit-vector arithmetic with abstraction RE Bryant, D Kroening, J Ouaknine, SA Seshia, O Strichman, B Brady International Conference on Tools and Algorithms for the Construction and …, 2007 | 206 | 2007 |
| Completeness and complexity of bounded model checking E Clarke, D Kroening, J Ouaknine, O Strichman International Workshop on Verification, Model Checking, and Abstract …, 2004 | 200 | 2004 |
| Positivity problems for low-order linear recurrence sequences J Ouaknine, J Worrell Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014 | 178 | 2014 |
| On the decidability and complexity of metric temporal logic over finite words J Ouaknine, J Worrell Logical Methods in Computer Science 3, 2007 | 171 | 2007 |
| Nets with tokens which carry data R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell Fundamenta Informaticae 88 (3), 251-274, 2008 | 159 | 2008 |
| On the language inclusion problem for timed automata: Closing a decidability gap J Ouaknine, J Worrell Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 151 | 2004 |
| Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell International Conference on Concurrency Theory, 235-249, 2011 | 134 | 2011 |
| Reachability in succinct and parametric one-counter automata C Haase, S Kreutzer, J Ouaknine, J Worrell International Conference on Concurrency Theory, 369-383, 2009 | 130 | 2009 |
| Decision problems for linear recurrence sequences J Ouaknine, J Worrell International Workshop on Reachability Problems, 21-28, 2012 | 112 | 2012 |
| Online monitoring of metric temporal logic HM Ho, J Ouaknine, J Worrell International conference on runtime verification, 178-192, 2014 | 108 | 2014 |
| On metric temporal logic and faulty Turing machines J Ouaknine, J Worrell International Conference on Foundations of Software Science and Computation …, 2006 | 107 | 2006 |
| Efficient verification of sequential and concurrent C programs S Chaki, E Clarke, A Groce, J Ouaknine, O Strichman, K Yorav Formal Methods in System Design 25 (2), 129-166, 2004 | 104 | 2004 |
| Axioms for probability and nondeterminism M Mislove, J Ouaknine, J Worrell Electronic Notes in Theoretical Computer Science 96, 7-28, 2004 | 98 | 2004 |
| Ultimate positivity is decidable for simple linear recurrence sequences J Ouaknine, J Worrell International Colloquium on Automata, Languages, and Programming, 330-341, 2014 | 97 | 2014 |
| On the Positivity Problem for Simple Linear Recurrence Sequences, J Ouaknine, J Worrell International Colloquium on Automata, Languages, and Programming, 318-329, 2014 | 94 | 2014 |
