Sciweavers

2722 search results - page 53 / 545
» Automating Language Evolution
Sort
View
LICS
1993
IEEE
15 years 8 months ago
Lambek Grammars Are Context Free
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
Mati Pentus
CE
2008
118views more  CE 2008»
15 years 4 months ago
Assessing creative problem-solving with automated text grading
The work aims to improve the assessment of creative problem-solving in science education by employing language technologies and computational
Hao-Chuan Wang, Chun-Yen Chang, Tsai-Yen Li
UML
2005
Springer
15 years 10 months ago
Transformation-Based Structure Model Evolution
This paper summarizes an approach to support evolution of software models by means of a transformation catalogue. These transformations treat UML class diagram models, OCL constrai...
Fabian Büttner
FM
2009
Springer
127views Formal Methods» more  FM 2009»
15 years 11 months ago
Automated Property Verification for Large Scale B Models
Michael Leuschel, Jérôme Falampin, Fa...