A Framework for Composing Noninterferent Languages
| dc.contributor.author | Gampe, Andreas | |
| dc.contributor.author | von Ronne, Jeffery | |
| dc.date.accessioned | 2023-10-31T14:14:06Z | |
| dc.date.available | 2023-10-31T14:14:06Z | |
| dc.date.issued | 2013-09 | |
| dc.description.abstract | Software is frequently implemented using multiple specialized languages for different tasks. Security type systems, one technique to secure software, have previously only been studied for programs written entirely in a single language. We present a framework that facilitates reasoning over composite languages. In it, guarantees of sufficiently related component languages can be lifted to the composed language. This can significantly lower the burden necessary to certify that such composite programs are safe. Our simple but powerful approach relies, at its core, on computability and security-level separability. Besides non-interference, we also show how the framework can accommodate notions of declassification. To demonstrate the applicability of this framework, we show that a standard secure while language from the literature satisfies all necessary requirements of a composition host, and sketch how to securely embed an expressive fragment of SQL. | |
| dc.description.department | Computer Science | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12588/2199 | |
| dc.language.iso | en_US | |
| dc.publisher | UTSA Department of Computer Science | |
| dc.relation.ispartofseries | Technical Report; CS-TR-2013-014 | |
| dc.title | A Framework for Composing Noninterferent Languages | |
| dc.type | Technical Report |