Sciweavers

89 search results - page 9 / 18
» Where the bugs are
Sort
View
ISSTA
2012
ACM
11 years 10 months ago
Static detection of brittle parameter typing
To avoid receiving incorrect arguments, a method specifies the expected type of each formal parameter. However, some parameter types are too general and have subtypes that the me...
Michael Pradel, Severin Heiniger, Thomas R. Gross
SP
2006
IEEE
214views Security Privacy» more  SP 2006»
14 years 1 months ago
Automatically Generating Malicious Disks using Symbolic Execution
Many current systems allow data produced by potentially malicious sources to be mounted as a file system. File system code must check this data for dangerous values or invariant ...
Junfeng Yang, Can Sar, Paul Twohey, Cristian Cadar...
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
DAC
2003
ACM
14 years 8 months ago
Learning from BDDs in SAT-based bounded model checking
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
SPIN
2010
Springer
13 years 6 months ago
Experimental Comparison of Concolic and Random Testing for Java Card Applets
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
Kari Kähkönen, Roland Kindermann, Keijo ...