Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by HASLab

2011

Revisiting context-aware component interconnection

Authors
Barbosa, LS; Barbosa, MAC; Rodrigues, CJ;

Publication
12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010)

Abstract
Software connectors are external coordination devices which ensure the flow of data and enforce synchronization constraints within a component's network. The specification of software connectors through which context dependent behaviour is correctly propagated remains an open, non trivial issue in their semantics. This paper, building on previous work by the authors, revisits this problem and introduces a model in which context awareness is suitably handled.

2011

Hybridization of Institutions

Authors
Martins, MA; Madeira, A; Diaconescu, R; Barbosa, LS;

Publication
Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings

Abstract
Modal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new results and techniques as well as applications to software specification. In this context, the first contribution of this paper is an attempt to 'universalize' the hybridization idea. Following the lines of [15], where a method to modalize arbitrary institutions is presented, the paper introduces a method to hybridize logics at the same institution-independent level. The method extends arbitrary institutions with Kripke semantics (for multi-modalities with arbitrary arities) and hybrid features. This paves the ground for a general result: any encoding (expressed as comorphism) from an arbitrary institution to first order logic (FOL ) determines a comorphism from its hybridization to FOL. This second contribution opens the possibility of effective tool support to specification languages based upon logics with hybrid features. © 2011 Springer-Verlag.

2011

Hybrid Specification of Reactive Systems: An Institutional Approach

Authors
Madeira, A; Faria, JM; Martins, MA; Barbosa, LS;

Publication
SOFTWARE ENGINEERING AND FORMAL METHODS

Abstract
This paper introduces a rigorous methodology for requirements specification of systems that react to external stimulus by evolving through different operational modes. In each mode different functionalities are provided. Starting from a classical state-machine specification, the envisaged methodology interprets each state as a different mode of operation endowed with an algebraic specification of the corresponding functionality. Specifications are given in an expressive variant of hybrid logic which is, at a later stage, translated into first-order logic to bring into scene suitable tool support. The paper's main contribution is to provide rigorous foundations for the method, framing specification logics as institutions and the translation process as a comorphism between them.

2011

Refinement by interpretation in p-institutions

Authors
Rodrigues, CJ; Martins, MA; Madeira, A; Barbosa, LS;

Publication
Proceedings 15th International Refinement Workshop, Refine 2011, Limerick, Ireland, 20th June 2011.

Abstract
The paper discusses the role of interpretations, understood as multifunctions that preserve and reflect logical consequence, as refinement witnesses in the general setting of p -institutions. This leads to a smooth generalization of the "refinement by interpretation" approach, recently introduced by the authors in more specific contexts. As a second, yet related contribution a basis is provided to build up a refinement calculus of structured specifications in and across arbitrary f-institutions. © C.J. Rodrigues, M.A. Martins, A. Madeira & L.S. Barbosa This work is licensed under the Creative Commons Attribution License.

2011

A language for behavioural modelling of architectural patterns

Authors
Sanchez, A; Barbosa, LS; Riesco, D;

Publication
ACM International Conference Proceeding Series

Abstract
The complexity of interactions governing the coordination of loosely-coupled services, which forms the core of current software, brought behavioural issues up to the front of architectural concerns. This paper takes such a challenge seriously by lifting typical behaviour modelling techniques to the specification of both types and instances of architectural patterns in which the later ones are connected by ports that behave according to a water flow metaphor. A specific language is introduced for this purpose as well as a translator to mCRL2 so that the simulation and analysis techniques available in the corresponding toolset can be used to reason about (the behavioural layer of) software architectures. The approach is illustrated in a few examples. Copyright 2011 ACM.

2011

The Role of Coordination Analysis in Software Integration Projects

Authors
Rodrigues, NF; Oliveira, N; Barbosa, LS;

Publication
ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2011 WORKSHOPS

Abstract
What sort of component coordination strategies emerge in a software integration process? How can such strategies be discovered and further analysed? How close are they to the coordination component of the envisaged architectural model which was supposed to guide the integration process? This paper introduces a framework in which such questions can be discussed and illustrates its use by describing part of a real case-study. The approach is based on a methodology which enables semi-automatic discovery of coordination patterns from source code, combining generalized slicing techniques and graph manipulation.

  • 198
  • 260