Name
Abstract | ||
|---|---|---|
The time has arrived for truly trustworthy systems, backed by machine-checked proofs of security and reliability. Research demonstrates that formal whole-system analysis that applies to the C and binary implementation level is feasible, including proofs of integrity, authority confinement, confidentiality, and worst-case execution time. Because these proofs build on previous results, they become easier each year. However, they do have some limitations. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/MSP.2012.41 | IEEE Security & Privacy |
Keywords | Field | DocType |
formal whole-system analysis,authority confinement,trustworthy system,worst-case execution time,binary implementation level,previous result,trustworthy systems,machine-checked proof,computer security,reliability,confidentiality,security,worst case execution time,trusted computing,secure computation,formal verification,hardware,system analysis | Trustworthy computing,Trusted Computing,Worst-case execution time,Confidentiality,Computer science,Computer security,Software,Trusted computing base,Formal verification,Formal proof | Journal |
Volume | Issue | ISSN |
10 | 2 | 1540-7993 |
Citations | PageRank | References |
6 | 0.64 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gernot Heiser | 1 | 2525 | 137.42 |
| Toby Murray | 2 | 242 | 17.03 |
| Gerwin Klein | 3 | 1450 | 87.47 |