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

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 | 208 | 2004 |

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

Sudoku as a SAT Problem. I Lynce, J Ouaknine ISAIM, 2006 | 170 | 2006 |

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 | 156 | 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 | 145 | 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 | 143 | 2008 |

On the decidability and complexity of metric temporal logic over finite words J Ouaknine, J Worrell arXiv preprint cs/0702120, 2007 | 127 | 2007 |

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

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

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

Concurrent software verification with states, events, and deadlocks S Chaki, E Clarke, J Ouaknine, N Sharygina, N Sinha Formal Aspects of Computing 17 (4), 461-483, 2005 | 80 | 2005 |

Authentication protocols based on low-bandwidth unspoofable channels: a comparative survey LH Nguyen, AW Roscoe Journal of Computer Security 19 (1), 139-201, 2011 | 73 | 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 | 72 | 2009 |

Positivity problems for low-order linear recurrence sequences J Ouaknine, J Worrell Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 71 | 2014 |

Automated compositional abstraction refinement for concurrent C programs: A two-level approach S Chaki, J Ouaknine, K Yorav, E Clarke Electronic Notes in Theoretical Computer Science 89 (3), 417-432, 2003 | 70 | 2003 |

Axioms for probability and nondeterminism M Mislove, J Ouaknine, J Worrell Electronic Notes in Theoretical Computer Science 96, 7-28, 2004 | 65 | 2004 |