We investigate refinement in the context of choreographies. introduce refinable global choreographies allowing for underspecification protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may spoil well-formedness , which are sufficient conditions that guarantee a protocol to implementable. typing discipline enforces typed Then we unveil relation among and th...

We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, defeasible constraints that integrate different sources of linguistic knowledge, very high robustness is achieved against all sorts of language error.

We implemented a parser designed to handle ill-formedness in Japanese speech. The parser was evaluated by utilizing newly collected speech data, which was obtained from an experiment designed to produce ill-formed data effectively. Introducing the proposed method increased the number of correctly analyzed utterances from 171 to 322, from among 532 utterances in the corpus.

Syntax The abstract syntax is presented in a UML class diagram showing the metaclasses defining theconstructs and their relationships. The diagram also presents some of the well-formedness rules,mainly the multiplicity requirements of the relationships, and whether or not the instances of aparticular sub-construct must be ordered. Finally, a short informal description in natural...

Model driven development needs tool support. Assistance in maintaining model consistence with respect to both syntactical well-formedness rules and business logic of the system being modeled is essential for every CASE tool. We present the tool ArgoMobile for modeling mobile systems. The highlighting feature of ArgoMobile is how it helps the modeler keep his models syntactically and semanticall...

The accenting of contextually ‘given’ information constitutes a problem for analyses that regard accents as correlating only with ‘new’ information. It will be shown that the accenting of ‘given’ information is explainable as resulting from general metrical well-formedness conditions on prosodic constituents. Units higher than the word are seen to obey the same metrical constraints that are pre...

A formal specification of a Java Secure Processor is presented, which is mechanically checked for type consistency, well formedness and operational conservativity. The specification is executable and it is used to animate and study the behaviour of sample Java programs. The purpose of the semantics is to document the behaviour of the complete JSP for the benefit of implementors.

The paper describes the construction of a lexical transducer for Korean tha t can be used for s temming a n d generation. The method contains two innovations: (1) two h.'vel rules ms well-formedness constraints in the initial phase; (2) the combinat ion of intersection and composit ion of rule t ransducers in a dee[) cascade ['or the final re.suit.

We argue for the usefulness of an active chart as the basis of a system that searches for the globally most plausible explanation of failure to syntactically parse a given input. We suggest semantics-free, grammarindependent techniques for parsing inputs displaying simple kinds of ill-formedness and discuss the search issues involved.

During the sixties two level van Wijngaarden grammars (2vwg) were introduced for the formal definition of Algol 68. Two level van Wijngaarden grammars provide a formalism suited for writing rigorous formal definitions which read like human prose. Both the context free and context sensitive syntax of Algol 68 are defined in 2vwg. However, the specification is not executable. The Extended Affix G...