Abstract
In designing and analyzing the structure and security of a large scale computer program or system, one is often interested in how it is constructed out of pieces or in the flow of information through it. The concepts of dependency, connectivity, and reparability which arise in security verification are handled well by graph theory. As is shown in this paper, graph homomorphism are particularly useful for describing the hierarchical/modular design of a system and for demonstrating the security of information flow.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.