Preserving Secrecy Under Refinement, ICALP '06: Proceedings (Part II) of the 33rd International Colloquium on Automata, Languages and Programming, pp.107-118, 2006. ,
DOI : 10.1007/11787006_10
Concurrent secrets. Discrete Event Dynamic Systems, pp.425-446, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00070249
Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.331-340, 2005. ,
DOI : 10.1109/LICS.2005.8
Opacity generalised to transition systems, International Journal of Information Security, vol.7, issue.6, pp.421-435, 2008. ,
Fault diagnosis with static or dynamic diagnosers, Fundamenta Informatica, vol.88, issue.4, pp.497-540, 2008. ,
Test Generation for Network Security Rules, LNCS, vol.3964, 2006. ,
DOI : 10.1007/11754008_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.458.3609
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems, Annual ACM IEEE Design Automation Conference, pp.37-421, 1999. ,
Opacity enforcing control synthesis, 2008 9th International Workshop on Discrete Event Systems, pp.28-35, 2008. ,
DOI : 10.1109/WODES.2008.4605918
URL : https://hal.archives-ouvertes.fr/inria-00344269
Opacity enforcing control synthesis, 2008 9th International Workshop on Discrete Event Systems, 1921. ,
DOI : 10.1109/WODES.2008.4605918
URL : https://hal.archives-ouvertes.fr/inria-00344269
Monitoring information flow by diagnosis techniques, 1901. ,
URL : https://hal.archives-ouvertes.fr/inria-00312747
Classification of Security Properties, Foundations of Security Analysis and Design I: FOSAD 2000 Tutorial Lectures, pp.331-396, 2001. ,
DOI : 10.1007/3-540-45608-2_6
On the Verification of Intransitive Noninterference in Mulitlevel Security, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.35, issue.5, pp.948-957, 2005. ,
DOI : 10.1109/TSMCB.2005.847749
A characterization of the minimum cycle mean in a digraph, Discrete Mathematics, vol.23, issue.1, pp.309-311, 1978. ,
DOI : 10.1016/0012-365X(78)90078-X
Information flow testing -the third path towards confidentiality guarantee, Advances in Computer Science, ASIAN 2007. Computer and Network Security, pp.33-47, 2007. ,
Edit automata: enforcement mechanisms for run-time security policies, International Journal of Information Security, vol.3, issue.1-2, pp.2-16, 2005. ,
DOI : 10.1007/s10207-004-0046-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.6074
Towards a completeness result for model checking of security protocols, Journal of Computer Security, vol.7, issue.2-3, pp.89-146, 1999. ,
DOI : 10.3233/JCS-1999-72-302
Borel determinacy, Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975. ,
Using unification for opacity properties, Proceedings of the 4th IFIP WG1.7 Workshop on Issues in the Theory of Security, pp.165-176, 2004. ,
Opacity-enforcing supervisory strategies for secure discrete event systems, 2008 47th IEEE Conference on Decision and Control, 2008. ,
DOI : 10.1109/CDC.2008.4738646
Enforceable security policies, ACM Transactions on Information and System Security, vol.3, issue.1, pp.30-50, 2000. ,
DOI : 10.1145/353323.353382
Word problems requiring exponential time: Preliminary report, STOC, pp.1-9, 1973. ,
A Formula for the Supremal Controllable and Opaque Sublanguage Arising in Supervisory Control, SICE Journal of Control, Measurement, and System Integration, vol.1, issue.4, pp.307-312, 2008. ,
DOI : 10.9746/jcmsi.1.307
On the synthesis of strategies in infinite games, Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), pp.1-13, 1995. ,
DOI : 10.1007/3-540-59042-0_57
The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996. ,
DOI : 10.1016/0304-3975(95)00188-3