A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Lazy Self-composition for Security Verification
[chapter]
2018
Lecture Notes in Computer Science
The secure information flow problem, which checks whether low-security outputs of a program are influenced by high-security inputs, has many applications in verifying security properties in programs. In this paper we present lazy self-composition, an approach for verifying secure information flow. It is based on self-composition, where two copies of a program are created on which a safety property is checked. However, rather than an eager duplication of the given program, it uses duplication
doi:10.1007/978-3-319-96142-2_11
fatcat:xa7ooq25mbafdee7cldktzw7a4