Sciweavers

49 search results - page 7 / 10
» Repairing software style using graph grammars
Sort
View
APSEC
2003
IEEE
13 years 11 months ago
Rigorous EBNF-based Definition for a Graphic Modeling Language
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In par...
Yong Xia, Martin Glinz
FSTTCS
2008
Springer
13 years 8 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
WCRE
2003
IEEE
14 years 24 days ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
AGTIVE
1999
Springer
13 years 11 months ago
Support for Design Patterns Through Graph Transformation Tools
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
Ansgar Radermacher
SCP
1998
112views more  SCP 1998»
13 years 7 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer