Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

USS
2008

favoriteEmaildiscussreport

93views Operating System» more USS 2008»

Security Benchmarking using Partial Verification

13 years 7 months ago

Security Benchmarking using Partial Verification

Download www.usenix.org

Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to place a numerical upper bound on the insecurity of systems, in order to motivate improvement.

Thomas E. Hart, Marsha Chechik, David Lie

Real-time Traffic

Numerical Upper Bound | Operating System | Partially-successful Verification Attempts | Persistent Threat | USS 2008 |

claim paper

Related Content

» High Security Fingerprint Verification by PerceptronBased Fusion of Multiple Matchers

» Verification of Timed Systems Using POSETs

» Continuous Verification Using Multimodal Biometrics

» Partial order reduction for scalable testing of systemC TLM designs

» Tools for Traceable Security Verification

» Costaware synthesis of asynchronous circuits based on partial acknowledgement

» Formal verification of practical MPI programs

» Collaborative Runtime Verification with Tracematches

» Remote Attestation on Legacy Operating Systems With Trusted Platform Modules

Post Info
More Details (n/a)

Added	02 Oct 2010
Updated	02 Oct 2010
Type	Conference
Year	2008
Where	USS
Authors	Thomas E. Hart, Marsha Chechik, David Lie

Comments (0)