<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Maximizing the Amount of Information Not Modelled in MDE</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Colin Atkinson</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Mannheim</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ideally, a domain-speci c modeling languages should allow domain experts to dene requirements and solutions with the minimal necessary model content. Any model content that is not strictly necessary for expressing the desired message is essentially \accidental complexity" and reduces the generality and \ exibility" of the model. Therefore, in the same way that agile methods aim to \maximize the amount of work not done" in software engineering, model-driven development should aim to maximize the amount of information not modeled in the ful llment of modeling goals. This requires the use of languages that are not only optimized to express concepts in the domain of discourse but also possess clear inference and frame rules allowing modelers to infer information that is not explicitly expressed. Examples include \world assumptions" (e.g. open or closed), derivation mechanisms (e.g. inheritance), \completion" statements and elision notations. In this talk Colin Atkinson will clarify what it means to maximizing the amount of information not modelled in MDE, suggest some concrete principles and mechanism for achieving this goal, and explore what consequence it can have for model exibility.</p>
      </abstract>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list />
  </back>
</article>