Frédéric Herbreteau

According to our database1, Frédéric Herbreteau authored at least 28 papers between 2001 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
SneakLeak: Detecting Multipartite Leakage Paths in Android Apps.
Proceedings of the 2017 IEEE Trustcom/BigDataSE/ICESS, Sydney, Australia, August 1-4, 2017, 2017

POSTER: Detecting Inter-App Information Leakage Paths.
Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017

2016
Better abstractions for timed automata.
Inf. Comput., 2016

Why Liveness for Timed Automata Is Hard, and What We Can Do About It.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Improving search order for reachability testing in timed automata.
CoRR, 2015

Improving Search Order for Reachability Testing in Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

2014
Fast detection of cycles in timed automata.
CoRR, 2014

Decidable Topologies for Communicating Automata with FIFO and Bag Channels.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Acceleration of Affine Hybrid Transformations.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Lazy abstractions for timed automata
CoRR, 2013

Reachability of Communicating Timed Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Lazy Abstractions for Timed Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Efficient emptiness check for timed Büchi automata.
Formal Methods in System Design, 2012

Reachability of Communicating Timed Processes
CoRR, 2012

Better Abstractions for Timed Automata.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Better abstractions for timed automata
CoRR, 2011

Using non-convex approximations for efficient analysis of timed automata
CoRR, 2011

Coarse abstractions make Zeno behaviours difficult to detect
Logical Methods in Computer Science, 2011

Efficient Emptiness Check for Timed Büchi Automata (Extended version)
CoRR, 2011

Using non-convex approximations for efficient analysis of timed automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Coarse Abstractions Make Zeno Behaviours Difficult to Detect.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Efficient Emptiness Check for Timed Büchi Automata.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Efficient On-the-Fly Emptiness Check for Timed Büchi Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2007
Unfolding Concurrent Well-Structured Transition Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

2006
The Power of Hybrid Acceleration.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2003
Hybrid Acceleration Using Real Vector Automata (Extended Abstract).
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Verification of Embedded Reactive Fiffo Systems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Application of Partial-Order Methods to Reactive Programs with Event Memorization.
Real-Time Systems, 2001


  Loading...