Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
The first step of any information visualization system is to enable end user to import their dataset into the system. However, non expert user are faced to the difficult task of ch...
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...