Sciweavers

506 search results - page 31 / 102
» Where Is the Value in a Program Verifier
Sort
View
221
Voted
POPL
2003
ACM
16 years 23 days ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
78
Voted
MP
2006
121views more  MP 2006»
15 years 12 days ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
IFIP
2009
Springer
15 years 7 months ago
Specifying and Modelling Secure Channels in Strand Spaces
We adapt the Strand Spaces model to reason abstractly about layered security protocols, where an Application Layer protocol ed on top of a secure transport protocol. The model abst...
Allaa Kamil, Gavin Lowe
97
Voted
ISSTA
2006
ACM
15 years 6 months ago
DSD-Crasher: a hybrid analysis tool for bug finding
DSD-Crasher is a bug finding tool that follows a three-step approach to program analysis: D. Capture the program’s intended execution behavior with dynamic invariant detection....
Christoph Csallner, Yannis Smaragdakis
ICSE
2011
IEEE-ACM
14 years 3 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst