A memetic algorithm for program verification

We present a memetic algorithm for program safety properties verification. This problem is expressed by means of Reach ability of some erroneous location L in the program. We use a new method for program modeling: A Separation Modeling Approach: ASMA, in which programs are represented by two components: Data Model DM, and Control Model CM. The erroneous location is represented by its "Location Access Chain", LAC: a string where each position represents the required value of CM elements guards to reach L. The memetic algorithm generates each time a new population attempting to provide an execution which is " conform" to the location access chain. An individual of the population is a set of intervals each one representing an input variable. At each generation, two local search operators are used to improve some chosen solutions.