Synthesis of Non-Interferent Timed Systems

Authors:
Gilles Benattar;Franck Cassez;Didier Lime;Olivier H. Roux
Affiliations:
IRCCyN/CNRS, BP 92101, Nantes Cedex 3, France 44321;National ICT Australia & CNRS, Univ. of New South Wales, Sydney, Australia;IRCCyN/CNRS, BP 92101, Nantes Cedex 3, France 44321;IRCCyN/CNRS, BP 92101, Nantes Cedex 3, France 44321
Venue:
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Year:
2009

Citing 10
Cited 1

A theory of timed automata

Theoretical Computer Science
The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties

IEEE Transactions on Software Engineering
Classification of Security Properties (Part I: Information Flow)

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Discrete-Time Control for Rectangular Hybrid Automata

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Timed Control Synthesis for External Specifications

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Algorithmic Verification of Noninterference Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
Non-Interference Control Synthesis for Security Timed Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
An Automata Based Approach for Verifying Information Flow Properties

Electronic Notes in Theoretical Computer Science (ENTCS)
Language-based information-flow security

IEEE Journal on Selected Areas in Communications

Describing Secure Interfaces with Interface Automata

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a non-interference property. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and we study the two following problems: (1) check whether it is possible to enforce a system to be SNNI; if yes (2) compute a sub-system which is SNNI.