Frédéric Herbreteau
23
Documents
Publications
|
Why Liveness for Timed Automata Is Hard, and What We Can Do About ItACM Transactions on Computational Logic, 2020, ⟨10.1145/3372310⟩
Article dans une revue
hal-03023737v1
|
Coarse abstractions make Zeno behaviours difficult to detect (Extended abstract)Logical Methods in Computer Science, 2013, Selected Papers of the "22nd International Conference on Concurrency Theory" CONCUR 2011, 9 (1)
Article dans une revue
hal-00829829v1
|
|
Efficient Emptiness Check for Timed Büchi Automata (Extended version)Formal Methods in System Design, 2012, Special issue on Computer Aided Verification (CAV'10), 40 (2), pp.122-146. ⟨10.1007/s10703-011-0133-1⟩
Article dans une revue
inria-00584849v1
|
|
|
Application of Partial-Order Methods to Reactive Systems with Event MemorizationJournal of Real-Time Systems, 2001, 20 (3), pp.287-316
Article dans une revue
inria-00363027v1
|
Zone-based verification of timed automata: extrapolations, simulations and what next?FORMATS 2022 - 20th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2022, Warsaw, Poland. pp.1-27
Communication dans un congrès
hal-03654350v1
|
|
|
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03644039v2
|
|
Revisiting local time semantics for networks of timed automataThe 30th International Conference on Concurrency Theory (CONCUR) 2019, Aug 2019, Amsterdam, Netherlands
Communication dans un congrès
hal-02173142v1
|
SneakLeak: Detecting Multipartite Leakage Paths in Android Apps2017 IEEE Trustcom/BigDataSE/ICESS, Aug 2017, Sydney, Australia. pp.285-292, ⟨10.1109/Trustcom/BigDataSE/ICESS.2017.249⟩
Communication dans un congrès
hal-02500705v1
|
|
Detecting Inter-App Information Leakage Pathsthe 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⟩
Communication dans un congrès
hal-02500699v1
|
|
|
Why Liveness for Timed Automata Is Hard, and What We Can Do About It36th 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⟩
Communication dans un congrès
hal-01423714v1
|
|
Improving search order for reachability testing in timed automataInternational Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Sep 2015, Madrid, Spain
Communication dans un congrès
hal-01166741v1
|
|
Decidable Topologies for Communicating Automata with FIFO and Bag ChannelsCONCUR 2014 - 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.281-296, ⟨10.1007/978-3-662-44584-6_20⟩
Communication dans un congrès
hal-01023456v1
|
Reachability of Communicating Timed ProcessesFoSSaCS - 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⟩
Communication dans un congrès
hal-00744085v1
|
|
|
Lazy abstractions for timed automataCAV - 24th International Conference on Computer Aided Verification - 2013, Jul 2013, Saint Petersburg, Russia
Communication dans un congrès
hal-00775924v2
|
Better abstractions for timed automataLICS - 27th Annual ACM/IEEE Symposium on Logic in Computer Science - 2012, Jun 2012, Dubrovnick, Croatia. pp.375-384
Communication dans un congrès
hal-00708714v1
|
|
|
Using non-convex approximations for efficient analysis of timed automata: Extended versionIARCS 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⟩
Communication dans un congrès
inria-00559902v3
|
Coarse abstractions make Zeno behaviours difficult to detectCONCUR - 22nd International Conference on Concurrency Theory - 2011, Sep 2011, Aachen, Germany. pp.92-107, ⟨10.1007/978-3-642-23217-6_7⟩
Communication dans un congrès
inria-00599553v1
|
|
|
Efficient On-The-Fly Emptiness Check for Timed Büchi AutomataATVA - 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⟩
Communication dans un congrès
inria-00496366v1
|
|
Efficient Emptiness Check for Timed Büchi AutomataCAV - 22nd International Conference on Computer Aided Verification - 2010, Jul 2010, Edinburgh, United Kingdom. pp.148-161, ⟨10.1007/978-3-642-14295-6_15⟩
Communication dans un congrès
hal-00477149v1
|
|
Unfolding Concurrent Well-Structured Transition SystemsProc. of the 13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS07), Mar 2007, Portugal. pp.706--720
Communication dans un congrès
hal-00306299v1
|
|
The Power of Hybrid AccelerationComputer Aided Verification, 18th International Conference, Aug 2006, Seattle, WA, United States. pp.438-451
Communication dans un congrès
inria-00335905v1
|
|
Hybrid Acceleration using Real Vector AutomataComputer Aided Verification, 15th International Conference, Jul 2003, Boulder, CO, United States. pp.193-205
Communication dans un congrès
inria-00335915v1
|
|
Verification of Embedded Reactive Fiffo SystemsLATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. pp.400-414
Communication dans un congrès
hal-00477233v1
|