Name
Abstract | ||
|---|---|---|
The synchronous reactive data flow language LUSTRE is an expressive language, equipped with a suite of tools for modelling, simulating and model-checking a wide variety of safety-critical systems. A critical intermediate step in the formally certified compilation of LUSTRE involves translation to a well-behaved sub-language called "Normalised LUSTRE" (NLUSTRE). Recently, we proposed a simple Denning-style lattice-based secure information flow type system for NLUSTRE, and proved its soundness by establishing that security-typed programs are non-interfering with respect to the co-inductive stream semantics.In this paper, we propose a similar security type system for unrestricted LUSTRE, and show that Bourke et al.'s semantics-preserving normalisation transformations from LUSTRE to NLUSTRE are security-preserving as well. A novelty is the use of refinement security types for node calls. The main result is the preservation of security types by the normalisation transformations. The soundness of our security typing rules is shown by establishing that well-security-typed programs are non-interfering, via a reduction to type-preservation (here), semantics-preservation (Bourke et al.) and our previous result of non-interference for NLUSTRE. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-85315-0_16 | THEORETICAL ASPECTS OF COMPUTING, ICTAC 2021 |
Keywords | DocType | Volume |
Synchronous reactive data flow, LUSTRE, Compiler transformation, Security type system, Non-interference, Security preservation | Conference | 12819 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjiva Prasad | 1 | 301 | 40.04 |
| R. Madhukar Yerraguntla | 2 | 0 | 0.34 |