Sciweavers

357 search results - page 2 / 72
» Code security analysis with assertions
Sort
View
CSFW
2007
IEEE
13 years 11 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
ATVA
2007
Springer
89views Hardware» more  ATVA 2007»
13 years 11 months ago
Policies and Proofs for Code Auditing
Abstract. Both proofs and trust relations play a role in security decisions, in particular in determining whether to execute a piece of code. We have developed a language, called B...
Nathan Whitehead, Jordan Johnson, Martín Ab...
AADEBUG
1995
Springer
13 years 9 months ago
Software Testability Measurement for Assertion Placement and Fault Localization
Software testability, the tendency for software to reveal its faults during testing, is an important issue for veri cation and quality assurance. Testability measurement can also b...
Jeffrey M. Voas
CCS
2008
ACM
13 years 7 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...
SIGSOFT
2003
ACM
14 years 6 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler