Security of software systems has to be preserved while they grow and change incrementally. The problem is to make the analysis of their security properties adhere to such a development. In particular we concentrate here on static type systems. Given a non-incremental type system, the algorithm we propose permits using it incrementally, so avoiding to develop new incremental versions of it. As a proof-of-concept we show how our technique permits an incremental checking of non-interference with robust declassification, starting from the classical type system by Myers, Sabelfeld and Zdancewic.
CITATION STYLE
Busi, M., Degano, P., & Galletta, L. (2019). Robust Declassification by Incremental Typing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11565 LNCS, pp. 54–69). Springer Verlag. https://doi.org/10.1007/978-3-030-19052-1_6
Mendeley helps you to discover research relevant for your work.