A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Sign Up to like & getrecommendations! Published in 2018 at "Optimization Letters"
DOI: 10.1007/s11590-017-1125-x
Abstract: In this paper, we develop a Lagrangian decomposition based heuristic method for general quadratic binary programs (QBPs) with linear constraints. We extend the idea of Lagrangian decomposition by Chardaire and Sutter (Manag Sci 41(4):704–712, 1995)… read more here.
Keywords: quadratic binary; binary programs; approach computing; lagrangian decomposition ... See more keywords
PTfuzz: Guided Fuzzing With Processor Trace Feedback
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Access"
DOI: 10.1109/access.2018.2851237
Abstract: Greybox fuzzing, such as american fuzzy lop (AFL), is very efficient in finding software vulnerability, which makes it the state-of-the-art fuzzing technology. Greybox fuzzing leverages the branch information collected during program running as feedback to… read more here.
Keywords: binary programs; ptfuzz; processor trace; greybox fuzzing ... See more keywords
V-Fuzz: Vulnerability Prediction-Assisted Evolutionary Fuzzing for Binary Programs.
Sign Up to like & getrecommendations! Published in 2020 at "IEEE transactions on cybernetics"
DOI: 10.1109/tcyb.2020.3013675
Abstract: Fuzzing is a technique of finding bugs by executing a target program recurrently with a large number of abnormal inputs. Most of the coverage-based fuzzers consider all parts of a program equally and pay too… read more here.
Keywords: evolutionary fuzzing; binary programs; fuzz vulnerability; vulnerability ... See more keywords