Computer Aided Verification of Relational Models by Strategic Rewriting

• Claudia M. Necco ^[2] ; Jose N. Oliveira ^[3] ; Joost Visser ^[1] ; Roberto Uzal ^[2]
  1. [1] Radboud University Nijmegen

     Radboud University Nijmegen

     Países Bajos

     
  2. [2] Univ. Nacional de San Luis
  3. [3] High Assurance Software Lab / INESC TEC & Univ. Minho

  Mostrar afiliaciones +
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 17, Nº. 2, 2017, págs. 140-148
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions. We developed a typedirected, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.