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 Luís Lopes

2006

A mobile agent service-oriented scripting language encoded on a process calculus

Authors
Paulino, H; Lopes, L;

Publication
MODULAR PROGRAMMING LANGUAGES, PROCEEDINGS

Abstract
We present a service-oriented scripting language for programming mobile agents in distributed systems. The main novelty of the language we call MOB, is the integration of the service-oriented and mobile agent paradigms. MOB is also encoded onto a process calculus with a well studied semantics. The encoding provides a specification for the front-end of the language compiler and allows us to use, for the back-end and for the run-time system, a compiler and a virtual machine previously developed for the process calculus.

2006

A service-oriented language for programming mobile agents

Authors
Paulino, H; Lopes, L;

Publication
Proceedings of the International Conference on Autonomous Agents

Abstract
In this paper we present MOB, a service-oriented scripting language for programming mobile agents in distributed systems. The main feature of the language is the integration of the service-oriented and the mobile agent paradigms. MOB is encoded onto a process calculus with a well studied semantics which provides us with a tool to prove the soundness of the language relative to the underlying calculus. Copyright 2006 ACM.

2007

A process calculus approach to sensor network programming

Authors
Lopes, L; Martins, F; Silva, MS; Barros, J;

Publication
2007 International Conference on Sensor Technologies and Applications, SENSORCOMM 2007, Proceedings

Abstract
We present a process calculus that models the communication and computational aspects of sensor network applications. The calculus focuses on a basic set of primitives for programming sensor networks that support code deployment, communication and local processing, and provides a very expressive core-language. The calculus and its associated theory provide the tools to verify the robustness of sensor network applications and protocols. © 2007 IEEE.

2003

Lexically scoped distribution: What you see is what you get

Authors
Ravara, A; Matos, AG; Vasconcelos, VT; Lopes, L;

Publication
Electronic Notes in Theoretical Computer Science

Abstract
We define a lexically scoped, asynchronous and distributed p-calculus, with local communication and process migration. This calculus adopts the network-awareness principle for distributed programming and follows a simple model of distribution for mobile calculi: a lexical scope discipline combines static scoping with dynamic linking, associating channels to a fixed site throughout computation. This discipline provides for both remote invocation and process migration. A simple type system is a straightforward extension of that of the p-calculus, adapted to take into account the lexical scope of channels. An equivalence law captures the essence of this model: a process behavior depends on the channels it uses, not on where it runs. This work was partially supported by the Portuguese Fundação para a Ciencia e a Tecnologia (via CLC, the project MIMO, POSI/CHS/39789/2001, and scholarships POCTI/SFRH/BPD/6782/2001 and POSI/SFRH/BD/7100/20- 01), by the EU FEDER (via CLC) and the EU IST proactive initiative FET- Global Computing (projects Mikado, IST-2001-32222, and Profundis, IST- 2001-33100). We thank Gérard Boudol, Ilaria Castellani, Matthew Hennessy and Francisco Martins, as well as the anonymous referees, for their comments. © 2003 Published by Elsevier Science B.V.

2003

The impact of linearity information on the performance of TyCO

Authors
Martins, F; Lopes, L; Vasconcelos, VT;

Publication
Electronic Notes in Theoretical Computer Science

Abstract
We describe a linear channel inference system for the TyCO programming language, where channel usage is tracked through method invocations as well as definition instantiations. We then apply linear channel information to optimize code generation for a multithreaded runtime system. The impact in terms of speed and space is analyzed. © 2003 Published by Elsevier Science B.V.

2008

A programming language for service-oriented computing with mobile agents

Authors
Paulino, H; Lopes, L;

Publication
SOFTWARE-PRACTICE & EXPERIENCE

Abstract
We present MOB, a service-oriented scripting language, for programming mobile agents. We argue that combining the service-oriented and mobile agent paradigms provides a very natural model for programming a large class of distributed applications. In MOB, mobile agents in a network simultaneously provide and use services. The service interfaces constitute contracts that bind agents among themselves. The language features static type-checking to guarantee that contracts are respected at run-time. Other language features, such as redundant service providers, allow a certain degree of fault-tolerance by allowing applications to switch servers dynamically in case a failure is detected (e.g. a server crash). For these reasons, the target applications we envision more interesting to develop using MOB are services for networks with highly dynamic, volatile resources or simply highly adaptive, reconfigurable applications for more classical networks. The paper presents MOB and its implementation from an application programmer's and a systems developer's view. Copyright (C) 2007 John Wiley & Sons, Ltd.

  • 6
  • 11