76 search results - page 2 / 16 » Executable Grammars in Newspeak |
JSS
2010
13 years 2 months ago
2010
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
PADL
2010
Springer
14 years 4 months ago
2010
Springer
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
BMCBI
2011
13 years 2 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...