| Better abstractions for timed automata F Herbreteau, B Srivathsan, I Walukiewicz Information and Computation 251, 67-90, 2016 | 33 | 2016 |
| Decidable topologies for communicating automata with FIFO and bag channels L Clemente, F Herbreteau, G Sutre International Conference on Concurrency Theory, 281-296, 2014 | 27 | 2014 |
| Lazy abstractions for timed automata F Herbreteau, B Srivathsan, I Walukiewicz International Conference on Computer Aided Verification, 990-1005, 2013 | 25 | 2013 |
| Hybrid acceleration using real vector automata B Boigelot, F Herbreteau, S Jodogne International Conference on Computer Aided Verification, 193-205, 2003 | 25 | 2003 |
| Using non-convex approximations for efficient analysis of timed automata F Herbreteau, D Kini, B Srivathsan, I Walukiewicz arXiv preprint arXiv:1110.3704, 2011 | 22 | 2011 |
| The power of hybrid acceleration B Boigelot, F Herbreteau International Conference on Computer Aided Verification, 438-451, 2006 | 22 | 2006 |
| Reachability of communicating timed processes L Clemente, F Herbreteau, A Stainer, G Sutre International Conference on Foundations of Software Science and …, 2013 | 19 | 2013 |
| Efficient on-the-fly emptiness check for timed Büchi automata F Herbreteau, B Srivathsan International Symposium on Automated Technology for Verification and …, 2010 | 19 | 2010 |
| Efficient emptiness check for timed büchi automata F Herbreteau, B Srivathsan, I Walukiewicz International Conference on Computer Aided Verification, 148-161, 2010 | 18 | 2010 |
| Efficient emptiness check for timed Büchi automata F Herbreteau, B Srivathsan, I Walukiewicz Formal Methods in System Design 40 (2), 122-146, 2012 | 15 | 2012 |
| Coarse abstractions make zeno behaviours difficult to detect F Herbreteau, B Srivathsan International Conference on Concurrency Theory, 92-107, 2011 | 9 | 2011 |
| Detecting Inter-App Information Leakage Paths S Bhandari, F Herbreteau, V Laxmi, A Zemmari, PS Roop, MS Gaur Proceedings of the 2017 ACM on Asia Conference on Computer and …, 2017 | 7 | 2017 |
| Improving search order for reachability testing in timed automata F Herbreteau, TT Tran International Conference on Formal Modeling and Analysis of Timed Systems …, 2015 | 7 | 2015 |
| Why liveness for timed automata is hard, and what we can do about it F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz | 6 | 2016 |
| Sneakleak: Detecting multipartite leakage paths in android apps S Bhandari, F Herbreteau, V Laxmi, A Zemmari, PS Roop, MS Gaur 2017 IEEE Trustcom/BigDataSE/ICESS, 285-292, 2017 | 4 | 2017 |
| SneakLeak+: Large-scale klepto apps analysis S Bhandari, F Herbreteau, V Laxmi, A Zemmari, MS Gaur, PS Roop Future Generation Computer Systems, 2018 | 3 | 2018 |
| Fast detection of cycles in timed automata A Deshpande, F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz arXiv preprint arXiv:1410.4509, 2014 | 3 | 2014 |
| Unfolding concurrent well-structured transition systems F Herbreteau, G Sutre International Conference on Tools and Algorithms for the Construction and …, 2007 | 3* | 2007 |
| Application of partial-order methods to reactive programs with event memorization F Herbreteau, F Cassez, O Roux Real-Time Systems 20 (3), 287-316, 2001 | 3 | 2001 |
| Efficient Emptiness Check for Timed B\" uchi Automata (Extended version) F Herbreteau, B Srivathsan, I Walukiewicz arXiv preprint arXiv:1104.1540, 2011 | 2 | 2011 |
B SrivathsanChennai Mathematical Institute, Assistant Professor of Computer ScienceAdresse e-mail validée de cmi.ac.in
