Applying Evolutionary Computation Methods to Formal Testing and Model Checking

  • Authors:
  • Pablo Rabanal;Ismael Rodríguez;Fernando Rubio

  • Affiliations:
  • Dept. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Madrid, Spain 28040;Dept. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Madrid, Spain 28040;Dept. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Madrid, Spain 28040

  • Venue:
  • IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal Methods (FM) provide mathematically founded algorithms for analyzing the correctness of systems. Though FM have been successfully applied to many industrial problems, these methods typically find the practical problem that the number of states to be systematically analyzed grows exponentially with the size of the system to be analyzed. Thus, exhaustive techniques to find system faults are typically substituted by heuristic strategies allowing to focalize the search for potential faults in some suspicious or critical configurations. In particular, Evolutionary Computation (EC) methods provide efficient generic strategies to search for good solutions in big solution spaces, which fit into the kind of problems appearing in FM. This paper summarizes several works where EC techniques have been applied to FM problems.