Reasoning about metamodeling with formal specifications and automatic proofs

  • Authors:
  • Ethan K. Jackson;Tihamér Levendovszky;Daniel Balasubramanian

  • Affiliations:
  • Microsoft Research, Redmond, WA;Vanderbilt University, Nashville, TN;Vanderbilt University, Nashville, TN

  • Venue:
  • Proceedings of the 14th international conference on Model driven engineering languages and systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Metamodeling is foundational to many modeling frameworks, and so it is important to formalize and reason about it. Ideally, correctness proofs and test-case generation on the metamodeling framework should be automatic. However, it has yet to be shown that extensive automated reasoning on metamodeling frameworks can be achieved. In this paper we present one approach to this problem: Metamodeling frameworks are specified modularly using algebraic data types and constraint logic programming (CLP). Proofs and test-case generation are encoded as CLP satisfiability problems and automatically solved.