lm2001.bib
@comment{{This file has been generated by bib2bib 1.99}}
@comment{{Command line: bib2bib -oc lm2001.keys -ob lm2001.bib -c 'export = "yes" and year=2001' lm.bib ../euprovenance.bib ../ops.bib}}
@comment{{This file has been generated by bib2bib 1.99}}
@comment{{Command line: bib2bib -ob lm.bib -oc lm.keys -c 'export = "yes"' ../lm.bib}}
@article{Moreau-Duprat:ACTA01,
author = {Luc Moreau and Jean Duprat},
title = {{A Construction of Distributed Reference Counting}},
journal = {Acta Informatica},
year = 2001,
volume = 37,
pages = {563--595},
jpagecount = {33},
export = {yes},
doi = {10.1007/PL00013315},
eprints = {https://eprints.soton.ac.uk/258935/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/acta01.pdf},
abstract = {Distributed reference counting is a general purpose technique, which may be
used, e.g., to detect termination of distributed programs or to implement
distributed garbage collection. We present a distributed reference counting
algorithm and a mechanical proof of correctness carried out using the proof
assistant Coq. The algorithm is formalised by an abstract machine, and its
correctness has two different facets. The safety property ensures that if
there exists a reference to a resource, then its reference counter will be
strictly positive. Liveness guarantees that if all references to a resource
are deleted, its reference counter will eventually become null.}
}
@article{Moreau:SCP01,
authonnr = {Luc Moreau},
title = {{Distributed Directory Service and Message Routing for Mobile Agents}},
journal = {Science of Computer Programming},
year = 2001,
volume = 39,
number = {2--3},
pages = {249--272},
jpagecount = {24},
doi = {10.1016/S0167-6423(00)00011-3},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/mob.pdf},
eprints = {https://eprints.soton.ac.uk/254479/},
export = {yes},
pind = {EZ~01~01~11},
abstract = {Research about networks and agents has identified the need for a
layer that provides a uniform protocol to communicate with fixed
and mobile agents. In order to preserve the compatibility with
existing infrastructures, proposed solutions have involved a
``home agent'', which forwards messages to a mobile entity. The
mechanism of a home agent puts a burden on the infrastructure,
which may hamper the scalability of the approach, in particular,
in massively distributed systems, such as the amorphous computer
or the ubiquitous/pervasive computing environment. Free from any
compatibility constraint, we have designed an algorithm to route
messages to mobile agents that does not require any fixed
location. The algorithm has two different facets: a distributed
directory service that maintains distributed information about
the location of a mobile agent, and a message router that uses
the directory service to deliver messages to a mobile agent. Two
properties of the algorithm were established. The safety property
ensures that messages are delivered to the agent they were aimed
at, whereas the liveness property guarantees that messages
eventually get delivered. A mechanical proof of the properties
was carried out using the proof assistant Coq.}
}
@article{ukmas01,
volume = {16},
number = {3},
title = {Multi-agent systems research into the 21st century},
author = {M. d'Inverno and M. Luck and UKMAS 2001 Contributors},
year = {2001},
pages = {271--275},
journal = {Knowledge Engineering Review},
eprints = {https://eprints.soton.ac.uk/256369/},
doi = {10.1017/S0269888901000169},
export = {yes},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/mas21.pdf},
abstract = {There is little doubt that the strength and breadth of UK research into multi-agent systems continues to grow as we move into the new millennium. In the middle of an extremely cold December in 2000, the Third UK Workshop on Multi-Agent Systems (UKMAS 2001) was held at St Catherine's College, Oxford. This was the fifth such meeting in as many years, generously sponsored by EPSRC, FIPA (The Foundation for Intelligent Physical Agents) and Hewlett Packard.}
}
@inproceedings{Moreau:AA2001,
author = {Don Cruickshank and Luc Moreau and David De Roure},
title = {{Architectural Design of a Multi-Agent System for Handling Metadata Streams }},
booktitle = {The fifth ACM International Conference on Autonomous Agents},
optcrossref = {},
optkey = {},
pages = {505--512},
pagecount = {8},
isbn = {1-58113-326-X},
export = {yes},
year = {2001},
opteditor = {},
optvolume = {},
optnumber = {},
optseries = {},
doi = {10.1145/375735.376429},
eprints = {https://eprints.soton.ac.uk/256349/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/aa01.pdf},
address = {Montreal, Canada},
month = may,
optorganization = {},
optpublisher = {},
optnote = {},
optannote = {},
abstract = {We have designed a multi-agent architecture to deliver metadata
streams synchronously with multimedia streams over a wide-area
network. To this end, we have devised a simple protocol for
synchronising agents to a media clock. This protocol defines the
concept of deadline, after which servers can drop data because it
can no longer reach clients in time. We also introduce a new
concept of contract as a first-class entity representing a
successful subscription; a contract is used by agents as a
session identifier during the navigation of streams. Quality of
service is a vital element of this architecture because of the
need to deliver metadata on time. As a result, our architecture
supports various communication protocols, including UDP, RMI,
SSL, or multicast. This resulted in a return to a more
declarative form of speech acts, totally orthogonal to a notion
of virtual communication channel used to manage the quality of
service of communication.}
}
@techreport{Hartel-Moreau:Tech2001,
author = {Pieter H. Hartel and Luc Moreau},
title = {Formalising the safety of Java, the Java Virtual Machine and Java Card},
institution = {University of Twente},
year = 2001,
page = 35,
export = {yes},
number = {TR-CTIT-01-07},
pind = {EZ~02~01~17},
url = {http://www.ub.utwente.nl/webdocs/ctit/1/00000050.pdf},
pages = {41},
month = feb,
abstract = {We review the existing literature on Java safety, emphasizing
formal approaches, and the impact of Java safety on small
footprint devices such as smart cards. The conclusion is that while a lot
of good work has been done, a more concerted effort is needed to build
a coherent set of machine readable formal models of the whole of Java
and its implementation. This is a formidable task but we believe it is
essential to building trust in Java safety, and thence to achieve
ITSEC level 6 or Common Criteria level 7 certification for Java programs.}
}
@article{Hartel-Moreau:2001,
author = {Pieter H. Hartel and Luc Moreau},
title = {{Formalising the Safety of Java, the Java Virtual Machine and Java Card}},
journal = {ACM Computing Surveys},
year = 2001,
export = {yes},
volume = 33,
number = 4,
pages = {517--558},
jpagecount = {42},
month = dec,
issn = {0360-0300},
doi = {10.1145/503112.503115},
eprints = {https://eprints.soton.ac.uk/256393/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/acmcs.pdf},
abstract = {We review the existing literature on Java safety, emphasizing
formal approaches, and the impact of Java safety on small footprint
devices such as smart cards. The conclusion is that while a lot of
good work has been done, a more concerted effort is needed to build
a coherent set of machine readable formal models of the whole of
Java and its implementation. This is a formidable task but we
believe it is essential to building trust in Java safety, and
thence to achieve ITSEC level 6 or Common Criteria level 7
certification for Java programs.}
}
@inproceedings{Moreau:IEE2001,
author = {Luc Moreau and Victor Tan and Nicholas Gibbins},
title = {Transparent Migration of Mobile Agents},
booktitle = {IEE Seminar: Mobile Agents --- Where are They Going?},
pages = {2/1--2/11},
pagecount = {11},
year = 2001,
address = {Savoy Place, London},
issn = {0963--3308},
month = apr,
doi = {10.1049/ic:20010002},
eprints = {https://eprints.soton.ac.uk/256394/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/iee.pdf},
export = {yes},
pind = {EZ~3~3~04},
organization = {IEE},
abstract = {SoFAR, the SOuthampton Framework for Agent Research, is used to build a
pervasive information system, which provides context-adapted information to
mobile users. Mobile agents are used as intermediaries between mobile users
and the fixed infrastructure, migrating to locations with resources
adapted to their objectives. SoFAR is equipped with an algorithm for tracking
mobile agents and for transparently routing messages to them, without assuming
the existence of any fixed or centralised control. In this paper, we present
the algorithm and describe how it was integrated in the declarative style of
SoFAR communications. Then, we present the agent meeting room: the
realisation, in the agent framework, of a mechanism by which mobile users may
exchange information during meetings.}
}
@inproceedings{Tan-Moreau:SEMAS2001,
author = {Hock Kim Tan and Luc Moreau},
title = {{Mobile Code for Key Propagation}},
booktitle = {{First International Workshop on
Security of Mobile MultiAgent Systems (SEMAS'2001)}},
optcrossref = {},
optkey = {},
pages = {159--180},
pagecount = {10},
year = {2001},
export = {yes},
magnitude = {yes},
editor = {Klaus Fischer and Dieter Hutter},
optvolume = {},
optnumber = {},
optseries = {},
address = {Montreal, Canada},
month = may,
eprints = {https://eprints.soton.ac.uk/256396/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/semas01.pdf},
volume = 63,
series = {Electronic Notes in Theoretical Computer Science Volume 63},
optnote = {},
optannote = {},
abstract = {We introduce the concept of keylets, which are mobile code used
to control the propagation of keys in a system, as well as a
technique for mobile agent code security that involves encryption
of partitioned code components. Keylets are used to support this
technique by directing the distribution of keys that decrypt the
encrypted components. Formalisation for keylet operations are
presented, and a scenario illustrating the use of keylets to
implement the technique for mobile agent code security is
detailed.}
}
@article{Moreau:HOSC2001,
author = {Luc Moreau},
title = {{Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation}},
journal = {Higher-Order and Symbolic Computation},
year = {2001},
eprints = {https://eprints.soton.ac.uk/256397/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/hosc01.pdf},
doi = {10.1023/A%3A1014455931537},
export = {yes},
pind = {EZ~01~01~11},
optkey = {},
volume = {14},
number = {4},
pages = {357--386},
jpagecount = {30},
month = dec,
note = {(Coloured figures can be found in https://nms.kcl.ac.uk/luc.moreau/papers/hosc01-colour.tar.gz)},
optannote = {},
abstract = {We have recently defined a new algorithm for distributed garbage
collection based on reference-counting [Moreau ICFP98,Moreau-Duprat
ENS99]. At the heart of the algorithm, we find 'tree rerooting', a
mechanism able to reduce third-party dependencies by reorganising
diffusion trees. In reality, the algorithm describes a spectrum of
algorithms according to the policy used to manage messages. In this
paper, we present the implementation of the algorithm and evaluate
its performance. We have implemented two policies, which are
extremes of the spectrum, respectively using and not using tree
rerooting. In addition, two different strategies for managing
action queues have been implemented. The conclusions of our
experimentations are the following. Tree rerooting offers more
parallelism during distributed GC activity; we explain this
phenomenon by the length reduction of causality chains in the
distributed GC. Grouping messages per destination dramatically
reduces the number of messages, but requires a more complex
implementation as messages have to be sorted per destination. Speed
up of 100\% has been observed on some benchmarks.}
}
@inproceedings{Moreau:HT01,
author = {Mark J. Weal and Gareth V. Hughes and David E. Millard and Luc Moreau},
title = {Open Hypermedia as a Navigational Interface to Ontological
Information Spaces},
booktitle = {Proceedings of the Twelveth ACM Conference on Hypertext and
Hypermedia HT'01},
optcrossref = {},
optkey = {},
isbn = {1-59113-420-7},
pages = {227--236},
pagecount = {10},
year = 2001,
opteditor = {},
optvolume = {},
optnumber = {},
optseries = {},
doi = {10.1145/504216.504270},
eprints = {https://eprints.soton.ac.uk/257297/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/ht01.pdf},
export = {yes},
magnitude = {yes},
address = {Aarhus, Denmark},
month = aug,
optorganization = {},
optpublisher = {ACM},
optnote = {},
abstract = {Ontologies provide a powerful tool for distributed agent-based
information systems. However, in their raw form they can be difficult for
users to interact with directly. Different query architectures use structured
query languages as an interface but these still require the users to have an
expert understanding of the underlying ontologies.
By using an Open Hypermedia model as an interface to an ontological information
space, users can interact with such a system using familiar browsing and
navigation techniques, which are translated into queries over the underlying
information. Coupled with dynamic document generation, this allo ws complicated
queries to be made without the user having to interact directly with the
ontologies.
Our key contribution is a notion of hypermedia links between concepts and
queries within an ontological information space. This approach is demonstrated
with a Dynamic CV application built around the SoFAR agent framework and the
Fundamental Open Hypermedia Model (FOHM). In addition to abstracting the
interface, Open Hypermedia allows alternative linkbases to be used to represent
different ``query recipes'', providing different views and navigational
experiences to the user. },
optannote = {}
}
@inproceedings{Tan-Moreau:MA2001,
author = {Hock Kim Tan and Luc Moreau},
title = {{Trust Relationships in a Mobile Agent System}},
booktitle = {Fifth IEEE International Conference on Mobile Agents},
pages = {15--30},
pagecount = {16},
year = 2001,
isbn = {3-540-42952-2},
editor = {Gian Pietro Picco},
volume = 2240,
series = {Lecture Notes in Computer Science},
address = {Atlanta, Georgia},
export = {yes},
magnitude = {yes},
doi = {10.1007/3-540-45647-3_2},
eprints = {https://eprints.soton.ac.uk/256399/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/ma2001.pdf},
month = dec,
publisher = {Springer-Verlag},
abstract = {The notion of trust is presented as an important component in a
security infrastructure for mobile agents. A trust model that can
be used in tackling the aspect of protecting mobile agents from
hostile platforms is proposed. We define several trust
relationships in our model, and present a trust derivation
algorithm that can be used to infer new relationships from existing
ones. An example of how such a model can be utilized in a practical
system is provided.}
}
@proceedings{Agents:AISB2001,
title = {Special Issue on Agents},
year = 2001,
export = {yes},
editor = {Eduardo Alonso and Simon Colton and Daniel Kodenko and Luc
Moreau and Michael Schroeder and Kostas Stathis},
eprints = {https://eprints.soton.ac.uk/257663/},
local = {https://nms.kcl.ac.uk/luc.moreau/papers/aisb-editorial.pdf},
url = {http://www.aisb.org.uk/publications/aisbj/issues/AISBJ%201(1).pdf},
volume = 1,
number = 1,
pages = {1--4},
pagecount = {4},
series = {Journal of the Society for Artificial Intelligence and Social Behaviour},
month = dec,
issn = {1476-3036}
}