A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
A Theorem Proving Approach to Analysis of Secure Information Flow
[chapter]
2005
Lecture Notes in Computer Science
Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feasible, these approaches suffer from the need for abstraction and the high cost of building dedicated tools for real programming languages. We recast the information flow problem in a general program logic rather than a problem-specific one. We investigate the feasibility of this approach by showing how a general purpose tool for software verification can be used to
doi:10.1007/978-3-540-32004-3_20
fatcat:rvq6bm5djnhmpchd4oi2dt7zrm