Description: The AVMf is a framework and Java implementation of the Alternating Variable Method (AVM), a heuristic local search algorithm that has been applied to several important software engineering problems.
AVM f is a framework and Java implementation of the Alternating Variable Method (AVM), a heuristic local search algorithm that has been applied to several important software engineering problems.
Originally applied to automatic test input generation problems by Korel (1990), the AVM has since been extended to handle fixed point numbers (Harman and McMinn, 2007) and strings (McMinn et al., 2015), and enhanced with different local search algorithm that are proven to be faster under certain conditions (Kempka et al., 2015).
AVM f was designed to enable researchers and practitioners understand the algorithms behind the AVM and use it in their projects, and is freely available for use under the MIT licence.