19th Annual Computer Security Applications Conference, 2003. Proceedings.
DOI: 10.1109/csac.2003.1254326
|View full text |Cite
|
Sign up to set email alerts
|

PSOS revisited

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 30 publications
(24 citation statements)
references
References 27 publications
0
21
0
Order By: Relevance
“…The assumption, based on the concepts articulated in the PSOS research [6], was that each layer would be verified to correctly implement a specification using code in its own layer that invoked services provided by lower layers. Verification of each layer would lead to verification of the entire system.…”
Section: Verification Of Assurancementioning
confidence: 99%
See 2 more Smart Citations
“…The assumption, based on the concepts articulated in the PSOS research [6], was that each layer would be verified to correctly implement a specification using code in its own layer that invoked services provided by lower layers. Verification of each layer would lead to verification of the entire system.…”
Section: Verification Of Assurancementioning
confidence: 99%
“…By 1981, several government-sponsored research projects had attempted to build highassurance operating systems [5,6,7]. Some had been cancelled while others continued to subsist on government research funding.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The machines are records pm = (pc, dpc, gpr, spr, m) with the following components: (i) the normal pm.pc ∈ B 32 and the delayed pm.dpc ∈ B 32 program counters used to implement the delayed branch mechanism, (ii) the general purpose register file pm.gpr ∈ B 5 → B 32 , and the special purpose register file pm.spr ∈ SAP → B 32 , and (iii) the byte addressable physical memory pm.m ∈ PMA → B 8 . We demand SAP to contain the following addresses: (i) mode, for the mode register, and (ii) pto and ptl, for the page [11], and the protected bit p(pm, va) = pte(pm, va) [10]. Concatenation of the physical page index and the byte index yields the physical memory address pma(pm, va) = ppx(pm, va) • bx (va).…”
Section: Physical Machine Specificationmentioning
confidence: 99%
“…Hillebrand [7] presents paper and pencil formalisations and proofs for memory virtualisation. First attempts to use theorem provers to specify and even prove correct operating systems were made as early as the seventies in PSOS [11] and UCLA Secure Unix [16]. However a missing or to a large extend underdeveloped tool environment made mechanized verification futile.…”
Section: Introductionmentioning
confidence: 99%