Green's relations, regularity and abundancy for semigroups of quasi-onto transformations

Let V be an infinite-dimensional vector space and for every infinite cardinal n such that n≤dimV, let AE(V,n) denote the semigroup of all linear transformations of V whose defect is less than n. In 2009, Mendes-Gonçalves and Sullivan studied the ideal structure of AE(V,n). Here, we consider a similarly-defined semigroup AE(X,q) of transformations defined on an infinite set X. Quite surprisingly, the results obtained for sets differ substantially from the results obtained in the linear setting.

Refinement and variability techniques in model transformation of software requirements

Tese de Doutoramento em Tecnologias e Sistemas de Informação

Brazil's global aspirations and their implications for the relationship with Argentina in the framework of MERCOSUR

Dissertação de mestrado em Relações Internacionais

From software extensions to product lines of dataflow programs

Abstract Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE-speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the ReFlO tool and present two non-trivial case studies as evidence of our work’s generality