1009 search results - page 136 / 202 » transML: A Family of Languages to Model Model Transformation... |
167
click to vote
ACL
2012
13 years 8 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
191
click to vote
CAISE
2004
Springer
15 years 11 months ago
2004
Springer
Modeling languages have been evolving at a high pace, encouraging the use of automatic code generators for transforming models to programs. Automatic code generators should enable ...
192
click to vote
AGTIVE
2007
Springer
16 years 15 days ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
155
click to vote
CPAIOR
2009
Springer
16 years 27 days ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
136
click to vote
APLAS
2004
ACM
15 years 11 months ago
2004
ACM
In many occasions would one encounter the task of maintaining the consistency of two pieces of structured data that are related by some transform — synchronising bookmarks in di...