University of Cambridge > Talks.cam > Wednesday Seminars - Department of Computer Science and Technology  > Hierarchies, Lowerarchies, Anarchies, and Plutarchies: Historical Perspectives of Composably Layered High-Assurance Architectures

Hierarchies, Lowerarchies, Anarchies, and Plutarchies: Historical Perspectives of Composably Layered High-Assurance Architectures

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Stephen Clark.

Note unusual time and day (and LT2)

This talk will consider some of the challenges of holistically designing predictably trustworthy system and network architectures, with consideration of various past efforts and some prospects for the future. In scope are topics such as what might be called the father and son of hierarchical trustworthy systems, respectively Multics (rings, symbolic dynamic linking, nested directories) and SRI ’s Provably Secure Operating System PSOS design (tagged and typed more-or-less object-oriented capabilities in hardware and software), MLS and MILS architectures (beginning with KSOS and KVM ), separation kernels and virtual machines (with pointers to Rushby and DeLong’s recent work). Some of the underlying concepts are of course abstraction, modularity, strong encapsulation, explicit mappings between layers, explicit dependency analyses, high assurance, and basic principles that can enhance modular composition, considered in my DARPA CHATS report, Principled Assuredly Trustworthy Composable Architecture. As an example of the pervasive interdependencies that must be addressed, I will briefly summarize some aspects of A Roadmap for Cybersecurity Research that we developed for Doug Maughan at the U.S. Department of Homeland Security, November 2009.

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity