Accéder directement au contenu
Nombre de documents

21


Article dans une revue4 documents

  • Frédéric Herbreteau, B. Srivathsan, Tran Thanh Tung, Igor Walukiewicz. Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, ⟨10.1145/3372310⟩. ⟨hal-03023737⟩
  • Frédéric Herbreteau, B. Srivathsan. Coarse abstractions make Zeno behaviours difficult to detect (Extended abstract). Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, Selected Papers of the "22nd International Conference on Concurrency Theory" CONCUR 2011, 9 (1). ⟨hal-00829829⟩
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata (Extended version). Formal Methods in System Design, Springer Verlag, 2012, Special issue on Computer Aided Verification (CAV'10), 40 (2), pp.122-146. ⟨10.1007/s10703-011-0133-1⟩. ⟨inria-00584849⟩
  • Frédéric Herbreteau, Franck Cassez, Olivier Roux. Application of Partial-Order Methods to Reactive Systems with Event Memorization. Journal of Real-Time Systems, Kluwer, 2001, 20 (3), pp.287-316. ⟨inria-00363027⟩

Communication dans un congrès17 documents

  • R Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Revisiting local time semantics for networks of timed automata. The 30th International Conference on Concurrency Theory (CONCUR) 2019, Aug 2019, Amsterdam, Netherlands. ⟨hal-02173142⟩
  • Shweta Bhandari, Frédéric Herbreteau, Vijay Laxmi, Akka Zemmari, Partha Roop, et al.. Detecting Inter-App Information Leakage Paths. the 2017 ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2017, Apr 2017, Abu Dhabi, United Arab Emirates. pp.908-910, ⟨10.1145/3052973.3055163⟩. ⟨hal-02500699⟩
  • Shweta Bhandari, Frédéric Herbreteau, Vijay Laxmi, Akka Zemmari, Partha Roop, et al.. SneakLeak: Detecting Multipartite Leakage Paths in Android Apps. 2017 IEEE Trustcom/BigDataSE/ICESS, Aug 2017, Sydney, Australia. pp.285-292, ⟨10.1109/Trustcom/BigDataSE/ICESS.2017.249⟩. ⟨hal-02500705⟩
  • Frédéric Herbreteau, B Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. Why Liveness for Timed Automata Is Hard, and What We Can Do About It. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, Dec 2016, Chennai, India. pp.48:1-48:14, ⟨10.4230/LIPIcs.FSTTCS.2016.48⟩. ⟨hal-01423714⟩
  • Frédéric Herbreteau, Thanh-Tung Tran. Improving search order for reachability testing in timed automata. International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Sep 2015, Madrid, Spain. ⟨hal-01166741⟩
  • Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre. Decidable Topologies for Communicating Automata with FIFO and Bag Channels. CONCUR 2014 - 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.281-296, ⟨10.1007/978-3-662-44584-6_20⟩. ⟨hal-01023456⟩
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Lazy abstractions for timed automata. CAV - 24th International Conference on Computer Aided Verification - 2013, Jul 2013, Saint Petersburg, Russia. ⟨hal-00775924v2⟩
  • Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre. Reachability of Communicating Timed Processes. FoSSaCS - 16th International Conference on Foundations of Software Science and Computation Structures, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS - 2013, Mar 2013, Rome, Italy. pp.81-96, ⟨10.1007/978-3-642-37075-5_6⟩. ⟨hal-00744085⟩
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Better abstractions for timed automata. LICS - 27th Annual ACM/IEEE Symposium on Logic in Computer Science - 2012, Jun 2012, Dubrovnick, Croatia. pp.375-384. ⟨hal-00708714⟩
  • Frédéric Herbreteau, B. Srivathsan. Coarse abstractions make Zeno behaviours difficult to detect. CONCUR - 22nd International Conference on Concurrency Theory - 2011, Sep 2011, Aachen, Germany. pp.92-107, ⟨10.1007/978-3-642-23217-6_7⟩. ⟨inria-00599553⟩
  • Frédéric Herbreteau, D. Kini, B. Srivathsan, Igor Walukiewicz. Using non-convex approximations for efficient analysis of timed automata: Extended version. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, IIT Bombay, Dec 2011, Mumbai, India. pp.78-89, ⟨10.4230/LIPIcs.FSTTCS.2011.78⟩. ⟨inria-00559902v3⟩
  • Frédéric Herbreteau, B. Srivathsan. Efficient On-The-Fly Emptiness Check for Timed Büchi Automata. ATVA - 8th International Symposium on Automated Technology for Verification and Analysis - 2010, Sep 2010, Singapore, Singapore. pp.218-232, ⟨10.1007/978-3-642-15643-4_17⟩. ⟨inria-00496366⟩
  • Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata. CAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. pp.148-161, ⟨10.1007/978-3-642-14295-6_15⟩. ⟨hal-00477149⟩
  • Frédéric Herbreteau, Grégoire Sutre, The Quang Tran. Unfolding Concurrent Well-Structured Transition Systems. Proc. of the 13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS07), Mar 2007, Portugal. pp.706--720. ⟨hal-00306299⟩
  • Bernard Boigelot, Frédéric Herbreteau. The Power of Hybrid Acceleration. Computer Aided Verification, 18th International Conference, Aug 2006, Seattle, WA, United States. pp.438-451. ⟨inria-00335905⟩
  • Bernard Boigelot, Frédéric Herbreteau, Sébastien Jodogne. Hybrid Acceleration using Real Vector Automata. Computer Aided Verification, 15th International Conference, Jul 2003, Boulder, CO, United States. pp.193-205. ⟨inria-00335915⟩
  • Frédéric Herbreteau, Franck Cassez, Alain Finkel, Roux Olivier, Grégoire Sutre. Verification of Embedded Reactive Fiffo Systems. LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. pp.400-414. ⟨hal-00477233⟩