In this paper, we propose that grammar error detection be disambiguated in generating the connected parse(s) of optimal merit for the full input utterance, in overcoming the cheapest error. The detected error(s) are described as violated grammatical constraints in a framework for ModelTheoretic Syntax (MTS). We present a parsing algorithm for MTS, which only relies on a grammar of well-formedne...

This paper proposes a model-driven approach for the analysis of multimedia documents. Structural and behavioral properties of a multimedia document are verified thus guaranteeing its well-formedness and conformance before deployment. Multimedia documents are interpreted as object model instances of a multimedia document metamodel. Structural properties are verified using consistency reasoning o...

Feature models are used to state the instances of a software product-line. However, there is a limited tool support for automatically checking properties of feature models. In this paper, we propose a theory of feature models in Alloy. This theory can be used to check a number of properties in the Alloy Analyzer. For instance, we show how to check whether general feature model transformations p...

We will prove the existence of a universal quantum cellular automaton. Such qca are defined as the quantum-mechanical pendant of classical one-dimensional cellular automata. As is the case with quantum Turing machines, the well-formedness restriction plays an important role. It will be shown that every proper qca obeys a local constraint which is comparable with the ‘inverse neighborhood’ of cl...

Model-driven tools use model queries for many purposes, including validation of well-formedness rules, speci cation of derived features, and directing rule-based model transformation. Query languages such as graph patterns may facilitate capturing complex structural relationships between model elements. Specifying such queries, however, may prove di cult for engineers familiar with the concrete...

A metamodel expresses the syntactic well-formedness constraints that all models written using the notation of a modelling language must obey. We formally capture the metamodel for an industrial-strength object-oriented modelling language, BON, using the PVS specification language. We discuss how the PVS system helped in debugging the metamodel, and show how to use the PVS theorem prover for con...

Datatype specialization is a form of subtyping that captures program invariants on data structures that are expressed using the convenient and intuitive datatype notation. Of particular interest are structural invariants such as well-formedness. We investigate the use of phantom types for describing datatype specializations. We show that it is possible to express statically-checked specializati...

syntax The concepts from which models are created (see Requirement 1) Class diagram at level M2 Concrete syntax Concrete rendering of these concepts (see Requirement 2) UML notation, informally specified Well-formedness Rules for applying the concepts (see Requirement 1) Constraints on the abstract Syntax (using the Object Constraint Language, for example) Semantics Description of a model’s mea...

One of the first steps in a software engineering process is the elaboration of the conceptual domain model. In this paper, we investigate how Formal Concept Analysis can be used to formally underpin the construction of a conceptual domain model. In particular, we demonstrate that intuitive verification rules for process-data matrices can be formally grounded in FCA theory. As a case study, we s...

This document describes part of an effort to achieve in Nuprl a practical reflection of its expression syntax. This reflection is done at the granularity of the operators; in particular, each operator of the syntax is denoted by another operator of the same syntax. Further, the syntax has binding operators, and we organize reflection not around the concrete binding syntax, but instead, around t...