Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por Jorge Sousa Pinto

2010

Safe Integration of Annotated Components in Open Source Projects

Autores
Areias, S; da Cruz, DC; Henriques, PR; Pinto, JS;

Publicação
ECEASST

Abstract
The decision of using existing software components versus building from scratch custom software is one of the most complex and important choices of the entire development/integration process. However, the reuse of software components raises a spectrum of issues, from requirements negotiation to product selection and integration. The correct tradeoff is reached after having analyzed advantages and issues correlated to the reuse. Despite the reuse failures in real cases, many efforts have been made to make this idea successful. In this context of software reuse in open source projects, we address the problem of reusing annotated components proposing a rigorous approach to assure the quality of the application under construction. We introduce the concept of caller-based slicing as a way of certifying that the integration of a component annotated with a contract into a system will preserve the correct behavior of the former, avoiding malfunctioning after integration. To complement the efforts done and the benefits of slicing techniques, there is also a need to find an efficient way to visualize the main program with the annotated components and the slices. To take full profit of visualization, it is crucial to combine the visualization of the control/data flow with the textual representation of source code. To attain this objective, we extend the notions of System Dependence Graph and Slicing Criterion to cope with annotations. © 2010, Universitatsbibliothek TU Berlin.

2007

Visual Programming with Recursion Patterns in Interaction Nets

Autores
Mackie, I; Pinto, JS; Vilaça, M;

Publicação
ECEASST

Abstract
In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns as a programming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns. © 2007, Universitatsbibliothek TU Berlin.

2009

Iterators, Recursors and Interaction Nets

Autores
Mackie, Ian; Pinto, JorgeSousa; Vilaça, Miguel;

Publicação
CoRR

Abstract

2008

Lissom, a Source Level Proof Carrying Code Platform

Autores
Gomes, Joao; Martins, Daniel; Sousa, SimaoMelode; Pinto, JorgeSousa;

Publicação
CoRR

Abstract

2008

Deriving Sorting Algorithms

Autores
Almeida, JoseBacelar; Pinto, JorgeSousa;

Publicação
CoRR

Abstract

2008

Token-passing Nets for Functional Languages

Autores
Almeida, JB; Pinto, JS; Vilaça, M;

Publicação
Electr. Notes Theor. Comput. Sci.

Abstract
Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the ?-calculus in interaction nets. This work extends token-passing nets to cover a typed functional language equipped with structured types and unrestricted recursion. The resulting interaction system is derived systematically from the chosen big-step operational semantics. Along the way, we actually characterize and discuss several design decisions of token-passing nets and extend them in order to achieve simpler interaction net systems with a higher degree of embedded parallelism.

  • 6
  • 11