Formal methods for constraint-based testing and reversible debugging in erlang

• Autores: Adrián Palacios Corella
• Directores de la Tesis: Germán Vidal Oriola (dir. tes.)
• Lectura: En la Universitat Politècnica de València ( España ) en 2020
• Idioma: español
• Tribunal Calificador de la Tesis: María Alpuente Frasnedo (presid.), Clara Benac Earle (secret.), Claudio Antares Mezzina (voc.)
• Programa de doctorado: Programa de Doctorado en Informática por la Universitat Politècnica de València
• Materias:
  • Lógica
    • Lógica deductiva
      • Lenguajes formales
      • Sistemas formales
  • Matemáticas
    • Ciencia de los ordenadores
      • Logicales de ordenadores
      • Lenguajes de programación
• Enlaces
  • Tesis en acceso abierto en: RiuNet
• Resumen

  • Erlang is a message-passing concurrent, functional programming language based on the actor model. These and other features make it especially appropriate for distributed, soft real-time applications. In the recent years, Erlang's popularity has increased due to the demand for concurrent services.

    However, developing error-free systems in Erlang is quite a challenge. Although Erlang avoids many problems by design (e.g., deadlocks), some other problems may appear. Here, testing and debugging techniques based on formal methods may be helpful to detect, locate and fix programming errors in Erlang.

    In this thesis we propose several methods for testing and debugging in Erlang. In particular, these methods are based on semantics models for concolic testing, property-based testing, causal-consistent reversible debugging and causal-consistent replay debugging of Erlang programs. We formally prove the main properties of our proposals and design open-source tools that implement these methods.