Follow
Frédéric Herbreteau
Frédéric Herbreteau
Univ. Bordeaux, CNRS, LaBRI, UMR 5800
Verified email at labri.fr
Title
Cited by
Cited by
Year
Better abstractions for timed automata
F Herbreteau, B Srivathsan, I Walukiewicz
Information and Computation 251, 67-90, 2016
622016
Lazy abstractions for timed automata
F Herbreteau, B Srivathsan, I Walukiewicz
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
432013
Decidable topologies for communicating automata with FIFO and bag channels
L Clemente, F Herbreteau, G Sutre
CONCUR 2014–Concurrency Theory: 25th International Conference, CONCUR 2014 …, 2014
302014
Using non-convex approximations for efficient analysis of timed automata
F Herbreteau, D Kini, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1110.3704, 2011
292011
Hybrid acceleration using real vector automata
B Boigelot, F Herbreteau, S Jodogne
Computer Aided Verification: 15th International Conference, CAV 2003 …, 2003
262003
The power of hybrid acceleration
B Boigelot, F Herbreteau
CAV, 438-451, 2006
252006
Reachability of Communicating Timed Processes.
L Clemente, F Herbreteau, A Stainer, G Sutre
FoSSaCS 7794, 81-96, 2013
212013
Efficient emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
Formal Methods in System Design 40, 122-146, 2012
212012
Efficient emptiness check for timed büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
Computer Aided Verification: 22nd International Conference, CAV 2010 …, 2010
202010
Efficient on-the-fly emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan
Automated Technology for Verification and Analysis: 8th International …, 2010
202010
Why liveness for timed automata is hard, and what we can do about it
F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz
ACM Transactions on Computational Logic (TOCL) 21 (3), 1-28, 2020
172020
Revisiting local time semantics for networks of timed automata
R Govind, F Herbreteau, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1907.02296, 2019
142019
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
102017
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
102017
Coarse abstractions make Zeno behaviours difficult to detect
F Herbreteau, B Srivathsan
CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011
102011
Improving search order for reachability testing in timed automata
F Herbreteau, TT Tran
Formal Modeling and Analysis of Timed Systems: 13th International Conference …, 2015
92015
Unfolding concurrent well-structured transition systems
F Herbreteau, G Sutre, TQ Tran
Tools and Algorithms for the Construction and Analysis of Systems: 13th …, 2007
62007
Zone-based verification of timed automata: extrapolations, simulations and what next?
P Bouyer, P Gastin, F Herbreteau, O Sankur, B Srivathsan
Formal Modeling and Analysis of Timed Systems: 20th International Conference …, 2022
52022
SneakLeak+: Large-scale klepto apps analysis
S Bhandari, F Herbreteau, V Laxmi, A Zemmari, MS Gaur, PS Roop
Future Generation Computer Systems 109, 593-603, 2020
52020
Certifying emptiness of timed büchi automata
S Wimmer, F Herbreteau, J van de Pol
Formal Modeling and Analysis of Timed Systems: 18th International Conference …, 2020
52020
The system can't perform the operation now. Try again later.
Articles 1–20