*banner
 

Constructive Techniques for Meta and Model Level Reasoning
Ethan Jackson, Janos Sztipanovits

Citation
Ethan Jackson, Janos Sztipanovits. "Constructive Techniques for Meta and Model Level Reasoning". Model Driven Engineering Languages and Systems, 405-419, October, 2007.

Abstract
The structural semantics of UML-based metamodeling were recently explored [1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of first-order logic, an extended Horn logic. We augment the constructive techniques found in logic programming, which are also based on an extended Horn logic, to produce constructive techniques for reasoning about models and metamodels. These methods have a number of practical applications: At the meta-level, it can be decided if a (composite) metamodel characterizes a non-empty set of models, and a member can be automatically constructed. At the model-level, it can be decided if a submodel has an embeddeding in a well-formed model, and the larger model can be constructed. This amounts to automatic model construction from an incomplete model. We describe the concrete algorithms for constructively solving these problems, and provide concrete examples.

Electronic downloads

Citation formats  
  • HTML
    Ethan Jackson, Janos Sztipanovits. <a
    href="http://chess.eecs.berkeley.edu/pubs/287.html"
    >Constructive Techniques for Meta and Model Level
    Reasoning</a>, Model Driven Engineering Languages and
    Systems, 405-419, October, 2007.
  • Plain text
    Ethan Jackson, Janos Sztipanovits. "Constructive
    Techniques for Meta and Model Level Reasoning". Model
    Driven Engineering Languages and Systems, 405-419, October,
    2007.
  • BibTeX
    @inproceedings{JacksonSztipanovits07_ConstructiveTechniquesForMetaModelLevelReasoning,
        author = {Ethan Jackson and Janos Sztipanovits},
        title = {Constructive Techniques for Meta and Model Level
                  Reasoning},
        booktitle = {Model Driven Engineering Languages and Systems},
        pages = {405-419},
        month = {October},
        year = {2007},
        abstract = {The structural semantics of UML-based metamodeling
                  were recently explored [1], providing a
                  characterization of the models adhering to a
                  metamodel. In particular, metamodels can be
                  converted to a set of constraints expressed in a
                  decidable subset of first-order logic, an extended
                  Horn logic. We augment the constructive techniques
                  found in logic programming, which are also based
                  on an extended Horn logic, to produce constructive
                  techniques for reasoning about models and
                  metamodels. These methods have a number of
                  practical applications: At the meta-level, it can
                  be decided if a (composite) metamodel
                  characterizes a non-empty set of models, and a
                  member can be automatically constructed. At the
                  model-level, it can be decided if a submodel has
                  an embeddeding in a well-formed model, and the
                  larger model can be constructed. This amounts to
                  automatic model construction from an incomplete
                  model. We describe the concrete algorithms for
                  constructively solving these problems, and provide
                  concrete examples.},
        URL = {http://chess.eecs.berkeley.edu/pubs/287.html}
    }
    

Posted by Christopher Brooks on 6 Jun 2007.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess