João Araújo

João Araújo

Auto-generated profile, based on publicly available information

João Araújo

Department of Informatics, Universidade Nova de Lisboa, Caparica, Portugal

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2003
Verified
Conference Paper
Open access
PDF file
ARAwais Rashid
Awais Rashid
Ana MoreiraAna Moreira
Ana Moreira
JAJoāo Araújo
Joāo Araújo
An effective requirements engineering (RE) approach must harmonise the need to achieve separation of concerns with the need to satisfy broadly scoped requirements and constraints. Techniques such as use cases and viewpoints help achieve separation of stakeholders' concerns but ensuring their consistency with global requirements and constraints is largely unsupported. In this paper we propose an approach to modularise and compose such crosscutting, aspectual requirements. The approach is based on separating the specification of aspectual requirements, non-aspectual requirements and composition rules in modules representing coherent abstractions and following welldefined templates. The composition rules employ informal, and often concern-specific, actions and operators to specify how an aspectual requirement influences or constrains the behaviour of a set of non-aspectual requirements. We argue that such modularisation makes it possible to establish early trade-offs between aspectual requirements hence providing support for negotiation and subsequent decision-making among stakeholders. At the same time early separation of crosscutting requirements facilitates determination of their mapping and influence on artefacts at later development stages. A realisation of the proposed approach, based on viewpoints and the eXtensible Markup Language (XML), supported by a tool called ARCaDe and a case study of a toll collection system is presented

16 January 2006 in IEEE Software
Verified
Journal Article
Closed access
EBElisa Baniassad
Elisa Baniassad
PCP.C. Clements
P.C. Clements
JAJ. Araujo
J. Araujo
Ana MoreiraAna Moreira
Ana Moreira
ARA. Rashid
A. Rashid
Bedir TekinerdoganBedir Tekinerdogan
Bedir Tekinerdogan
Aspect-oriented software development has focused on the software life cycle's implementation phase: developers identify and capture aspects mainly in code. But aspects are evident earlier in the life cycle, such as during requirements engineering and architecture design. Early aspects are concerns that crosscut an artifact's dominant decomposition or base modules derived from the dominant separation-of-concerns criterion, in the early stages of the software life cycle. In this article, we describe how to identify and capture early aspects in requirements and architecture activities and how they're carried over from one phase to another. We'll focus on requirements and architecture design activities to illustrate the points, but the same ideas apply in other phases as well, such as domain analysis or in the fine-grained design activities that lie between architecture and implementation

1 January 2002
Verified
Conference Paper
Closed access
ARA. Rashid
A. Rashid
PSP. Sawyer
P. Sawyer
Ana MoreiraAna Moreira
Ana Moreira
JAJ. Araujo
J. Araujo
Effective RE must reconcile the need to achieve separation of concerns with the need to satisfy broadly scoped requirements and constraints. Techniques such as use cases and viewpoints help achieve separation of stakeholders' concerns but ensuring their consistency with global requirements and constraints is largely unsupported. We build on recent work that has emerged from the aspect-oriented programming (AOP) community to propose a general model for aspect oriented requirements engineering (AORE). The model supports separation of crosscutting functional and non-functional properties at the requirements level. We argue that early separation of such crosscutting properties supports effective determination of their mapping and influence on artefacts at later development stages. A realisation of the model based on a case study of a toll collection system is presented.

13 November 2017 in EMS Surveys in Mathematical Sciences
Verified
Journal Article
Closed access
PDF file
JAJoão Araújo
João Araújo
PCPeter J. Cameron
Peter J. Cameron
BSBenjamin Steinberg
Benjamin Steinberg
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the Černý conjecture , one of the oldest and most famous problems in automata theory, according to which a synchronizing n -state automaton has a reset word of length at most (n-1)^2 .The transitions of an automaton generate a transformation monoid on the set of states, and so an automaton can be regarded as a transformation monoid with a prescribed set of generators. In this setting, an automaton is synchronizing if the transitions generate a constant map. A permutation group G on a set \Omega is said to synchronize a map f if the monoid \langle G,f\rangle generated by G and f is synchronizing in the above sense; we say G is synchronizing if it synchronizes every non-permutation. The classes of synchronizing groups and friends form an hierarchy of natural and elegant classes of groups lying strictly between the classes of primitive and 2-homogeneous groups. These classes have been floating around for some years and it is now time to provide a unified reference on them. The study of all these classes has been prompted by the Černý conjecture, but it is of independent interest since it involves a rich mix of group theory, combinatorics, graph endomorphisms, semigroup theory, finite geometry, and representation theory, and has interesting computational aspects as well. So as to make the paper self-contained, we have provided background material on these topics. Our purpose here is to present recent work on synchronizing groups and related topics. In addition to the results that show the connections between the various areas of mathematics mentioned above, we include a new result on the Černý conjecture (a strengthening of a theorem of Rystsov), some challenges to finite geometers (which classical polar spaces can be partitioned into ovoids?), some thoughts about infinite analogues, and a long list of open problems to stimulate further work.

2 December 2008 in Semigroup Forum
Verified
Journal Article
Closed access
PDF file
JAJoão Araújo
João Araújo
CSCsaba Schneider
Csaba Schneider

1 February 2011 in European Journal of Combinatorics
Verified
Journal Article
Closed access
JAJoão Araújo
João Araújo
MKMichael Kinyon
Michael Kinyon
JKJanusz Konieczny
Janusz Konieczny