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 | 255 | 2003 |

Sudoku as a SAT Problem. I Lynce, J Ouaknine AI&M, 2006 | 239 | 2006 |

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 | 238 | 2005 |

State/event-based software model checking S Chaki, EM Clarke, J Ouaknine, N Sharygina, N Sinha Integrated Formal Methods: 4th International Conference, IFM 2004 …, 2004 | 232 | 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 | 210 | 2008 |

Deciding bit-vector arithmetic with abstraction RE Bryant, D Kroening, J Ouaknine, SA Seshia, O Strichman, B Brady Tools and Algorithms for the Construction and Analysis of Systems: 13th …, 2007 | 199 | 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 | 192 | 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 | 157 | 2014 |

On the decidability and complexity of metric temporal logic over finite words J Ouaknine, J Worrell Logical Methods in Computer Science 3, 2007 | 156 | 2007 |

Nets with tokens which carry data R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell Fundamenta Informaticae 88 (3), 251-274, 2008 | 148 | 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 | 145 | 2004 |

Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011 | 124 | 2011 |

Reachability in succinct and parametric one-counter automata C Haase, S Kreutzer, J Ouaknine, J Worrell CONCUR 2009-Concurrency Theory: 20th International Conference, CONCUR 2009 …, 2009 | 114 | 2009 |

Decision problems for linear recurrence sequences J Ouaknine, J Worrell International Workshop on Reachability Problems, 21-28, 2012 | 100 | 2012 |

On metric temporal logic and faulty Turing machines J Ouaknine, J Worrell International Conference on Foundations of Software Science and Computation …, 2006 | 98 | 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 | 98 | 2004 |

Online monitoring of metric temporal logic HM Ho, J Ouaknine, J Worrell International conference on runtime verification, 178-192, 2014 | 96 | 2014 |

Ultimate positivity is decidable for simple linear recurrence sequences J Ouaknine, J Worrell International Colloquium on Automata, Languages, and Programming, 330-341, 2014 | 93 | 2014 |

Revisiting digitization, robustness, and decidability for timed automata J Ouaknine, J Worrell 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 92 | 2003 |

On the Positivity Problem for Simple Linear Recurrence Sequences^{,}J Ouaknine, J Worrell Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 90 | 2014 |