@string{lncs = {Lecture Notes in Computer Science}} @InProceedings{Moreau:JFLA92, author = "Luc Moreau", title = {{Programmer dans un langage fonctionel parallèle avec continuations}}, booktitle = {{Avancées Applicatives. Journées Francophones des Langages Applicatifs (JFLA'92)}}, address = "Tréguier, France", pages = "130--153", publisher = "BIGRE", volume = "76--77", month = feb, year = 1992, url = "http://www.ecs.soton.ac.uk/~lavm/papers/jfla92.ps.gz", export = "no", abstract = "Dans cet article, nous montrons que la méthodologie de programmation fonctionnelle avec continuations peut être appliquée pour réaliser des applications parallèles. Cette approche est rendue possible grâce à des opérateurs pour le parallélisme qui sont transparents. La définition de ces opérateurs se base sur une notion de métacontinuation représentant un ordre d'évaluation séquentiel de gauche à droite. Une définition d'un langage fonctionnel avec opérateurs transparents pour le parallélisme est donnée sous forme d'une traduction vers un langage fonctionnel possédant 4 primitives pour le parallélisme du type CCS." } @InProceedings{Moreau:JFLA92:english, author = "Luc Moreau", title = {{Programming in a Parallel Functional Language with Continuations (in French)}}, booktitle = {{Avancées Applicatives. Journées Francophones des Langages Applicatifs (JFLA'92)}}, address = "Tréguier, France", volume = "76--77", pages = "130--153", pagecount="24", publisher = "BIGRE", month = feb, pind = "EZ~01~01~04", year = 1992, url = "http://www.ecs.soton.ac.uk/~lavm/papers/jfla92.ps.gz", export = "yes", abstract = "Dans cet article, nous montrons que la méthodologie de programmation fonctionnelle avec continuations peut être appliquée pour réaliser des applications parallèles. Cette approche est rendue possible grâce à des opérateurs pour le parallélisme qui sont transparents. La définition de ces opérateurs se base sur une notion de métacontinuation représentant un ordre d'évaluation séquentiel de gauche à droite. Une définition d'un langage fonctionnel avec opérateurs transparents pour le parallélisme est donnée sous forme d'une traduction vers un langage fonctionnel possédant 4 primitives pour le parallélisme du type CCS." } @InProceedings{Moreau:PARLE92, author = "Luc Moreau", title = {{An Operational Semantics for a Parallel Language with Continuations}}, booktitle = {{Parallel Architectures and Languages Europe (PARLE'92)}}, year = 1992, pages = "415--430", pagecount="16", series = lncs, number = 605, editor = "D. Etiemble and J.-C. Syre", publisher = "Springer-Verlag", month = jun, address = "Paris, France", pind = "EZ~01~01~04", url = "http://www.ecs.soton.ac.uk/~lavm/papers/parle92.ps.gz", export = "yes", abstract = "Explicit parallelism can be introduced in Scheme by adding the constructs fork, pcall and future. Katz and Weise gave an implementation where those constructs are transparent even when first class continuations are used. In this paper, we formalise this work by giving an operational semantics for a functional language with first class continuations and transparent constructs for parallelism. We introduce a concept of higher order continuation that we call metacontinuation which preserves sequential properties of continuations in a parallel language." } @InProceedings{Moreau-Ribbens:FPCA93, author = "Luc Moreau and Daniel Ribbens", title = {{Sound Rules for Parallel Evaluation of a Functional Language with callcc}}, booktitle = "ACM conference on Functional Programming and Computer Architecture ({FPCA'93})", year = 1993, pages = "125--135", pagecount="11", month = jun, address = "Copenhagen, Denmark", url = "http://www.ecs.soton.ac.uk/~lavm/papers/fpca93.ps.gz", export = "yes", pind = "EZ~02~01~04", abstract = "Observationally equivalent programs are programs which are indistinguishable in all contexts, as far as their termination property is concerned. In this paper, we present rules preserving observational equivalence, for the parallel evaluation of programs using call/cc. These rules allow the capture of continuations in any applicative context and they prevent from aborting the whole computation when a continuation is applied in the extent of the call/cc by which it was reified. As a consequence, these results prove that one can design a functional language with first-class continuations which has transparent constructs for parallelism." } @InProceedings{Moreau-Queinnec:PLILP94, author = "Luc Moreau and Christian Queinnec", title = {{Partial Continuations as the Difference of Continuations. A Duumvirate of Control Operators}}, number = 844, series = lncs, pages = "182--197", pagecount="16", booktitle = "International Conference on Programming Language Implementation and Logic Programming (PLILP'94)", year = 1994, publisher = "Springer-Verlag", address = "Madrid, Spain", month = sep, note = "Also in {\em Les {E}crits d'{I}cslas. {J}anvier-{D}\'{e}cembre 1993}. Rapport de Recherche. LIX RR 93.05. Laboratoire d'Informatique de l'Ecole Polytechnique, 91128 Palaiseau Cedex, France.", url = "http://www.ecs.soton.ac.uk/~lavm/papers/plilp94.ps.gz", export = "yes", pind = "EZ~02~01~04", abstract = "We define a partial continuation as the difference of two continuations. We exhibit, in a single framework, several design choices and their impact on semantics. The ability of partial continuations to manipulate stack frames blurs the nature of dynamic extent; therefore, we introduce a new concept of prefixal extent that characterises the time during which a partial continuation can be reified. We propose two equivalent formal semantics for partial continuations: a context-rewriting system and a cps translation. Two new and realistic examples illustrate both the interest of partial continuations and the expressiveness of our choices." } @Article{Moreau:CAAI, author = "Luc Moreau", title = {{A Parallel Functional Language with First-Class Continuations. Programming Style and Semantics}}, journal = {Computers and Artificial Intelligence}, year = 1995, volume = 14, number = 2, pages = "173--205", Jpagecount="33", export = "yes", pind = "EZ~01~01~11", url = "http://www.ecs.soton.ac.uk/~lavm/papers/caai.ps.gz", abstract = "We present an operational semantics for a functional language with first-class continuations and transparent constructs for parallelism fork and pcall. The sequential semantics of programs with first-class continuations is preserved when parallel evaluation is allowed, by verifying whether some expressions have returned a value before applying a continuation. These expressions are the ones that are evaluated before this continuation is applied in a left-to-right sequential order. An implementation is proposed using a notion of higher-order continuation that we call metacontinuation. This semantics is costless when first-class continuations are not used. Several programs also illustrate the programming style that can be adopted in such a language." } @InProceedings{Moreau:ESOP94, author = "Luc Moreau", title = {{The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations}}, booktitle = "European Symposium on Programming ({ESOP'94})", year = 1994, pages = "424--438", pagecount="15", month = apr, series = lncs, number = 788, publisher = "Springer-Verlag", address = "Edinburgh, Scotland", url = "http://www.ecs.soton.ac.uk/~lavm/papers/esop94.ps.gz", export = "yes", pind = "EZ~01~01~04", abstract = "We present the PCKS-machine an abstract machine which evaluates parallel functional programs with first-class continuations. The PCKS-machine is a MIMD-machine with a shared memory which is commonly used to implement such languages. Parallelism is introduced by a construct pcall which provides a fork-and-join type of parallelism. This construct is expected to be an annotation for parallel evaluation which does not change the meaning of sequential programs. To our knowledge, this is the first implementation of such a language proved to be correct: we proved that an annotated program is observationally equivalent to its non annotated counterpart. This machine is also characterised by the non-speculative invocation of continuations whose interest is illustrated in an application." } @InProceedings{Moreau:TAPSOFT95, author = "Luc Moreau", title = {{Non-speculative and Upward Invocation of Continuations in a Parallel Language}}, booktitle = {{International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95)}}, year = 1995, address = "Aarhus, Denmark", month = may, series= lncs, pages = "726--740", pagecount="15", number = 915, publisher = "Springer-Verlag", url = "http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft95.ps.gz", export = "yes", pind = "EZ~01~01~04", abstract = "A method of preserving the sequential semantics in parallel programs with first-class continuations is to invoke continuations non-speculatively. This method, which prevents a continuation from being invoked as long as its invocation can infringe the sequential semantics, reduces parallelism by the severe conditions that it imposes, especially on upward uses. In this paper, we present new conditions for invoking continuations in an upward way and both preserving the sequential semantics and providing parallelism. This new approach is formalised in the PCKS-machine, which is proved to be correct by showing that it has the same observational equivalence theory as the sequential semantics." } @PhdThesis{Moreau:PhD, author = "Luc Moreau", title = "Sound Evaluation of Parallel Functional Programs with First-Class Continuations", school = "University of Liège", year = 1994, address = "Service d'Informatique, Institut Montefiore B28, 4000 Liège, Belgium", month = jun, abstracturl = "http://www.ecs.soton.ac.uk/~lavm/thesis-abstract/thesis-abstract.html", url = "http://www.ecs.soton.ac.uk/~lavm/thesis-moreau.ps.gz", export = "yes", pind = "EZ~01~01~17", abstract = "The interpreter continuation is the computation that remains to be performed after evaluating a given expression. Some programming languages provide the programmer with two facilities to act on the interpreter continuation: the capture and the invocation. The capture of a continuation consists in packaging up the current interpreter continuation as a first-class object so that it can be manipulated like any other object. The invocation of a continuation discards the current interpreter continuation and resumes the computation with the invoked continuation. The constructs fork and pcall explicitly indicate where parallel evaluations can proceed. These constructs are expected to be transparent: a program using such constructs is supposed to return the same result as in their absence. Traditionally, the semantics of continuations is formulated in a sequential framework; the addition of parallelism to a language with first-class continuations requires to specify a new semantics for continuations. This is the issue addressed in our dissertation, and these are its major contributions: We set up a semantics for first-class continuations such that the meaning of a parallel program is the same as the sequential meaning of the program without the constructs for parallelism. This semantics is formalised in a reduction system that is an extension of the lambda-calculus. The proposed semantics is proved to be sound with respect to the sequential semantics. The soundness criterion used in this proof is the notion of observational equivalence. We implement this semantics on an abstract machine that models a MIMD architecture with a shared memory, and we prove the correctness of this implementation. The proposed semantics has the following salient features. The capture of a continuation is defined as an operation that avoids sequentialising processes in a parallel computation. A continuation is invoked ``non-speculatively''; that is, a continuation is invoked only when its invocation does not infringe the sequential semantics. Intuitively, in a parallel program, a continuation is invoked only after evaluation of the expressions that are normally evaluated before the invocation of this continuation in the sequential semantics. The non-speculative invocation of a continuation can reduce parallelism because it requires to wait for the values of expressions. In order to preserve as much parallelism as possible, we define the region of use of a continuation as the part of the program where this continuation can be accessed. The region of use can be regarded as a ``black box'' that hides the existence of a continuation because its presence cannot be detected outside its region of use. A symmetric argument suggests that a continuation has an effect on the program only inside its region of use. We prove that in order to invoke a continuation, it is sufficient to preserve the sequential semantics with respect to the expressions inside the region of use." } @TechReport{Moreau:picoscheme, author = "Luc Moreau", title = "{L}a {Compilation}", institution = "University of Li{\`e}ge", year = 1995, month = apr, note = "Lecture Notes, 234 pages.", export = "no" } @InProceedings{Moreau-Ribbens:PSLS95, author = {Luc Moreau and Daniel Ribbens}, title = {{The Semantics of pcall and fork}}, booktitle = {PSLS 95 -- Parallel Symbolic Langages and Systems}, editor = {R. Halstead and T. Ito and C. Queinnec}, year = 1995, pages = "52--77", pagecount="26", address = {Beaune, France}, series= lncs, number = 1068, publisher = "Springer-Verlag", month = oct, url = "http://www.ecs.soton.ac.uk/~lavm/papers/psls95.ps.gz", export = "yes", pind = "EZ~02~01~04", abstract = "We present the semantics of the annotations pcall and fork for parallel evaluation of Scheme. Annotated programs are proved to be behaviourly indistinguishable from their non-annotated counterparts, even in the presence of first-class continuations and side-effects. The semantics takes the form of an abstract machine, which can be regarded as a guideline for an implementation." } @TechReport{Moreau:tech95:3, author = "Luc Moreau", title = {{The Semantics of Future in the Presence of First-Class Continuations and Side-effects}}, institution = "University of Southampton", year = 1995, month = nov, number = "M95/3", note = "Preliminary version of \cite{Moreau:ICFP96}", pages = "1--12", url = "http://www.ecs.soton.ac.uk/~lavm/papers/tech95-3.ps.gz", export = "yes", pind = "EZ~01~01~17", abstract = "We present the first semantics of future in a Scheme-like language which has both side-effects and first-class continuations. Correctness is established by proving that programs annotated by future are behaviourly indistinguishable from their non-annotated counterparts, even though evaluation may be parallel." } @InProceedings{Moreau:ICFP96, author = {Luc Moreau}, title = {{The Semantics of Scheme with Future}}, booktitle = {ACM SIGPLAN International Conference on Functional Programming (ICFP'96)}, year = 1996, address = {Philadelphia, Pennsylvania}, pages = "146--156", pagecount="11", ISSN = "0362-1340", month = may, url = "http://www.ecs.soton.ac.uk/~lavm/papers/icfp96.ps.gz", note = "Also in {\em ACM SIGPLAN Notices\/}, 31(6):146-156, June 1996.", export = "yes", pind = "EZ~01~01~11", abstract = "We present the formal semantics of future in a Scheme-like language which has both side-effects and first-class continuations. Correctness is established by proving that programs annotated by future have the same observable behaviour as their non-annotated counterparts, even though evaluation may be parallel." } @TechReport{Moreau:Tech95:7, author = "Luc Moreau", title = {{The Semantics of Scheme with Future}}, institution = "University of Southampton", year = 1995, number = "M95/7", note = "Extended version of \cite{Moreau:ICFP96}", url = "http://www.ecs.soton.ac.uk/~lavm/papers/future.ps.gz", pages = "1--56", export = "yes", pind = "EZ~01~01~17", abstract = "future is an annotation by which the programmer indicates that some expressions may be evaluated in parallel. We present the formal semantics of future in a Scheme-like language which has both side-effects and first-class continuations. Correctness is established by proving that programs annotated by future have the same observable behaviour as their non-annotated counterparts, even though evaluation may be parallel. In this paper, we describe four abstract machines that highlight different aspects of a programming language with future: The CS-machine, a context-rewriting machine, can be regarded as the sequential semantics of the language we deal with. The P(CS)-machine, also a context-rewriting machine, considers future as a construct that may create parallelism. The fpcks-machine is a refinement of the second machine; it features an explicit shared memory, placeholders, and a notion of legitimacy. The fourth machine, called the fpceks-machine, further refines the fpcks-machine by abandoning busy-waiting and the substitution model used in previous machines." } @TechReport{Moreau:Tech96:3, author = "Luc Moreau", title = {{Correctness of a Distributed-Memory Model for Scheme}}, institution = "University of Southampton", number = "M96/3", year = 1996, url = "http://www.ecs.soton.ac.uk/~lavm/papers/tech963.ps.gz", note = "Extended version of \cite{Moreau:EUROPAR96}", export = "yes", pind = "EZ~01~01~17", abstract = "We propose a high-level approach to program distributed applications; it is based on the annotation future by which the programmer specifies which expressions may be evaluated remotely in parallel. We present the CEKDS-Machine, an abstract machine with a distributed memory, able to evaluate Scheme-like future-based programs. In this paper, we focus on the issue of task migration and prove that task migration is transparent to the user, i.e. task migration does not change the observable behaviour of programs." } @InProceedings{Moreau:EUROPAR96, author = "Luc Moreau", title = {{Correctness of a Distributed-Memory Model for Scheme}}, booktitle = "Second International Europar Conference (EURO-PAR'96)", series= lncs, year = 1996, pages = "615-624", pagecount="10", month = aug, number = 1123, publisher = "Springer-Verlag", address = "Lyon, France", url = "http://www.ecs.soton.ac.uk/~lavm/papers/europar96.ps.gz", export = "yes", pind = "EZ~01~01~04", abstract = "We propose a high-level approach to program distributed applications; it is based on the annotation future by which the programmer specifies which expressions may be evaluated remotely in parallel. We present the CEKDS-Machine, an abstract machine with a distributed memory, able to evaluate Scheme-like future-based programs. In this paper, we focus on the issue of task migration and prove that task migration is transparent to the user, i.e. task migration does not change the observable behaviour of programs." } @InProceedings{Moreau:INTERSYMP96, author = "Luc Moreau", title = {{Continuing into the Future: the Return (Invited Paper)}}, booktitle = "8th International Conference in Systems Research Informatics and Cybernetics (InterSymp'96)", year = 1996, editor = {G. E. Lasker}, pages = "104--109", pagecount="6", number = "ISBN 0921836-42-2", publisher = "International Institute for Advanced Studies in Systems Research and Cybernatics", address = "Baden-Baden, Germany", month = aug, url = "http://www.ecs.soton.ac.uk/~lavm/papers/intersymp96.ps.gz", export = "yes", pind = "EZ~01~01~17", abstract = "future is an annotation that indicates which expressions of a program may be evaluated in parallel. By definition, future is transparent, i.e. annotated programs return the same results as in the absence of annotations. In such a framework, the interaction of parallelism and first-class continuations has been considered as a delicate matter for a long time. Indeed, unrestricted parallelism and first-class continuations may lead to non-deterministic programs, which is contradictory to the notion of annotation. In this paper, we overview the formal semantics of future and first-class continuations. The semantics is an abstract machine that models a parallel computer with a shared memory." } @InProceedings{Moreau:TAPSOFT97, author = "Luc Moreau", title = {{A Syntactic Theory of Dynamic Binding}}, booktitle = "International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97)", series = lncs, volume = 1214, year = 1997, pages = "727--741", pagecount="15", publisher = "Springer-Verlag", address = "Lille, France", month = apr, url = "http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft97.ps.gz", export = "yes", pind = "EZ~01~01~04", abstract = "Dynamic binding, which has always been associated with Lisp, is still semantically obscure to many. Although largely replaced by lexical scoping, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in semantics. This paper presents a syntactic theory that enables the programmer to perform equational reasoning on programs using dynamic binding. The theory is proved to be sound and complete with respect to derivations allowed on programs in ``dynamic-environment passing style''. From this theory, we derive a sequential evaluation function in a context-rewriting system. Then, we exhibit the power and usefulness of dynamic binding in two different ways. First, we prove that dynamic binding adds expressiveness to a purely functional language. Second, we show that dynamic binding is an essential notion in semantics that can be used to define the semantics of exceptions. Afterwards, we further refine the evaluation function into the popular implementation strategy called deep binding. Finally, following the saying that deep binding is suitable for parallel evaluation, we present the parallel evaluation function of a future-based functional language extended with constructs for dynamic binding." } @TechReport{Moreau:tech:dyn, author = "Luc Moreau", title = {{A Syntactic Theory of Dynamic Binding}}, institution = "University of Southampton", year = 1996, number = "M96/4", note = "Extended version of \cite{Moreau:HOSC98}", url = "http://www.ecs.soton.ac.uk/~lavm/papers/dyn.ps.gz", export = "yes", pind = "EZ~01~01~17", abstract= "Dynamic binding, which traditionally has always been associated with Lisp, is still semantically obscure to many. Even though most programming languages favour lexical scope, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in formal semantics. This article presents a syntactic theory that enables the programmer to perform equational reasoning on programs using dynamic binding. The theory is proved to be sound and complete with respect to derivations allowed on programs in 'dynamic-environment passing style'. From this theory, we derive a sequential evaluation function in a context-rewriting system. Then, we further refine the evaluation function in two popular implementation strategies: deep binding and shallow binding with value cells. Afterwards, following the saying that deep binding is suitable for parallel evaluation, we present the parallel evaluation function of a future-based functional language extended with constructs for dynamic binding. Finally, we exhibit the power and usefulness of dynamic binding in two different ways. First, we prove that dynamic binding adds expressiveness to a purely functional language. Second, we show that dynamic binding is an essential notion in semantics that can be used to define exceptions." } @Misc{Nexeme:home-page, key="nexeme", title = {{NeXeme Home Page}}, howpublished = "{\tt http://www.ecs.soton.ac.uk/$\sim$lavm/NeXeme}", url = "http://www.ecs.soton.ac.uk/~lavm/NeXeme", export = "no" } @InProceedings{Moreau-DeRoure-Foster:EUROPAR97, author = "Luc Moreau and David DeRoure and Ian Foster", title = {{NeXeme: a Distributed Scheme Based on Nexus}}, booktitle = "Third International Europar Conference (EURO-PAR'97)", series= lncs, volume= 1300, pages= "581--590", pagecount="10", year = 1997, month = aug, publisher = "Springer-Verlag", address = "Passau, Germany", url = "http://www.ecs.soton.ac.uk/~lavm/papers/rsr-europar97.ps.gz", export = "yes", pind = "EZ~03~02~04", abstract = "The remote service request, a form of remote procedure call, and the global pointer, a global naming mechanism, are two features at the heart of Nexus, a library for building distributed systems. NeXeme is an extension of Scheme that fully integrates both concepts in a mostly-functional framework, hence providing an expressive language for distributed computing. This paper presents a semantics for this Scheme extension, and also describes a NeXeme implementation, including its distributed garbage collector." } @Unpublished{Moreau-DeRoure:RJ97, author = "Luc Moreau and David DeRoure", title = {{A Distributed Garbage Collector for NeXeme}}, note = "Research Journal, University of Southampton", year = 1997, url = "http://www.ecs.soton.ac.uk/~lavm/papers/rj97.ps.gz", export = "yes", pind = "EZ~02~02~17", abstract = "The remote service request, a form of remote procedure call, and the global pointer, a global naming mechanism, are two features at the heart of Nexus, a library to build distributed systems. nexeme is an extension of Scheme that fully integrates both concepts in a mostly-functional framework. This short paper describes the distributed garbage collector that we implemented in nexeme." } @TechReport{Moreau-Queinnec:RR97, author = "Luc Moreau and Christian Queinnec", title = {{On the Finiteness of Resources in Distributed Computing}}, institution = "INRIA", year = 1997, type = "Research Report", number = "RR-3147", month = apr, url = "http://www.inria.fr/RRRT/RR-3147.html", export = "yes", pind = "EZ~02~01~17", abstract = "Millions of computers are now connected together by the Internet. At a fast pace, applications are taking profit of these new capabilities, and become parallel and distributed, e.g. applets on the WWW or agent technology. As we live in a world with finite resources, an important challenge is to be able to control computations in such an environment. For instance, a user might like to suspend a computation because another one seems to be more promising. In this paper, we present a paradigm that allows the programmer to monitor and control computations, whether parallel or distributed, by mastering their resource consumption." } @InProceedings{Moreau-Queinnec:DSL97, author = "Luc Moreau and Christian Queinnec", title = {{Design and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing}}, booktitle = "Usenix Conference on Domain-Specific Languages (DSL'97)", address = "Santa-Barbara, California", publisher="Usenix", year = 1997, pages = "183--197", pagecount="15", month = oct, url = "http://www.ecs.soton.ac.uk/~lavm/papers/dsl97.ps.gz", export = "yes", pind = "EZ~02~01~04", abstract = "This paper describes the semantics of Quantum, a language that was specifically designed to control resource consumption of distributed computations, such as mobile agent style applications. In Quantum, computations can be driven by mastering their resource consumption. Resources can be understood as processors cycles, geographical expansion, bandwidth or duration of communications, etc. We adopt a generic view by saying that computations need energy to be performed. Quantum relies on three new primitives that deal with energy. The first primitive creates a tank of energy associated with a computation. Asynchronous notifications inform the user of energy exhaustion and computation termination. The other two primitives allow us to implement suspension and resumption of computations by emptying a tank and by supplying more energy to a tank. The semantics takes the form of an abstract machine with explicit parallelism and energy-related primitives." } @TechReport{Moreau:gc, author = "Luc Moreau", title = "A {D}istributed {G}arbage {C}ollector with {D}iffusion {T}ree {R}eorganisation and {O}bject {M}obility", institution = "University of Southampton", year = 1997, number = "M97/2", month = oct, pind = "EZ~01~01~17", url = "http://www.ecs.soton.ac.uk/~lavm/papers/dgc.ps.gz", note = "Extended version of \cite{Moreau:ICFP98}" } @InProceedings{Moreau-Queinnec:ICCL98, author = {Luc Moreau and Christian Queinnec}, title = {{Distributed Computations Driven by Resource Consumption}}, booktitle = {IEEE International Conference on Computer Languages (ICCL'98)}, year = 1998, address = {Chicago, Illinois}, publisher="IEEE", url = "http://www.ecs.soton.ac.uk/~lavm/papers/iccl98.ps.gz", pages = "68--77", pagecount="10", isbn = "0-8186-8454-2", month = may, export = "yes", pind = "EZ~02~01~04", abstract = "Millions of computers are now connected together by the Internet. At a fast pace, applications are taking advantage of these new capabilities, and are becoming parallel and distributed, e.g. applets on the WWW or agent technology. As we live in a world with finite resources, an important challenge is to be able to control computations in such an environment. For instance, a user might like to suspend a computation because another one seems to be more promising. In this paper, we present a paradigm that allows the programmer to monitor and control computations, whether parallel or distributed, by mastering their resource consumption. We describe an implementation on top of the thread library PPCR and the message-passing library Nexus." } @Article{Moreau:HOSC98, author = "Luc Moreau", title = {{A Syntactic Theory of Dynamic Binding}}, journal = "Higher-Order and Symbolic Computation", year = "1998", pages= "233-279", Jpagecount="47", volume=11, number=3, month=dec, issn="1388-3690", export = "yes", pind = "EZ~01~01~11", abstract= "Dynamic binding, which traditionally has always been associated with Lisp, is still semantically obscure to many. Even though most programming languages favour lexical scope, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in formal semantics. This article presents a syntactic theory that enables the programmer to perform equational reasoning on programs using dynamic binding. The theory is proved to be sound and complete with respect to derivations allowed on programs in 'dynamic-environment passing style'. From this theory, we derive a sequential evaluation function in a context-rewriting system. Then, we further refine the evaluation function in two popular implementation strategies: deep binding and shallow binding with value cells. Afterwards, following the saying that deep binding is suitable for parallel evaluation, we present the parallel evaluation function of a future-based functional language extended with constructs for dynamic binding. Finally, we exhibit the power and usefulness of dynamic binding in two different ways. First, we prove that dynamic binding adds expressiveness to a purely functional language. Second, we show that dynamic binding is an essential notion in semantics that can be used to define exceptions." } @InProceedings{Moreau:PAAM98, author = "Luc Moreau and Nicholas Gray", title = {{A Community of Agents Maintaining Links in the World Wide Web (Preliminary Report)}}, booktitle = "The Third International Conference and Exhibition on The Practical Application of Intelligent Agents and Multi-Agents", year = 1998, address = "London, UK", pages = "221--235", pagecount="15", url = "http://www.ecs.soton.ac.uk/~lavm/papers/gcWWW.ps.gz", month = mar, export = "yes", pind = "EZ~02~02~04", abstract = "In this paper we present an agent architecture to maintain link integrity in the World-Wide Web. It consists of a community of agents collaborating to provide services to users, authors and administrators. In summary, agents maintain link integrity when documents are updated, moved, or when WWW sites are reorganised. They also provide authors and administrators with usage information such as documents that are currently bookmarked or documents that are no longer accessed. The architecture is also able to advertise new versions of documents. At a low-level, we use a distributed garbage collection algorithm to trace links and maintain their integrity." } @InProceedings{Moreau-Ribbens-Gribomont:JFLA98, author = "Luc Moreau and Daniel Ribbens and Pascal Gribomont", title = {{Advanced Programming Techniques Using Scheme}}, booktitle = "Journ\'ees Francophones des Languages Applicatifs", year = 1998, address = "Como, Italy", series = {Collection Didactique}, pages = {69--90}, pagecount="22", publisher = {INRIA}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/jfla98.ps.gz", month = feb, export = "yes", pind = "EZ~03~01~17", abstract = "There are not many non-trivial examples that can be used in a course on advanced programming concepts. In this paper, we describe an interactive reducer for lambda terms that combines first-class continuations, macros, delay, and state. We also describe the means by which we induce students to master advanced topics." } @TechReport{Moreau:NeXeme-ug, author = {Luc Moreau}, title = {{NeXeme. A Distributed Scheme Based on Nexus. Reference Manual and User's Guide}}, institution = {University of Southampton}, year = 1997, number = {M97/8}, month = nov, url = "http://www.ecs.soton.ac.uk/~lavm/NeXeme/man/ug.ps", export = "yes", pind = "EZ~01~01~17", abstract = "The remote service request, a form of remote procedure call, and the global pointer, a global naming mechanism, are two features at the heart of Nexus, a library for building distributed systems. NeXeme is an extension of Scheme that fully integrates both concepts in a mostly-functional framework, hence providing an expressive language for distributed computing. This document is both NeXeme reference manual and user's guide." } @Article{Michaelides-Moreau-DeRoure:CSSE:99, author = {Danius Michaelides and Luc Moreau and David DeRoure}, title = {{A Uniform Approach to Programming the World Wide Web}}, journal = {Computer Systems Science and Engineering}, year = 1999, volume = 14, number = 2, pages = {69-91}, Jpagecount="23", url = "http://www.ecs.soton.ac.uk/~lavm/papers/pWWW.ps.gz", export = "yes", pind = "EZ~03~03~11", abstract = "We propose a uniform model for programming distributed Web applications. The model is based on the concept of Web computation places and provides mechanisms to coordinate distributed computations at these places, including peer-to-peer communication between places and a uniform mechanism to initiate computation in remote places. Computations can interact with the flow of HTTP requests and responses, typically as clients, proxies or servers in the Web architecture. We have implemented the model using the global pointers and remote service requests provided by the Nexus communication library. We present the model and its rationale, with some illustrative examples, and we describe the implementation." } @Inproceedings{Moreau:ICFP98, author = {Luc Moreau}, title = {{A Distributed Garbage Collector with Diffusion Tree Reorganisation and Object Mobility}}, booktitle = {Proceedings of the Third International Conference of Functional Programming (ICFP'98)}, year = 1998, url = "http://www.ecs.soton.ac.uk/~lavm/papers/icfp98.ps.gz", month = sep, pages = "204--215", pagecount="12", ISSN = "0362-1340", note = "Also in {\em ACM SIGPLAN Notices\/}, 34(1):204-215, January 1999.", export = "yes", pind = "EZ~01~01~11", abstract="We present a new distributed garbage collection algorithm that is able to reorganise diffusion trees and to support mobile objects. It has a modular design comprising three components: a reliable transport mechanism, a reference-counting based distributed garbage collector for non-mobile objects, and an extra layer that provides mobility. The algorithm is formalised by an abstract machine and is proved to be correct. The safety property ensures that an object may not be reclaimed as long as it is referred to locally or remotely. The liveness property guarantees that unreachable objects will eventually be reclaimed. The mobility property certifies that messages are always forwarded towards more recent mobile object positions." } @String{j-SIGPLAN = "ACM SIG{\-}PLAN Notices"} @Article{Moreau:1996:SSF, author = "Luc Moreau", title = "The semantics of {Scheme} with future", journal = j-SIGPLAN, volume = "31", number = "6", pages = "146--156", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", acknowledgement = ack-nhfb, affiliation = "Southampton Univ., UK", export = "no" } @Article{Moreau:1999:DGC, author = "Luc Moreau", title = "A Distributed Garbage Collector with Diffusion Tree Reorganisation and Mobile Objects", journal = j-SIGPLAN, volume = "34", number = "1", pages = "204--215", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340", bibdate = "Wed Dec 30 14:35:17 1998", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html", acknowledgement = ack-nhfb, affiliation = "University of Southampton", export = "no" } @InProceedings{Moreau:ISMM98, author = "Luc Moreau", title = {{Hierarchical Distributed Reference Counting}}, booktitle = {Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98)}, year = 1998, pages = "57--67", pagecount="11", address="Vancouver, BC, Canada", isbn="1-58113-114-3", month = oct, url = "http://www.ecs.soton.ac.uk/~lavm/papers/ismm98.ps.gz", pind = "EZ~01~01~04", note = "Also in {\em ACM SIGPLAN Notices\/}, 34(3):57--67, March 1999.", export = "yes", abstract ="Massively distributed computing is a challenging problem for garbage collection algorithm designers as it raises the issue of scalability. The high number of hosts involved in a computation can require large tables for reference listing, whereas the lack of information sharing between hosts in a same locality can entail redundant GC traffic. In this paper, we argue that a conceptual hierarchical organisation of massive distributed computations can solve this problem. By conceptual hierarchical organisation, we mean that processors are still able to communicate in a peer to peer manner using their usual communication mechanism, but GC messages will be routed as if processors were organised in hierarchy. We present an extension of a distributed reference counting algorithm that uses such a hierarchical organisation. It allows us to bound table sizes by the number of hosts in a domain, and it allows us to share GC information between hosts in a same locality in order to reduce cross-network GC traffic." } @Article{Moreau-Hall:CJ98, author = {Luc Moreau and Wendy Hall}, title = {{On the Expressiveness of Links in Hypertext Systems}}, journal = {The Computer Journal}, volume = 41, number=7, pages="459--473", Jpagecount="15", year = 1998, export = "yes", pind = "EZ~02~02~11", url = "http://www.ecs.soton.ac.uk/~lavm/papers/lnk.ps.gz", abstract = "In this paper, we study how linking mechanisms contribute to the expressiveness of hypertext systems. For this purpose, we formalise hypertext systems as abstract machines. As the primary benefit of hypertext systems is to be able to read documents non-linearly, their expressiveness is defined in terms of the ability to follow links. Then, we classify hypertext systems according to the power of the underlying automaton. The model allow us to compare embedded vs separate links and simple vs generic links. Then, we investigate history mechanisms, adaptive hypertexts, and functional links. Our conclusion is that simple links, whether embbeded or separate, generic links, and some adaptive links all give hypertext systems the power of finite state automata. The history mechanism confers them the power of pushdown automata, whereas the gener al functional links give them Turing completeness." } @Misc{Moreau-Duprat:COQ, author = {Luc Moreau and Jean Duprat}, title = {{A Construction of Distributed Reference Counting: the Constructive Proof in Coq}}, howpublished = {Available from {\tt http://www.ecs.soton.ac.uk/$\sim$lavm/coq/drc/}}, month = feb, year = 1999, export = "no" } @TechReport{Moreau-Duprat:ENS99, author = {Luc Moreau and Jean Duprat}, title = {{A Construction of Distributed Reference Counting}}, institution = {Ecole Normale Sup\'erieure, Lyon}, year = 1999, number = {RR1999-18}, month = mar, export = "yes", pind = "EZ~02~01~17", url = "http://www.ecs.soton.ac.uk/~lavm/papers/drc.ps.gz", 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-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", pind = "EZ~02~01~11", url = "http://www.ecs.soton.ac.uk/~lavm/papers/acta01.ps.gz", 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." } @InProceedings{Moreau:PDCSIA99, author = {Luc Moreau}, title = {{Implementation and Performance Evaluation of a Distributed Garbage Collection Algorithm}}, booktitle = {Parallel and Distributed Computing for Symbolic and Irregular Applications, PDCSIA'99}, editor={Takayasu Ito and Taiichi Yuasa}, year = 1999, url = "http://www.ecs.soton.ac.uk/~lavm/papers/pdcsia99.ps.gz", publisher = "World Scientific Publishing", address = {Sendai, Japan}, month = jul, export = "yes", pages = "221--241", pagecount="22", isbn="981-02-4139-9", pind = "EZ~01~01~04", abstract="We have recently described an algorithm for distributed garbage collection based on reference-counting; the algorithm describes a spectrum of algorithms according to the policy used to manage messages. In this paper, we describe the implementation of the algorithm and evaluate its performance. We have implemented two policies, which are extremes of the spectrum. The first one uses incdec messages, whose effect is to reorganise the diffusion tree, whereas the other one does not use such messages, which in effect results in Piquer's indirect reference counting. In addition, two different strategies for managing action queues have been implemented. The conclusions of our experimentations are the following. Using incdec messages potentially offers more parallelism in the DGC activity; this phenomenon can be measured by shorter causality chains than with indirect reference counting. Grouping messages per destination dramatically reduces the number of messages to be sent, though requires a more complex implementation as messages have to be sorted per destination." } @InProceedings{Queinnec-Moreau:PDCSIA99, author = {Christian Queinnec and Luc Moreau}, title = {{Graceful Disconnection}}, booktitle = {Parallel and Distributed Computing for Symbolic and Irregular Applications, PDCSIA'99}, editor={Takayasu Ito and Taiichi Yuasa}, year = 1999, publisher = "World Scientific Publishing", url = "http://www.ecs.soton.ac.uk/~lavm/papers/gradisc.ps.gz", address = {Sendai, Japan}, month = jul, export = "yes", pages = "242--252", pagecount="11", isbn="981-02-4139-9", pind = "EZ~02~01~04", abstract = "A distributed object system allows objects to be communicated from site to site disregarding their physical locations. Communicating objects often leaves a trail homing to the site that owns the original object. To shortcut these trails reduces the number of ``zombies'' i.e., sites that are part of the trail but do not need the object for themselves. This paper proposes an algorithm that allows a site to disconnect gracefully that is, without global network synchronization and therefore quickly. This algorithm focuses on the proper treatment of zombies." } @Unpublished{Moreau:FOHM99, author = {Luc Moreau and Sigi Reich and Dave Millard and Hugh Davis}, title = {{Specification of a Fundamental Hypertext Layer and its Use for Interoperability between Hypertext Domains}}, note = {Available from {\tt http://www.ecs.soton.ac.uk/$\sim$lavm/fohm/fhom.ps}}, month = sep, year = 1999, export = "no" } @Misc{Moreau:COQ:MOB, author = {Luc Moreau}, title = {{Distributed Directory Service and Message Router for Mobile Agents: the Constructive Proof in Coq}}, howpublished = {Available from {\tt http://www.ecs.soton.ac.uk/$\sim$lavm/coq/mobility/}}, month = oct, year = 1999, export = "no" } @Book{Moreau:MQRS99, author = {Luc Moreau and Christian Queinnec and Daniel Ribbens and Manuel Serrano}, title = {{Recueil de petits problèmes en Scheme}}, publisher = {Springer}, year = 1999, series = {Collection Scopos}, url = "http://www.cmla.ens-cachan.fr/Utilisateurs/scopos/Moreau/index.html", isbn = "3-540-66043-7", export = "yes", pind = "EZ~04~01~01", abstract = "Scheme est l'un des langages les plus utilisés pour l'initiation à la programmation. Simple et régulier tant dans sa syntaxe que dans sa sémantique, Scheme permet de dépasser l'incommodité du point-virgule pour se concentrer, sans interférence nocive, sur le seul processus calculatoire. Si d'excellents ouvrages d'introduction à Scheme existent en français et en anglais, il manquait un livre d'exercices permettant de faire ses gammes en ce langage. Cet ouvrage comporte près de trois cents exercices, classés par thèmes, suivant une progression régulière et illustrant de nombreuses techniques de programmation. Ils procurent un entrainement intensif à la récursion comme principe fondamental de raisonnement et de résolution de problèmes. La première partie comporte les énoncés répartis en une dizaine de chapitres partant des récursions sur les structures de données les plus simples jusqu'aux plus compliquées: les graphes. Les structures de données modifiables sont ensuite étudiées et sont suivies de problèmes plus substantiels comme d'écrire un «~démineur~» ou de dessiner le monde en Scheme. L'ouvrage s'achève par des exercices sur le processus d'évaluation même: la fameuse fonction eval. La seconde partie contient les solutions commentées de tous les exercices proposés. Ce livre sera utile à tous les étudiants désireux d'apprendre à programmer. Il part du principe que ce n'est qu'en programmant que l'on peut espérer dominer la programmation; c'est la raison d'être de ce livre que de les conduire, à travers tous ces exercices classiques, à une maîtrise de la programmation qui, même si elle s'appuie sur Scheme, s'appliquera également et avec bonheur aux langages impératifs habituels. Les auteurs sont des enseignants européens cumulant, à ce jour, plus de 50 ans d'expérience dans l'enseignement de Scheme. Ce sont également tous des chercheurs dans le domaine des langages fonctionnels de très haut niveau." } @TechReport{Moreau:tech99, author = {Luc Moreau}, title = {{Distributed Directory Service and Message Router for Mobile Agents}}, institution = {University of Southampton}, number = {ECSTR M99/3}, year = 1999, url = "http://www.ecs.soton.ac.uk/~lavm/papers/mob.ps.gz", export = "yes", pind = "EZ~01~01~17", 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{Moreau:SCP01, author = {Luc Moreau}, title = {{Distributed Directory Service and Message Router for Mobile Agents}}, journal = {Science of Computer Programming}, year = 2001, volume = 39, number = {2--3}, pages = {249--272}, Jpagecount="24", url = "http://www.ecs.soton.ac.uk/~lavm/papers/mob.ps.gz", 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." } @InProceedings{Moreau:HT2000, author = {Dave Millard and Luc Moreau and Hugh Davis and Sigi Reich}, title = {{FOHM: A Fundamental Open Hypertext Model for Investigating Interoperability between Hypertext Domains}}, booktitle = {Proceedings of the Eleventh ACM Conference on Hypertext and Hypermedia HT'00}, pages = {93--102}, pagecount="10", year = 2000, isbn = "1-58113-227-1", address = {San-Antonio, Texas}, month = jun, pind = "EZ~04~03~04", url = "http://www.ecs.soton.ac.uk/~lavm/papers/ht00.ps.gz", export = "yes", abstract = "The Open Hypermedia Systems community has been largely concerned with interoperability between hypertext systems which share the same paradigm. It has evolved a component based framework for this purpose, in which specific but incompatible middleware components are designed for each hypertext domain, such as navigational hypertext, spatial hypertext or taxonomic hypertext. This paper investigates the common features of these domains and introduces FOHM, a Fundamental Open Hypertext Model, which defines a common data model and set of related operations that are applicable for all three domains. Using this layer the paper explores the possible semantics of linking between different hypertext domains, and shows that each can introduce features which benefit the other domains." } @InProceedings{Moreau:PAAM00, author = {Luc Moreau and Nick Gibbins and David DeRoure and Samhaa El-Beltagy and Wendy Hall and Gareth Hughes and Dan Joyce and Sanghee Kim and Danius Michaelides and Dave Millard and Sigi Reich and Robert Tansley and Mark Weal}, title = {{SoFAR with DIM Agents: An Agent Framework for Distributed Information Management}}, booktitle = "The Fifth International Conference and Exhibition on The Practical Application of Intelligent Agents and Multi-Agents", month = apr, url = "http://www.ecs.soton.ac.uk/~lavm/papers/sofar.ps.gz", address = "Manchester, UK", pages = {369--388}, pagecount="20", year = {2000}, pind = "EZ~13~12~04", isbn = "1 902426 07 X", export = "yes", abstract = "In this paper we present SoFAR, a versatile multi-agent framework designed for Distributed Information Management tasks. SoFAR embraces the notion of proactivity as the opportunistic reuse of the services provided by other agents, and provides the means to enable agents to locate suitable service providers. The contribution of SoFAR is to combine some ideas from the distributed computing community with the performative-based communications used in other agent systems: communications in SoFAR are based on the startpoint/endpoint paradigm, which is the foundation of Nexus, the communication layer at the heart of the Computational Grid. We explain the rationale behind our design decisions, and describe the predefined set of agents which make up the core of the system. Two distributed information management applications have been written, a general query architecture and an open hypermedia application, and we recount their design and operations." } @TechReport{Moreau-Ribbens:2000, author = {Luc Moreau and Daniel Ribbens}, title = {{Mobile Objects in Java}}, institution = {University of Southampton}, year = {2000}, url = "file:/home/lavm/paper/mobile/java/mobc/report/moj.ps.gz", export = "no", OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @TechReport{Moreau-Tan-Gibbins:2000, author = {Luc Moreau and Victor Tan and Nicholas Gibbins}, title = {{Transparent Migration and Ownership of Mobile Agents}}, institution = {University of Southampton}, year = {2000}, export = "no", OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Moore-Moreau:OHS6, author = {Graham Moore and Luc Moreau}, title = {{From Metadata to Links}}, booktitle = {The Sixth Workshop on Open Hypermedia Systems (OHS 6)}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/md.ps.gz", export = "yes", year = 2000, pages = {77--86}, pagecount="10", volume = 1903, pind = "EZ~2~2~04", series = lncs, address = {San-Antonio, Texas}, month = may, publisher = {Springer-Verlag}, abstract = "Metadata systems are considered to be a powerful and generalised mechanism for extending the properties that constitute an object and for facilitating access to information. However, there is another mechanism, linking, that can also be considered as having the ability to extend the properties of an object and provide systems and users with more useful means of accessing information. In this paper, we represent both metadata and linking as abstract models and show how the metadata model may be expressed in terms of the linking mechanism. Then we discuss the benefits of the more general model of linking." } @InProceedings{Millard-Davis-Moreau:OHS6, author = {Dave Millard and Hugh Davis and Luc Moreau}, title = {{Standardizing Hypertext: Where Next for OHP?}}, booktitle = {The Sixth Workshop on Open Hypermedia Systems (OHS 6)}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ohs6.pdf", export = "yes", year = 2000, pages = {3--12}, pagecount="10", volume = 1903, series = lncs, pind = "EZ~3~3~04", address = {San-Antonio, Texas}, month = may, publisher = {Springer-Verlag}, abstract="Over the last six years the Open Hypermedia Systems Working Group (OHSWG) has be en working in a coordinated effort to produce a protocol which will allow compon ents of an Open Hypermedia System to talk to one another in a standardised manne r. In this paper we reflect on this work and the knowledge that has come out of it, evaluating the differant approaches to standardisation in the light of our e xperiences. We discuss the problems we encountered and redefine the goals of the effort to be more realistic, presenting the Fundamental Open Hypermedia Model (FOHM) as an example of this more realistic approach. Finally we describe a possi ble future path that encompasses the research interests of the OHSWG while still leading ultimately to interoperability." } @TechReport{moreau:dera00, author = {David {DeRoure (Coordinator)} and Luc {Moreau (Editor)} and Michael Butler and Tim Chown and Pieter Hartel}, title = {Study of Security in Multi-Agent Architectures}, institution = {DERA}, year = 2000, url = "http://www.ecs.soton.ac.uk/~lavm/papers/sec.pdf", export = "no", pind = "EZ~5~4~17", number = {Contract CU016-0000000902} } @Misc{Moreau:COQ:FTDDS, author = {Luc Moreau}, title = {{A Fault-Tolerant Distributed Directory Service for Mobile Agents: the Constructive Proof in Coq}}, howpublished = {Available from {\tt http://www.ecs.soton.ac.uk/$\sim$lavm/coq/failure/}}, month = sep, year = 2000, export = "no" } @TechReport{Moreau:FTDDS, author = {Luc Moreau}, title = {{A Fault-Tolerant Distributed Directory Service for Mobile Agents}}, institution = {Submitted for publication}, year = {2000}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Rana-Moreau:UKMAS00, author = {Omer F. Rana and Luc Moreau}, title = {{Issues in Building Agent based Computational Grids}}, booktitle = {Third Workshop of the UK Special Interest Group on Multi-Agent Systems (UKMAS'2000)}, year = 2000, address = {Oxford, UK}, month = dec, pind = "EZ~2~1~04", pages="11", pagecount="11", export = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/ukmas.ps.gz", abstract = "We emphasise and briefly review existing infrastructure required to realise the Computational Grid, and define such Grid with reference to Knowledge and Information Grids. We then propose an agent-based approach for the Computational Grid, which is centered on providing ``services'' for managing resources." } @InProceedings{Moreau:DDEP00, author = {Heather Brown and Peter Brown and Les Carr and Wendy Hall and Wendy Milne and Luc Moreau}, title = {{A Link-Oriented Comparison of Hyperdocuments and Programs}}, booktitle = {Digital Documents: Systems and Principles --- Eighth International Conference on Digital Documents and Electronic Publishing (DDEP'00)}, year = {2004}, editor="King and Munson", url = "http://www.ecs.soton.ac.uk/~lavm/papers/brown.pdf", export = "no", pages="1--12", pagecount="12", address = {Munich, Germany}, pind = "EZ~6~3~04", volume = 2023, series = lncs, isbn= "3-540-21070-9", OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @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", pind = "EZ~3~3~04", year = {2001}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/aa01.ps.gz", 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." } %% to become ACMCS Article @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", pind = "EZ~02~01~11", volume = 33, number = 4, pages = {517--558}, Jpagecount="42", month = dec, issn = "0360-0300", url = "http://www.ecs.soton.ac.uk/~lavm/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, url = "http://www.ecs.soton.ac.uk/~lavm/papers/iee.ps.gz", 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." } @Article{Moreau-Ribbens:PADDA01, author = {Luc Moreau and Daniel Ribbens}, title = {{Mobile Objects in Java}}, journal = {Scientific Programming}, year = {2002}, OPTkey = {}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/padda.pdf", export = "yes", magnitude = "yes", pind = "EZ~02~01~11", volume = {10}, number = {3}, pages = {91--100}, Jpagecount="10", OPTmonth = {}, note = {{Special issue of the International Workshop on Performance-oriented Application Development for Distributed Architectures (PADDA'2001)}}, OPTannote = {}, abstract= "Mobile Objects in Java provides support for object mobility in Java. Similarly to the RMI technique, a notion of client-side stub, called startpoint, is used to communicate transparently with a server-side stub, called endpoint. Objects and associated endpoints are allowed to migrate. Our approach takes care of routing method calls using an algorithm that we studied in [Moreau:SCP01]. The purpose of this paper is to present and evaluate the implementation of this algorithm in Java. In particular, two different strategies for routing method invocations are investigated, namely call forwarding and referrals. The result of our experimentation shows that the latter can be more efficient by up to 19%." } @Misc{magnitude, key = {magnitude}, author = {Luc Moreau and David De Roure and Wendy Hall and Nick Jennings}, title = {{MAGNITUDE: Mobile AGents Negotiating for ITinerant Users in the Distributed Enterprise}}, howpublished = {http://www.ecs.soton.ac.uk/$\sim$lavm/magnitude/}, year = 2001 } @Misc{mohican, key = {mohican}, author = {Luc Moreau and Steve Braithwaite and Nick Jennings and David De Roure}, title = {{MOHICAN: MObile Handsets In Cooperative Agents Network}}, howpublished = {http://www.ecs.soton.ac.uk/~lavm/mohican/}, year = 2001 } @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 = {10}, pagecount="10", year = {2001}, export = "yes", magnitude = "yes", editor = {Klaus Fischer and Dieter Hutter}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Montreal, Canada}, month = may, url = "http://www.ecs.soton.ac.uk/~lavm/papers/semas01.ps.gz", OPTorganization = {DFKI Saarbrucken}, 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}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/hosc01.ps.gz", 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 http://www.ecs.soton.ac.uk/~lavm/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 = {}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/ht01.pdf", export = "yes", magnitude = "yes", address = {Aarhus, Denmark}, month = aug, pind = "EZ~4~4~04", 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 = lncs, address = {Atlanta, Georgia}, export = "yes", magnitude = "yes", pind = "EZ~02~02~04", url = "http://www.ecs.soton.ac.uk/~lavm/papers/ma2001.ps.gz", 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." } @InBook{Moreau:IASE, author = {Luc Moreau and Norliza Mohamad Zaini and Don Cruickshank and David De Roure}, editor = {Valentina Plekhanova}, title = {Intelligent Agent Software Engineering}, chapter = {{SoFAR: An Agent Framework for Distributed Information Management}}, publisher = {Idea Group Publishing}, year = {2003}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTtype = {}, OPTaddress = {}, OPTedition = {}, OPTmonth = {}, pages = {49--67}, pagecount="19", OPTnote = {}, pind = "EZ~04~04~04", isbn="1-59140-046-5", magnitude = "yes", export = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/iase.doc", abstract = "SoFAR, the Southampton Framework for Agent Research, is a versatile multi-agent framework designed for Distributed Information Management tasks. SoFAR embraces the notion of proactivity as the opportunistic reuse of the services provided by other agents, and provides the means to enable agents to locate suitable servic e providers. The contribution of SoFAR is to combine ideas from the distributed computing community with the performative-based communications used in other age nt systems: communications in SoFAR are based on the startpoint/endpoint paradig m, a powerful abstraction that can be mapped onto multiple communication layers. SoFAR also adopts an XML-based declarative approach for specifying ontologies a nd agents, providing a clear separation with their implementation. We explain th e rationale behind our design decisions; we describe two distributed information management applications and we recount their design and operations.", OPTannote = {} } @InProceedings{Tan-Moreau:SAC02, author = {Hock Kim Tan and Luc Moreau}, title = {{Certificates for Mobile Code Security}}, booktitle = {{The 17th ACM Symposium on Applied Computing (SAC'2002) --- Track on Agents, Interactions, Mobility and Systems}}, export = "yes", magnitude = "yes", OPTcrossref = {}, OPTkey = {}, pages = {76--81}, pagecount="6", year = 2002, url = "http://www.ecs.soton.ac.uk/~lavm/papers/sac02b.pdf", pind = "EZ~02~02~04", isbn = "1-58113-445-2", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Madrid, Spain}, month = mar, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="The problem of protecting mobile code from malicious hosts is an important security issue, for which many solutions have been proposed. We describe a method to adapt an existing technique, execution tracing, to enhance its flexibility in deployment for a large scale mobile agent system. This is achieved through the introduction of a trusted third party, the verification server, which undertakes the verification of execution traces on behalf of the platform launching the agent. The server constructs a certificate that testifies to the capability of a particular host platform to undertake the correct execution of a mobile agent. In this sense, the server assumes a role analogous of a Certificate Authority (CA) in a PKI. We briefly discuss the issues associated with such a framework." } @InProceedings{Moreau:SAC02, author = {Luc Moreau}, title = {{A Fault-Tolerant Directory Service for Mobile Agents based on Forwarding Pointers}}, booktitle = {{The 17th ACM Symposium on Applied Computing (SAC'2002) --- Track on Agents, Interactions, Mobility and Systems}}, export = "yes", magnitude = "yes", pind = "EZ~01~01~04", isbn = "1-58113-445-2", OPTcrossref = {}, OPTkey = {}, pages = {93--100}, pagecount="8", year = 2002, url = "http://www.ecs.soton.ac.uk/~lavm/papers/sac02.ps.gz", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Madrid, Spain}, month = mar, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="A reliable communication layer is an essential component of a mobile agent system. We present a new fault-tolerant directory service for mobile agents, which can be used to route messages to them. The directory service, based on a technique of forwarding pointers, introduces some redundancy in order to ensure resilience to stopping failures of nodes containing forwarding pointers; in addition, it avoids cyclic routing of messages, and it supports a technique to collapse chains of pointers that allows direct communications between agents. We have formalised the algorithm and derived a fully mechanical proof of its correctness using the proof assistant Coq; we report on our experience of designing the algorithm and deriving its proof of correctness. The complete source code of the proof is made available from the WWW." } @InProceedings{Moreau:CCGRID2002, author = {Luc Moreau}, title = {{Agents for the Grid: A Comparison with Web Services (Part 1: the transport layer)}}, booktitle = {Second IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID 2002)}, abstract = "The notion of agent has of late become popular in the Grid community, as exemplified by several workshops on the use of agents in the Grid. What are agents for the Grid? What is the difference between agents and Web-services? These are questions that we address by describing a port of the SoFAR agent framework to Web services in the context of a bioinformatics Grid. In this first paper, we focus our discussion solely on issues at the transport layer. Through an agent communication language (ACL) and an abstract communication model, we have been able to define a generic API to communications, and are able to support multiple protocols, including the XML protocol, the transport mechanism of Web services. This approach facilitates the development of applications, makes our environment future-proof, and promotes the open-ness of our Grid architecture to third-party developers.", pages = {220--228}, pagecount="9", year = 2002, pind = "EZ~01~01~04", export = "yes", isbn= "0-7695-1583-5", editor = {Henri E. Bal and Klaus-Peter Lohr and Alexander Reinefeld}, address = {Berlin, Germany}, magnitude = "yes", mygrid = "yes", agent = "yes", month = may, url = "http://www.ecs.soton.ac.uk/~lavm/papers/ccgrid2002.ps.gz", publisher = {IEEE Computer Society} } @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}, pind = "EZ~06~01~08", url = "http://www.ecs.soton.ac.uk/~lavm/papers/aisb-editorial.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" } @InProceedings{Dialani:Europar2002, author = {Vijay Dialani and Simon Miles and Luc Moreau and David De Roure and Michael Luck}, title = {Transparent Fault Tolerance for Web Services based Architectures}, booktitle = "Eighth International Europar Conference (EURO-PAR'02)", series= lncs, volume = 2400, year = 2002, pages="889--898", pagecount="10", export = "yes", month = aug, url = "http://www.ecs.soton.ac.uk/~lavm/papers/fta-europar2002.pdf", mygrid="yes", combichem="yes", ft="yes", publisher = "Springer-Verlag", address = "Padeborn, Germany", pind = "EZ~05~05~04", abstract = "Service-based architectures enable the development of new classes of Grid and distributed applications. One of the main capabilities provided by such systems is the dynamic and flexible integration of services, according to which services are allowed to be a part of more than one distributed system and simultaneously serve different applications. This increased flexibility in system composition makes it difficult to address classical distributed system issues such as fault-tolerance. While it is relatively easy to make an individual service fault-tolerant, improving fault-tolerance of services collaborating in multiple application scenarios is a challenging task. In this paper, we look at the issue of developing fault-tolerant service-based distributed systems, and propose an infrastructure to implement fault tolerance capabilities transparent to services.", OPTnumber = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Zaini:Europar2002, author = {Norliza Zaini and Luc Moreau}, title = {Coordination of Mobile Intermediaries Acting on behalf of Mobile Users}, booktitle = "Eighth International Europar Conference (EURO-PAR'02)", series= lncs, magnitude="yes", volume = 2400, year = 2002, export = "no", month = aug, publisher = "Springer-Verlag", address = "Padeborn, Germany", pind = "EZ~02~02~04", pages="973--976", pagecount="4", url = "http://www.ecs.soton.ac.uk/~lavm/papers/shadow-europar2002.ps.gz", OPTnumber = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="We introduce the notion of a mobile intermediary, called shadow, which is a mobile agent located in the infrastructure, interacting with complex applications on behalf of mobile users. Due to intermittent connectivity, multiple shadow may simultaneously exist. In this paper, we introduce a protocol capable of coordinating these shadows and we present an abstraction layer, hiding away communication and coordination details, which offers a substrate to build distributed applications across mobile devices and fixed infrastructure." } @InProceedings{Moreau-Queinnec:DRES2002, author = {Luc Moreau and Christian Queinnec}, title = {Distributed and Multi-Type Resource Management}, booktitle = {ECOOP'02 Workshop on Resource Management for Safe Languages}, OPTcrossref = {}, OPTkey = {}, pages = {15}, pagecount="15", export = "yes", magnitude = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/dres.pdf", year = {2002}, pind = "EZ~02~01~04", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Malaga, Spain}, month = jun, OPTorganization = {}, OPTpublisher = {}, note = {Short version appears in ECOOP'2002 Workshop Reader, volume 2548 of Lecture Notes in Computer Science, Hernández, Juan; Moreira, Ana (Eds.), 2002, Resource Management for Safe Languages, Grzegorz Czajkowski and Jan Vitek, page 1--14.}, OPTannote = {}, abstract="The authors have previously defined Quantum, a framework for managing resources, which can be used by both providers and consumers of resources to express and program resource-related operations. In this paper, we extend this framework to the distributed setting by introducing distribution-specific operations, and we generalise the framework to support multiple types of resources." } @Article{Tan-Moreau:ENTCS2002, author = {Hock Kim Tan and Luc Moreau}, title = {{Mobile Code for Key Propagation}}, journal = {Electronic Notes in Theoretical Computer Science}, year = 2002, export = "yes", magnitude = "yes", pind="EZ~2~2~11", publisher = {Elsevier}, editor = {Klaus Fischer and Dieter Hutter}, url= "http://www.elsevier.com/locate/entcs/volume63.html", volume = 63, pages = 22, Jpagecount="22", 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." } @InProceedings{Avila-Moreau:AgentCities2002, author = {Arturo Avila-Rosas and Luc Moreau and Vijay Dialani and Simon Miles and Xiaojian Liu}, title = {{Agents for the Grid: A Comparison with Web Services (part II: Service Discovery)}}, booktitle = {Workshop on Challenges in Open Agent Systems}, pind="EZ~5~5~04", OPTcrossref = {}, OPTkey = {}, pages = {5}, pagecount="5", year = {2002}, mygrid = "yes", agent = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/agentcities.ps", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Bologna, Italy}, month = jul, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract= "In order to build an open, large-scale and inter-operable multi-agent system in the context of Grid computing, we are looking at integrating agents technologies with Web Services. In this paper, we address this concern for SoFAR, the Southampton Framework for Agent Research. We focus on all technical aspects of creating, deploying, and publishing agents as Web Services. Not only have we been able to translate SoFAR ontologies and agent behavioural descriptions respectively into XML Schemas and WSDL, but also we have reexpressed in terms of XML Schema validation a pattern matching oriented query language used in discovery mechanism. Using this approach, an agent in the SoFAR framework can be deployed and advertised through a standard discovery mechanism such as UDDI." } @InProceedings{Smithson-Moreau:AP2PC2002, author = {Andrew Smithson and Luc Moreau}, title = {{Engineering an Agent-Based Peer-To-Peer Resource Discovery System}}, booktitle = {First International Workshop on Agents and Peer-to-Peer Computing}, OPTcrossref = {}, OPTkey = {}, pages = {69--80}, pagecount="12", year = 2002, export = "yes", mygrid = "yes", agent = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/ap2pc2002.ps.gz", pind="EZ~2~2~04", editor = {Gianluca Moro and Manolis Koubarakis}, volume = {2530}, OPTnumber = {}, OPTseries = {}, address = {Bologna, Italy}, month = jul, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="We have designed an agent-based peer-to-peer resource discovery system, which combines a set of original features. We distinguish synchronous and asynchronous searches, and structure them in terms of speech acts in an agent communication language. We rely on a distributed reference counting counting mechanism to detect the termination of asynchronous distributed searches. Ontologies are used to define resource descriptors in an extensible and open manner, as well as queries over such resources. A graphical user interface dynamically constructed from available resource descriptors is proposed. The system has been fully implemented in SoFAR, the Southampton Framework for Agent Research." } @InProceedings{Moreau:AOIS02, author = {Luc Moreau and Norliza Zaini and Jing Zhou and Nicholas R. Jennings and Yan Zheng Wei and Wendy Hall and David De Roure and Ian Gilchrist and Mark O'Dell and Sigi Reich and Tobias Berka and Claudia Di Napoli}, title = {{A Market-Based Recommender System}}, booktitle = {Proceedings of the Fourth International Bi-Conference Workshop on Agent-Oriented Information Systems at AAMAS 2002 (AOIS'02)}, OPTcrossref = {}, OPTkey = {}, pages = {18}, pagecount="18", pind="EZ~12~8~04", magnitude = "yes", export = "yes", url = "http://www.ecs.soton.ac.uk/~lavm/papers/aois02.ps", year = 2002, editor = {Paolo Giorgini and Yves Lesp\'erance and Gerd Wagner and Eric Yu}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Bologna, Italy}, month = jul, OPTorganization = {}, publisher = {http://CEUR-WS.org/Vol-59/}, OPTnote = {}, OPTannote = {}, abstract = "We have designed, implemented, deployed and evaluated a large-scale agent-oriented information system that recommends relevant documents to users. Our recommender system is now being used across several European institutions. Its two key features are a modular design capable of accomodating multiple recommendation methods, and the use of a marketplace to select and rank the best recommendations for the user. As part of our evaluation, we have extensively simulated this marketplace in order to understand its dynamics and validate its suitability for a recommender system." } @InProceedings{Tan-Moreau:SEMAS2002, author = {Hock Kim Tan and Luc Moreau}, title = {{Extending Execution Tracing for Mobile Code Security}}, booktitle = {{Second International Workshop on Security of Mobile MultiAgent Systems (SEMAS'2002)}}, OPTcrossref = {}, OPTkey = {}, pages = {51--59}, pagecount="9", year = {2002}, export = "yes", magnitude = "yes", pind="EZ~2~2~04", editor = {Klaus Fischer and Dieter Hutter}, OPTvolume = {}, OPTnumber = {}, series = {DFKI Research Report, RR-02-03}, address = {Bologna, Italy}, month = jun, url = "http://www.ecs.soton.ac.uk/~lavm/papers/semas02.ps.gz", organization = {DFKI Saarbrucken}, OPTnote = {}, OPTannote = {}, abstract= "The problem of protecting mobile code from both denial-of-service and state tampering attacks by malicious hosts are not well addressed in existing techniques for mobile code security. We propose a possible approach based on extending an existing mobile code security technique: cryptographic tracing. This is achieved through the introduction of a trusted third party, the verification server, which undertakes the verification of execution traces on behalf of the agent owner. The interaction between the verification servers and host platforms in the new protocol is outlined. Security properties of the protocol are verified by modelling the system in CSP and checking the resulting state transitions using the model checker FDR. Limitations of this approach to verification are then briefly discussed." } @InProceedings{Moreau:NETTAB2002, author = {Luc Moreau and Simon Miles and Carole Goble and Mark Greenwood and Vijay Dialani and Matthew Addis and Nedim Alpdemir and Rich Cawley and David De Roure and Justin Ferris and Rob Gaizauskas and Kevin Glover and Chris Greenhalgh and Peter Li and Xiaojian Liu and Phillip Lord and Michael Luck and Darren Marvin and Tom Oinn and Norman Paton and Stephen Pettifer and Milena V Radenkovic and Angus Roberts and Alan Robinson and Tom Rodden and Martin Senger and Nick Sharman and Robert Stevens and Brian Warboys and Paul Watson and Chris Wroe}, title = {{On the Use of Agents in a BioInformatics Grid}}, booktitle = {Network Tools and Applications in Biology (NETTAB'2002) --- Agents in Bioinformatics}, url = "http://www.ecs.soton.ac.uk/~lavm/papers/nettab.ps", pind="EZ~31~5~05", OPTcrossref = {}, OPTkey = {}, pages = {14}, pagecount="14", year = {2002}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Bologna, Italy}, month = jul, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, mygrid="yes", agent="yes", export="yes", abstract="MyGrid is an e-Science Grid project that aims to help biologists and bioinformaticians to perform workflow-based {\em in silico\/} experiments, and help to automate the management of such workflows through personalisation, notification of change and publication of experiments. In this paper, we describe the architecture of myGrid and how it will be used by the scientist. We then show how myGrid can benefit from agents technologies. We have identified three key uses of agent technologies in myGrid: {\em user agents\/}, able to customize and personalise data, {\em agent communication languages\/} offering a generic and portable communication medium, and {\em negotiation\/} allowing multiple distributed entities to reach service level agreements." } @InProceedings{Zaini:MA2002, author = {Norliza Zaini and Luc Moreau}, title = {Mobile Intermediaries Supporting Information Sharing between Mobile Users}, booktitle = "{Sixth IEEE International Conference on Mobile Agents (MA'2002)}", series= lncs, magnitude="yes", year = 2002, export = "yes", pages="121--137", pagecount="17", month = oct, publisher = "Springer-Verlag", address = "Barcelona, Spain", pind = "EZ~02~02~04", url = "http://www.ecs.soton.ac.uk/~lavm/papers/ma2002.ps.gz", number = {2535}, OPTnote = {}, OPTannote = {}, abstract="We introduce the notion of a mobile intermediary, called shadow, which is a mobile agent located in the infrastructure, interacting with complex applications on behalf of mobile users. Due to intermittent connectivity, multiple shadow may simultaneously exist. In this paper, we introduce a protocol capable of coordinating these shadows and we present an abstraction layer, hiding away communication and coordination details, which offers a substrate to build distributed applications across mobile devices and fixed infrastructure." } @TechReport{Liu:NS:Descriptions, author = "Xiaojian Liu and Luc Moreau and Vijay Dialani and Simon Miles and Hugo Mills", title = "{MyGrid Notification Service Technical Requirements and Descriptions (Draft 0.3)}", institution = "University of Southampton", year = "2002", mygrid="yes", ns="yes", pind="EZ~5~5~06", OPTkey = "", OPTtype = "", OPTnumber = "", address = "Department of Electronics and Computer Science,University of Southampton SO17 1BJ,United Kingdom", month = "July", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/technical_requirements_draft03.doc", abstract= "This document provides a high level technical requirements of myGrid notification service. It describes the ideas, principles and procedures that will be implemented in order to meet the functional requirements." } @TechReport{Liu:NS:Review, author = "Xiaojian Liu and Luc Moreau and Vijay Dialani and Hugo Mills and Simon Miles", title = "{MyGrid Notification Service Technology Review (Draft 0.2)}", institution = "University of Southampton", year = "2002", mygrid="yes", ns="yes", pind="EZ~5~5~06", OPTkey = "", OPTtype = "", OPTnumber = "", address = "Department of Electronics and Computer Science,University of Southampton SO17 1BJ,United Kingdom", month = "July", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/technology_review_draft02.doc", abstract= "In this article we present a survey of four messaging technologies in order to gain a better understanding and a clear vision of myGrid notification service. In particular, we compare the features and functionalities of JMS and OMG CORBA notification service at specification level and discuss their suitability for MyGrid notification service designs." } @TechReport{Liu:NS:WSDL, author = "Xiaojian Liu and Luc Moreau and Vijay Dialani and Simon Miles", title = "{MyGrid Notification Service Alpha Release 1.0 WSDL Interface Description (Draft 0.2)}", institution = "University of Southampton", year = "2002", mygrid="yes", ns="yes", pind="EZ~4~4~06", OPTkey = "", OPTtype = "", OPTnumber = "", address = "Department of Electronics and Computer Science,University of Southampton SO17 1BJ,United Kingdom", month = "September", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/interface_wsdl_draft02.doc", abstract= "MyGrid notification service alpha 1.0 is described in WSDL. The WSDL document specifies the data types, the messages and the ports the service exposes. The section of the WSDL document is comprised of abstract definitions where SOAP messages are defined in a platform- and language-independent manner. In the bottom section of the WSDL document the site-specific matters such as protocol and serialization are defined. This document provides a detail explanation of notification service interfaces as specified in the WSDL document." } @TechReport{Liu:NS:quickstart, author = "Xiaojian Liu and Luc Moreau and Vijay Dialani and Simon Miles and Hugo Mills", title = "{MyGrid Notification Service Alpha 1.0 Quick Start}", institution = "University of Southampton", year = "2002", mygrid="yes", ns="yes", pind="EZ~5~5~06", OPTkey = "", OPTtype = "", OPTnumber = "", address = "Department of Electronics and Computer Science,University of Southampton SO17 1BJ,United Kingdom", month = "September", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/quickstart.doc", abstract= "This manual serves as a quick start to the notification service alpha 1.0, covering installation, building, configuration and deployment." } @TechReport{Liu:NS:UserGuide, author = "Xiaojian Liu and Luc Moreau and Vijay Dialani and Simon Miles and Hugo Mills", title = "{MyGrid Notification Service Alpha Release 1.0 User's Guide}", institution = "University of Southampton", year = "2002", mygrid="yes", ns="yes", pind="EZ~5~5~06", OPTkey = "", OPTtype = "", OPTnumber = "", address = "Department of Electronics and Computer Science,University of Southampton SO17 1BJ,United Kingdom", month = "September", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/userguide.doc", abstract= "The Notification Service alpha 1.0 User's Guide provides information about using the notification service. This includes an overview of the notification service, the functionalities that the current release provides and the development of client applications in different ways depending on your needs. The User's Guide may be used in conjunction with the Quick Start and the WSDL Interface Explanation document which are now available from http://www.ecs.soton.ac.uk/~lavm/papers/reports/interface_wsdl_draft02.doc" } @TechReport{Miles:Security, author = "Miles, Simon and Moreau, Luc and Mills, Hugo and Tan, Hock and Liu, Xiaojian and Decker, Keith and {di Napoli}, Claudia and Dialani, Vijay and Payne, Terry", title = "{Grid Security Infrastructure Position Paper}", institution = "Intelligence, Agents and Multimedia group; Electronics and Computer Science Department; University of Southampton", year = "2002", mygrid="yes", security="yes", pind="EZ~9~8~06", OPTkey = "", OPTtype = "", OPTnumber = "", OPTaddress = "", OPTmonth = "", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/SecurityArchitecture.pdf", abstract= "Proposal for a cross-domain X509-certificate based authentication mechanism, and access control based on proxy certificates and/or role-certificates." } @TechReport{Miles:Component, author = "Miles, Simon and Moreau, Luc and Dialani, Vijay and Liu, Xiaojian and Mills, Hugo", title = "{myGrid Framework Technical Specification}", institution = "Intelligence, Agents and Multimedia group; Electronics and Computer Science Department; University of Southampton", year = "2002", mygrid="yes", framework= "yes", pind="EZ~5~5~06", OPTkey = "", OPTtype = "", OPTnumber = "", OPTaddress = "", OPTmonth = "", OPTnote = "", OPTannote = "", url="http://www.ecs.soton.ac.uk/~lavm/papers/reports/myGridFramework.doc", abstract= "Draft specification for an EJB based component model that would allow us to deploy a service business logic as a mygrid service, where containers would provide default security, support for fault tolerance etc. Services could be exported as OGSA grid services, Web Services or EJBs. A client interface would allow uniform interactions with any of these." } @TechReport{Miles:2003, author = {Simon Miles and Luc Moreau and Xiaojian Liu}, title = {{Design and Evaluation of a Component Model for Grid Services}}, institution = {Department of Electronics and Computer Science. University of Southampton}, year = {2002}, mygrid="yes", framework= "yes", pind="EZ~3~3~06", OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, note = {Submitted for publication}, OPTannote = {}, abstract= "Various standards have been proposed for deployment and discovery of services on the Internet. These include technologies related to Web Services, Enterprise JavaBeans (EJBs) and Grid Services as part of the Open Grid Services Architecture (OGSA). Each is motivated by different concerns, provides different functionality and is evolving to meet future demands. From a client{'}s point of view, these differences can prevent them from making use of the full range of services available as doing so will require considerable effort on their part to follow all the changing standards. From a service provider's point of view, making a service available in a variety of ways to clients would be desirable, but potentially difficult. Furthermore, in trying to distribute functionality between services, such as providing distributed security models, service providers are as hampered by the differences in deployment technology as clients. We propose a nested component model, allowing service developers and providers to achieve several aims in relation to deployment of their Grid services. First, they can separate concerns in their business logic from the on-the-wire protocol specifications. Second, they can deploy their services in a systematic manner. Third, our model allows service providers to configure service behaviour, such as fault tolerance and security, through the use of nested components. Our model also aids clients, by allowing them to interact with services in a protocol-independent manner. In this paper, we describe the design of the component model and evaluate the performance of a prototype implementation based on EJBs." } @Misc{Moreau:RAP2002, author = {Luc Moreau and Christian Queinnec}, title = {Resource Aware Programming Package}, howpublished = {\verb#www.ecs.soton.ac.uk/~lavm/rap#}, month = dec, year = 2002 } @TechReport{UDDIM:2002, author = {Vijay Dialani and Simon Miles and Juri Papay and Luc Moreau}, title = {The architecture of {UDDI-M}}, institution = {University of Southampton}, year = {2002}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Wei-Moreau-Jennings:AAMAS03, author = {Yan Zhen Wei and Luc Moreau and Nicholas R. Jennings}, title = {Recommender Systems: A Market Based Design}, booktitle = {The Second International Joint Conference on Automonous Agents and Multi-Agent Systems (AAMAS'03)}, OPTcrossref = {}, OPTkey = {}, pages = {600--607}, pagecount="8", pind="EZ~3~3~04", magnitude="yes", export = "yes", year = {2003}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Melbourne, Australia}, month = jul, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/aamas2003.ps.gz", abstract="Recommender systems have been widely advocated as a way of coping with the problem of information overload for knowledge workers. Given this, multiple recommendation methods have been developed. However, it has been shown that no one technique is best for all users in all situations. Thus we believe that effective recommender systems should incorporate a wide variety of such techniques and that some form of overarching framework should be put in place to coordinate the various recommendations so that only the best of them (from whatever source) are presented to the user. To this end, we show that a marketplace, in which the various recommendation methods compete to offer their recommendations to the user, can be used in this role. Specifically, this paper presents the principled design of such a marketplace; detailing the auction protocol and reward mechanism and analyzing the rational bidding strategies of the individual recommendation agents." } @TechReport{Moreau:UDDIMT, author = {Simon Miles and Juri Papay and Vijay Dialani and Michael Luck and Keith Decker and Terry Payne and Luc Moreau}, title = {Personalised Grid Service Discovery}, institution = {University of Southampton}, year = {2003}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Lord:find, author = {P. Lord and C. Wroe and R. Stevens and C. Goble and S. Miles and L. Moreau and K. Decker and T. Payne}, title = {Requirements and Views on Semantic Discovery}, OPTcrossref = {}, OPTkey = {}, booktitle = {Submitted for publication}, OPTpages = {}, year = {2003}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, OPTmonth = {}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Moreau:ABCGRID2003, author = {Luc Moreau and Simon Miles and Carole Goble and Mark Greenwood and Vijay Dialani and Matthew Addis and Nedim Alpdemir and Rich Cawley and David De Roure and Justin Ferris and Rob Gaizauskas and Kevin Glover and Chris Greenhalgh and Peter Li and Xiaojian Liu and Phillip Lord and Michael Luck and Darren Marvin and Tom Oinn and Norman Paton and Stephen Pettifer and Milena V Radenkovic and Angus Roberts and Alan Robinson and Tom Rodden and Martin Senger and Nick Sharman and Robert Stevens and Brian Warboys and Anil Wipat and Chris Wroe}, title = {{On the Use of Agents in a BioInformatics Grid}}, mygrid="yes", export="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/abcgrid2003.ps.gz", OPTcrossref = {}, OPTkey = {}, pind="EZ~31~5~04", isbn="0-7695-1919-9", booktitle = {Proceedings of the Third IEEE/ACM CCGRID'2003 Workshop on Agent Based Cluster and Grid Computing}, pages = {653--661}, pagecount="9", year = 2003, agent="yes", editor = {Sangsan Lee and Satoshi Sekguchi and Satoshi Matsuoka and Mitsuhisa Sato}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Tokyo, Japan}, month = may, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="MyGrid is an e-Science Grid project that aims to help biologists and bioinformaticians to perform workflow-based in silico experiments, and help them to automate the management of such workflows through personalisation, notification of change and publication of experiments. In this paper, we describe the architecture of myGrid and how it will be used by the scientist. We then show how myGrid can benefit from agents technologies. We have identified three key uses of agent technologies in myGrid: user agents, able to customize and personalise data, agent communication languages offering a generic and portable communication medium, and negotiation allowing multiple distributed entities to reach service level agreements." } @InProceedings{Moreau:EUROPAR2003, author = {Richard Lawley and Keith Decker and Mike Luck and Terry Payne and Luc Moreau}, title = {Automated Negotiation for Grid Notification Services}, booktitle = "Ninth International Europar Conference (EURO-PAR'03)", agent="yes", mygrid="yes", export="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/europar2003.pdf", pind = "EZ~05~04~04", ISBN="ISBN 3-540-40788-X", OPTcrossref = {}, OPTkey = {}, pages = {384--393}, pagecount="10", year = 2003, OPTeditor = {}, volume = {2790}, OPTnumber = {}, series = lncs, address = {Klagenfurt, Austria}, month = aug, OPTorganization = {}, publisher = "Springer-Verlag", OPTnote = {}, OPTannote = {}, abstract = "Notification Services mediate between information publishers and consumers that wish to subscribe to periodic updates. In many cases, however, there is a mismatch between the dissemination of these updates and the delivery preferences of the consumer, often in terms of frequency of delivery, quality, etc. In this paper, we present an automated negotiation engine that identifies mutually acceptable terms; we study its performance, and discuss its application to a Grid Notification Service. We also demonstrate how the negotiation engine enables users to control the Quality of Service levels they require. " } @Article{Moreau:PPL03, author = {Richard Lawley and Keith Decker and Mike Luck and Terry Payne and Luc Moreau}, title = {Automated Negotiation Between Publishers and Consumers of Grid Notifications}, journal = {Parallel Processing Letter}, year = {2003}, agent="yes", mygrid="yes", export="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/PPL03.pdf", pind = "EZ~05~04~11", OPTkey = {}, volume = {13}, number = {4}, OPTpages = {}, Jpagecount="12", OPTmonth = {}, OPTnote = {}, OPTannote = {}, abstract = "Notification Services mediate between information publishers and consumers that wish to subscribe to periodic updates. In many cases, however, there is a mismatch between the dissemination of these updates and the delivery preferences of the consumer, often in terms of frequency of delivery, quality, etc. In this paper, we present an automated negotiation engine that identifies mutually acceptable terms; we study its performance, and discuss its application to a Grid Notification Service. We also demonstrate how the negotiation engine enables users to control the Quality of Service levels they require. " } @inproceedings{finding:dutta03, author = {Partha S. Dutta and L. Moreau and Nick Jennings}, title = {Finding interaction partners using cognition-based decision strategies}, booktitle = {The IJCAI-2003 workshop on Cognitive Modeling of Agents and Multi-Agent Interactions}, address = "Acapulco, Mexico", pind = "EZ~03~03~04", url="http://www.ecs.soton.ac.uk/~lavm/papers/ijcai-ws03.pdf", month = aug, year = {2003}, pages="10", pagecount="10", export="yes", mohican ="yes", abstract="In this paper, we develop decision making heuristics for rational agents using artefacts of cognition such as observation, learning and memory. Specifically, we extend previous research in this area by incorporating essential aspects of multi-agent interactions such as building behavioural models via observation, selectively choosing interaction partners and forming cooperating groups by identifying mutual capabilities. In particular, we demonstrate that cognitive capabilities enable agents to successfully identify matching partners and establish cooperative groups in a community of selfish agents with varying expertise." } @INPROCEEDINGS{wei:market-rec, author = {Yan Zheng Wei and Luc Moreau and Nicholas R. Jennings}, title = {Market-Based Recommendations: Design, Simulation and Evaluation}, booktitle = {Proc. of the Fifth International Workshop on Agent-Oriented Information Systems (AOIS-2003)}, year = {2003}, month = {July}, pages="22-29", address = {Melbourne, Australia}, url="http://www.ecs.soton.ac.uk/~lavm/papers/aois03.pdf", pages="22--29", pagecount="8", pind = "EZ~03~03~04", export="yes", magnitude ="yes", abstract="This paper reports on the design, implementation, and evaluation of a market-based recommender system that suggests relevant documents to users. The key feature of the system is the use of market mechanisms to shortlist recommenda- tions in decreasing order of user perceived quality. Essentially, the marketplace gives recommending agents the in- centive to adjust their bids to different levels according to their belief about the corresponding user perceived quality. In order to test the efficiency of our marketplace design, this paper reports on our simulation results for different types of users with different information needs. In this context, we demonstrate that the bids from recommendations with different user perceived quality levels converge at different price levels and that the bidding agents can relate their bids to their internal belief about the quality of their recommendations." } @InBook{Frey:03, author = {Jeremy G. Frey and Mark Bradley and Jonathan W. Essex and Michael B. Hursthouse and Susan M. Lewis and Michael M. Luck and Luc Moreau and Dave C. De Roure and Mike Surridge and Alan Welsh}, editor = {Fran Berman and Geoffrey Fox and Tony Hey}, title = {Grid Computing --- Making the Global Infrastructure a Reality}, chapter = {Combinatorial chemistry and the Grid}, publisher = {John Wiley and Sons}, year = {2003}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, series = {Wiley Series in Communications Networking and Distributed Systems}, OPTtype = {}, address = {Chichester, England}, export="yes", combichem="yes", ISBN= {0-470-85319-0}, pind="EZ~10~3~03", OPTedition = {}, OPTmonth = {}, pages = {945--962}, pagecount="18", OPTnote = {}, OPTannote = {} } @InProceedings{Miles:UKPEW03, author = {Simon Miles and Juri Papay and Vijay Dialani and Michael Luck and Keith Decker and Terry Payne and Luc Moreau}, title = {Personalised Grid Service Discovery}, OPTcrossref = {}, OPTkey = {}, booktitle = {Nineteenth Annual UK Performance Engineering Workshop (UKPEW'03)}, OPTpages = {}, year = 2003, editor = {Stephen A. Jarvis}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {University of Warwick, Coventry, England}, pind = "EZ~07~06~04", mygrid="yes", export="yes", sd="yes", month = jul, url="http://www.ecs.soton.ac.uk/~lavm/papers/ukpew03.ps", pages="131--140", pagecount="10", ISBN="0-9541000-2-6", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="We take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. We argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. This paper presents UDDI-Mt, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. We also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, we analyse the performance of each of these contributions in our implementation." } @Article{Moreau-Queinnec:RAP2004, author = {Luc Moreau and Christian Queinnec}, title = {Resource Aware Programming}, journal = toplas, year = {2004}, note="Accepted for publication", OPTkey = {}, OPTvolume = {}, OPTnumber = {}, pages = {29 pages}, Jpagecount="29", export="yes", OPTmonth = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/rap.pdf", pind = "EZ~02~01~11", OPTnote = {}, OPTannote = {}, abstract="We introduce the Resource Aware Programming framework, which allows users to monitor the resources used by their programs and to programmatically express policies for the management of such resources. The framework is based on a notion of hierarchical groups, which act as resource containers for the computations they sponsor. Asynchronous notifications for resource exhaustion and for computation termination can be handled by arbitrary user code, which is also executed under the control of this hierarchical group structure. Resources are manipulated by the programmer using resource descriptors, whose operations are specified by a resource algebra. In this paper, we overview the Resource Aware Programming framework and describe its semantics in the form of a language-independent abstract machine able to model both shared and distributed memory environments. Finally, we discuss a prototype implementation of the Resource Aware Programming framework in Java." } @Article{Moreau-Dickman-Jones:DRC, author = {Luc Moreau and Peter Dickman and Richard Jones}, title = {{Birrell's Distributed Reference Listing Revisited}}, journal = {Submitted for publication}, year = {2003}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, export="yes", pages = {50}, Jpagecount="50", pind="EZ~3~1~06", month = jul, note = {Also available as Technical Report 8-03, University of Kent, Canterbury}, OPTannote = {}, url="http://www.cs.kent.ac.uk/pubs/2003/1650/index.html", abstract="The Java RMI collector is arguably the most widely used distributed garbage collector. Its distributed reference listing algorithm was introduced by Birrell in the context of Network Objects, where the description was informal and heavily biased toward implementation. In this paper, we formalise this algorithm in an implementation-independent manner, which allows us to clarify weaknesses of the initial presentation. In particular, we discover cases critical to the correctness of the algorithm that are not accounted for by Birrell. We use our formalisation to derive an invariant-based proof of correctness of the algorithm that avoids notoriously difficult temporal reasoning. Furthermore, we offer a novel graphical representation of the state transition diagram, which we use to provide intuitive explanations of the algorithm and to investigate its tolerance to faults in a systematic manner. Finally, we examine how the algorithm may be optimised, either by placing constraints on message channels or by tightening the coupling between application program and distributed garbage collector." } @Article{Moreau-Dickman-Jones:04, author = {Luc Moreau and Peter Dickman and Richard Jones}, title = {{Birrell's Distributed Reference Listing Revisited}}, journal = toplas, year = {2004}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, export="yes", pages = {52}, Jpagecount="52", pind = "EZ~03~01~11", note="Accepted for publication", OPTmonth = jul, OPTannote = {}, url="http://www.cs.kent.ac.uk/pubs/2003/1650/index.html", abstract="The Java RMI collector is arguably the most widely used distributed garbage collector. Its distributed reference listing algorithm was introduced by Birrell in the context of Network Objects, where the description was informal and heavily biased toward implementation. In this paper, we formalise this algorithm in an implementation-independent manner, which allows us to clarify weaknesses of the initial presentation. In particular, we discover cases critical to the correctness of the algorithm that are not accounted for by Birrell. We use our formalisation to derive an invariant-based proof of correctness of the algorithm that avoids notoriously difficult temporal reasoning. Furthermore, we offer a novel graphical representation of the state transition diagram, which we use to provide intuitive explanations of the algorithm and to investigate its tolerance to faults in a systematic manner. Finally, we examine how the algorithm may be optimised, either by placing constraints on message channels or by tightening the coupling between application program and distributed garbage collector." } @TechReport{Moreau:2003, author = {Luc Moreau and Juri Papay and Simon Miles and Terry Payne and Keith Decker}, title = {An Integrative Approach for Attaching Semantic Annotations to Service Descriptions}, institution = {University of Southampton}, year = {2003}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, note = {Submitted for publication}, OPTannote = {} } @InProceedings{Szomszor-Moreau:ODBASE03, author = {Martin Szomszor and Luc Moreau}, title = {Recording and Reasoning over Data Provenance in Web and Grid Services}, OPTcrossref = {}, OPTkey = {}, booktitle = {International Conference on Ontologies, Databases and Applications of SEmantics (ODBASE'03)}, pages = {603--620}, pagecount="18", year = {2003}, mygrid="yes", provenance="yes", export="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/odbase03.ps.gz", OPTeditor = {}, volume = {2888}, OPTnumber = {}, series = lncs, address = {Catania, Sicily, Italy}, month = nov, isbn="3-540-20498-9", issn="0302-9743", pind = "EZ~02~02~04", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="Large-scale, dynamic and open environments such as the Grid and Web Services build upon existing computing infrastructures to supply dependable and consistent large-scale computational systems. This kind of architecture has been adopted by the business and scientific communities allowing them to exploit extensive and diverse computing resources to perform complex data processing tasks. In such systems, results are often derived by composing multiple, geographically distributed, heterogeneous services as specified by intricate workflow management. This leads to the undesirable situation where the results are known, but the means by which they were achieved is not. With both scientific experiments and business transactions, the notion of lineage and dataset derivation is of paramount importance since without it, information is potentially worthless. We address the issue of {\em data provenance\/}, the description of the origin of a piece of data, in these environments showing the requirements, uses and implementation difficulties. We propose an infrastructure level support for a provenance recording capability for service-oriented architectures such as the Grid and Web Services. We also offer services to view and retrieve provenance and we provide a mechanism by which provenance is used to determine whether previous computed results are still up to date." } @Article{Miles:IEE03, author = {Simon Miles and Juri Papay and Vijay Dialani and Michael Luck and Keith Decker and Terry Payne and Luc Moreau}, title = {Personalised Grid Service Discovery}, journal = {IEE Proceedings Software: Special Issue on Performance Engineering}, year = {2003}, mygrid="yes", export="yes", sd="yes", OPTkey = {}, volume = 150, editor = "Stephen A. Jarvis", number = 4, pages = {252--256}, Jpagecount="5", month = aug, ISSN="1462-5970", OPTnote = {}, OPTannote = {}, abstract="The authors take a broad view that ultimately Grid- or Web-services must be located via personalised, semantic-rich discovery processes. They argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. The paper presents UDDI-Mt, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. We also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, we analyse the performance of each of these contributions in our implementation." } @InProceedings{Krishna:AHM03, author = {Ananth Krishna and Victor Tan and Richard Lawley and Simon Miles and Luc Moreau}, title = {The myGrid Notification Service}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2003 (AHM'03)}, pages = {475--482}, pagecount="8", year = 2003, ns="yes", isbn="ISBN - 1-904425-11-9", export="yes", pind = "EZ~05~05~04", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, mygrid="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/ns-ahm03.pdf", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="The notification service is the part of myGrid that enables asynchronous delivery of messages between distributed components. It includes features such as topic-based publish-subscribe messaging, push/pull models, asynchronous delivery, persistence, transient and durable subscriptions, durable topics, negotiation of QoS, hierarchical topic structure and federation of services. Some of these features are novel in the area of messaging middleware. A cost evaluation of some of these features indicate that the overhead incurred is justified in terms of compensating benefits gained." } @InProceedings{Greenwood:AHM03, author = {Mark Greenwood and Carole Goble and Robert Stevens and Jun Zhao and Matthew Addis and Darren Marvin and Luc Moreau and Tom Oinn}, title = {Provenance of e-Science Experiments - experience from Bioinformatics}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2003 (AHM'03)}, pages = {223--226}, pagecount="4", year = 2003, mygrid="yes", provenance="yes", isbn="ISBN-1-904425-11-9", pind = "EZ~08~01~04", export="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, mygrid="yes", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/prov-ahm03.pdf", abstract="Like experiments performed at a laboratory bench, the data associated with an e-Science experiment are of reduced value if other scientists are not able to identify the origin, or provenance, of those data. Provenance information is essential if experiments are to be validated and verified by others, or even by those who originally performed them. In this article, we give an overview of our initial work on the provenance of bioinformatics e-Science experiments within myGrid. We use two kinds of provenance: the derivation path of information and annotation. We show how this kind of provenance can be delivered within the myGrid demonstrator WorkBench and we explore how the resulting Webs of experimental data holdings can be mined for useful information and presentations for the e-Scientist." } @InProceedings{Lord:AHM03, author = {Phillip Lord and Chris Wroe and Robert Stevens and Carole Goble and Simon Miles and Luc Moreau and Keith Decker and Terry Payne and Juri Papay}, title = {Semantic and Personalised Service Discovery}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2003 (AHM'03)}, pages = {787--794}, pagecount="8", year = 2003, mygrid="yes", sd="yes", isbn="ISBN - 1-904425-11-9", pind = "EZ~09~05~04", export="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, mygrid="yes", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/sd-ahm03.pdf", abstract="One of the most pervasive classes of services needed to support e-Science applications are those responsible for the discovery of resources. We have developed a solution to the problem of service discovery in a Semantic Web/Grid setting. We do this in the context of bioinformatics, which is the use of computational and mathematical techniques to store, manage, and analyse the data from molecular biology in order to answer questions about biological phenomena. Our specific application is myGrid (http: //www.mygrid.org.uk) that is developing open source, service-based middleware upon which bioin- formatics applications can be built. myGrid is specif- ically targeted at developing open source high-level service Grid middleware for bioinformatics." } @InProceedings{Lord:KGGI03, author = {Phillip Lord and Chris Wroe and Robert Stevens and Carole Goble and Simon Miles and Luc Moreau and Keith Decker and Terry Payne and Juri Papay}, title = {{Semantic and Personalised Service Discovery}}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of Workshop on Knowledge Grid and Grid Intelligence (KGGI'03), in conjunction with 2003 IEEE/WIC International Conference on Web Intelligence/Intelligent Agent Technology}, pages = {100--107}, pagecount="8", isbn = {0-9734039-0-X}, pind = "EZ~09~05~04", year = 2003, mygrid="yes", sd="yes", export="yes", editor = {W. K. Cheung and Y. Ye}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Halifax, Canada}, month = oct, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, publisher = "Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada", url="http://www.ecs.soton.ac.uk/~lavm/papers/kggi03.pdf", abstract="One of the most pervasive classes of services needed to support e-Science applications are those responsible for the discovery of resources. We have developed a solution to the problem of service discovery in a Semantic Web/Grid setting. We do this in the context of bioinformatics, which is the use of computational and mathematical techniques to store, manage, and analyse the data from molecular biology in order to answer questions about biological phenomena. Our specific application is myGrid that is developing open source, service-based middleware upon which bioinformatics applications can be built. myGrid is specifically targeted at developing open source high-level service Grid middleware for bioinformatics." } @TechReport{Moreau:GGF9, author = {Luc Moreau and Simon Miles and Juri Papay and Keith Decker and Terry Payne}, title = {Publishing Semantic Descriptions of Services}, institution = {Global Grid Forum}, year = {2003}, OPTkey = {}, OPTtype = {}, pagecount="8", OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, export="yes", mygrid="yes", sd="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/ggf9.ps", OPTannote = {}, abstract="Service discovery in large scale, open distributed systems is difficult because of the need to filter out services suitable to the task at hand from a potentially huge pool of possibilities. Semantic descriptions have been advocated as the key to expressive service discovery, but the most commonly used service descriptions and registry protocols do not support such descriptions in a general manner. In this paper, we present an approach and implementation for service registration and discovery that uses an RDF triple store to express semantic service descriptions and other task/user-specific metadata, using a mechanism for attaching structured and unstructured metadata. The result is an extremely flexible service registry that can be the basis of a sophisticated semantically-enhanced service discovery engine, an essential component of a Semantic Grid." } @InProceedings{Weiss:03, author = {S. Weiss and A. Shligersky and S. Abendroth and J. Reeve and L. Moreau and T.E. Dodgson and D. Babb}, title = {A Software Defined Radio Testbed Implementation}, OPTcrossref = {}, OPTkey = {}, booktitle = {IEE Colloquium on DSP Enabled Radios}, pages = {268--274}, pagecount="7", year = 2003, url="http://www.ecs.soton.ac.uk/~lavm/papers/IEEclq03_sdr.pdf", year = 2003, editor = {R.W. Stewart and D. Garcia-Alis}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Livingston, Scotland, UK}, month = sep, publisher = {IEE}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, OPTmonth = {}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="We report on the implementation of a software defined radio (SDR) based on state-of-theart digital signal processors (DSPs), which are linked serially to PCs. While time critical operations are executed on specialised transmit and receive processors with a fixed block structure, the baseband processing is performed on highly flexible DSPs. The latter run several concurrent functionalities, such as the reception of data over a serial link, the assembly of symbols and frames for transmission, as well as receiver functions such as a fractionally spaced equaliser for synchronisation and mitigation of potentially dispersive channels under a DSP/BIOS system. The testbed system is capable of transmitting packets of data over the SDR link." } @InBook{Moreau:MSEAS04, author = {Luc Moreau and Mike Luck and Simon Miles and Jury Papay and Keith Decker and Terry Payne}, ALTeditor = {Federico Bergenti and Marie-Pierre Gleizes and Franco Zambonelli}, title = {Methodologies and Software Engineering for Agent Systems}, chapter = {Agents and the Grid: Service Discovery}, publisher = {Kluwer}, year = {2004}, export="yes", mygrid="yes", sd="yes", pagecount="22", OPTkey = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTtype = {}, OPTaddress = {}, OPTedition = {}, OPTmonth = {}, OPTpages = {}, OPTnote = {}, OPTannote = {}, abstract="The Grid is a large-scale computer system that is capable of coordinating resources that are not subject to centralised control, whilst using standard, open, general-purpose protocols and interfaces, and delivering non-trivial qualities of service. In this chapter, we argue that Grid applications very strongly suggest the use of agent-based computing, and we review key uses of agent technologies in Grids: user agents, able to customize and personalise data; agent communication languages offering a generic and portable communication medium; and negotiation allowing multiple distributed entities to reach service level agreements. In the second part of the chapter, we focus on Grid service discovery, which we have identified as a prime candidate for use of agent technologies: we show that Grid-services need to be located via personalised, semantic-rich discovery processes, which must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. We present UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. The outcome is a flexible service registry which is compatible with existing standards and also provides metadata-enhanced service discovery." } @InProceedings{Moreau:TRUST04, author = {Luc Moreau and Syd Chapman and Andreas Schreiber and Rolf Hempel and Omer Rana and Lazslo Varga and Ulises Cortes and Steven Willmott}, title = {Provenance-based Trust for Grid Computing --- Position Paper}, OPTcrossref = {}, OPTkey = {}, OPTbooktitle = {}, OPTpages = {}, year = {2003}, mygrid="yes", pasoa="yes", provenance="yes", export="no", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, OPTmonth = {}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract={Current evolutions of Internet technology such as Web Services, ebXML, peer-to-peer and Grid computing all point to the development of large-scale open networks of diverse computing systems interacting with one another to perform tasks. Grid systems (and Web Services) are exemplary in this respect and are perhaps some of the first large-scale open computing systems to see widespread use - making them an important testing ground for problems in trust management which are likely to arise. From this perspective, today's grid architectures suffer from limitations, such as lack of a mechanism to trace results and lack of infrastructure to build up trust networks. These are important concerns in open grids, in which "community resources" are owned and managed by multiple stakeholders, and are dynamically organised in virtual organisations. Provenance enables users to trace how a particular result has been arrived at by identifying the individual services and the aggregation of services that produced such a particular output. Against this background, we present a research agenda to design, conceive and implement an industrial-strength open provenance architecture for grid systems. We motivate its use with three complex grid applications, namely aerospace engineering, organ transplant management and bioinformatics. Industrial-strength provenance support includes a scalable and secure architecture, an open proposal for standardising the protocols and data structures, a set of tools for configuring and using the provenance architecture, an open source reference implementation, and a deployment and validation in industrial context. The provision of such facilities will enrich grid capabilities by including new functionalities required for solving complex problems such as provenance data to provide complete audit-trails of process execution and third-party analysis and auditing. As a result, we anticipate that a larger uptake of grid technology is likely to occur, since unprecedented possibilities will be offered to users and will give them a competitive edge.} } @InProceedings{Moreau:AxGrids04, author = {Simon Miles and Juri Papay and Terry Payne and Keith Decker and Luc Moreau}, title = {Towards a Protocol for the Attachment of Semantic Descriptions to Grid Services}, OPTcrossref = {}, OPTkey = {}, booktitle = {The Second European across Grids Conference}, pages = {10}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nicosia, Cyprus}, month = jan, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, mygrid="yes", sd="yes", export="yes", url="http://www.ecs.soton.ac.uk/~lavm/papers/axgrids04.pdf", abstract="Service discovery in large scale, open distributed systems is difficult because of the need to filter out services suitable to the task at hand from a potentially huge pool of possibilities. Semantic descriptions have been advocated as the key to expressive service discovery, but the most commonly used service descriptions and registry protocols do not support such descriptions in a general manner. In this paper, we present a protocol, its implementation and an API for registering semantic service descriptions and other task/user-specific metadata, and for discovering services according to these. Our approach is based on a mechanism for attaching structured and unstructured metadata, which we show to be applicable to multiple registry technologies. The result is an extremely flexible service registry that can be the basis of a sophisticated semantically-enhanced service discovery engine, an essential component of a Semantic Grid." } @Article{Moreau:IEEEIS04, author = {Chris Wroe and Carole Goble and Mark Greenwood and Phillip Lord and Simon Miles and Juri Papay and Terry Payne and Luc Moreau}, title = {Automating Experiments Using Semantic Data on a Bioinformatics Grid}, journal = {IEEE Intelligent Systems}, year = {2004}, OPTkey = {}, OPTvolume = 19, OPTnumber = 1, pages = {48--55}, OPTmonth = {}, OPTnote = {}, OPTannote = {}, Jpagecount="8", mygrid="yes", sd="yes", export="yes", nourl="http://www.ecs.soton.ac.uk/~lavm/papers/is04.doc", abstract="myGrid assists bioinformaticians in designing and executing in silico experiments using the Grid’s resources. In myGrid, much of this experimental design has been encoded as workflows. Workflows must be represented at tiered levels of detail to ensure that they can respond to changes in service availability, be customized to services in different locations, and be shared with others to varying degrees. The authors have developed workflow templates in which classes of services are composed, and a resolution mechanism by which these classes are instantiated. The specification of service classes and their resolution depends on seven kinds of service metadata. Functionally equivalent services vary widely in implementation. The authors describe workflow harmonization in which the workflow is modified to accommodate variations between substituted services. Finally, they examine the role of scientist and automated process in resolution and harmonization and discuss scope for further automation." } @Article{Miles:IS03, author = {Simon Miles and Juri Papay and Chris Wroe and Phillip Lord and Carole Goble and Luc Moreau}, title = {Semantic Description, Publication and Discovery of Workflows in myGrid}, journal = {Submitted for publication}, year = {2003}, Jpagecount="30", OPTkey = {}, OPTvolume = {}, OPTnumber = {}, OPTpages = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @Article{Wei:TOIS03, author = {Yan Zheng Wei and Luc Moreau and Nicholas R. Jennings}, title = {A Market-Based Approach to Recommender Systems}, journal = {Submitted for publication}, year = {2003}, OPTkey = {}, OPTvolume = {}, OPTnumber = {}, pages = {45 pages}, Jpagecount="45", OPTmonth = {}, OPTnote = {}, OPTannote = {} } Wei aamas paper Patha aamas paper Ecai paper @InProceedings{Partha:LEABS04, author = {Partha S. Dutta and Srinandan Dasmahapatra and Steve R. Gunn and Nicholas R. jennings and Luc Moreau}, title = {Cooperative Information Sharing to Improve Distributed Learning}, booktitle = {AAMAS'04 Workshhop on Learning and Evolution in Agent Based Systems}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, export="yes", mohican ="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/leabs04.pdf", address = {New York}, month = jul, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="Effective coordination in partially observable MAS requires agent actions to be based on reliable estimates of nonlocal states. One way of generating such estimates is to allow the agents to share state information that is not directly observable. To this end, we propose a novel strategy of delayed distribution of state estimates. Our empirical studies of this mechanism demonstrate that individual reinforcement-learning agents in a simulated network routing problem achieve a significant improvement in the overall success, robustness, and efficiency of routing compared with the standard Q-routing algorithm." } @InProceedings{Wei:AOIS04, author = {Yan Zheng Wei and Luc Moreau and Nicholas R. Jennings}, title = {Market-Based Recommender Systems: Learning Users’ Interests by Quality Classification}, booktitle = {Proc. of the Six International Workshop on Agent-Oriented Information Systems (AOIS-2004)}, year = {2004}, month = jul, export="yes", magnitude ="yes", OPTcrossref = {}, OPTkey = {}, OPTpages = {}, OPTyear = {}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {New York}, month = jul, url="http://www.ecs.soton.ac.uk/~lavm/papers/aois04.pdf", OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, abstract="Recommender systems are widely used to cope with the problem of information overload and, consequently, many recommendation methods have been developed. However, no one technique is best for all users in all situations. To combat this, we have previously developed a market-based recommender system that allows multiple agents (each representing a different recommendation method or system) to compete with one another to present their best recommendations to the user. In our system, the marketplace encourages good recommendations by rewarding the corresponding agents according to the users’ ratings of their suggestions. Moreover, we have shown this incentivises the agents to bid in a manner that ensures only the best recommendations are presented. To do this effectively, however, each agent needs to classify its recommendations into different internal quality levels, learn the users’ interests and adapt its bidding behaviour for the various internal quality levels accordingly. To this end, in this paper, we develop a reinforcement learning and Boltzmann exploration strategy that the recommending agents can exploit for these tasks. We then demonstrate that this strategy helps the agents to effectively obtain information about the users’ interests which, in turn, speeds up the market convergence and enables the system to rapidly highlight the best recommendations." } @InProceedings{Wei:IDEAL04, author = {Yan Zheng Wei and Luc Moreau and Nicholas R. Jennings}, title = {Learning Users’ Interests in a Market-Based Recommender System}, booktitle = {Proceedings of the Fifth International Conference on Intelligent Data Engineering and Automated Learning (IDEAL'04)}, year = {2004}, export="yes", magnitude ="yes", OPTcrossref = {}, OPTkey = {}, pages = {833--840}, year = {2004}, volume = {3177}, series = lncs, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Exeter, UK}, month = aug, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ideal04.pdf", abstract="Recommender systems are widely used to cope with the problem of information overload and, consequently, many recommendation methods have been developed. However, no one technique is best for all users in all situations. To combat this, we have previously developed a market-based recommender system that allows multiple agents (each representing a different recommendation method or system) to compete with one another to present their best recommendations to the user. Our marketplace thus coordinates multiple recommender agents and ensures only the best recommendations are presented. To do this effectively, however, each agent needs to learn the users’ interests and adapt its recommending behaviour accordingly. To this end, in this paper, we develop a reinforcement learning and Boltzmann exploration strategy that the recommender agents can use for these tasks. We then demonstrate that this strategy helps the agents to effectively obtain information about the users’ interests which, in turn, speeds up the market convergence and enables the system to rapidly highlight the best recommendations." } @InProceedings{Groth:AHM04, author = {Paul Groth and Michael Luck and Luc Moreau}, title = {Formalising a protocol for recording provenance in Grids}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2004 (AHM'04)}, OPTpages = {}, pagecount="8", year = 2004, pasoa="yes", pind = "EZ~03~03~04", export="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ahm04-groth.pdf", abstract="Both the scientific and business communities are beginning to rely on Grids as problemsolving mechanisms. These communities also have requirements in terms of provenance. Provenance is the documentation of process and the necessity for it is apparent in fields ranging from medicine to aerospace. To support provenance capture in Grids, we have developed an implementation-independent protocol for the recording of provenance. We describe the protocol in the context of a service-oriented architecture and formalise the entities involved using an abstract state machine or a three-dimensional state transition diagram. Using these techniques we sketch a liveness property for the system." } @InProceedings{Lawley:AHM04, author = {Richard Lawley and Michael Luck and Luc Moreau}, title = {Chained Negotiation for Distributed Notification Services}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2004 (AHM'04)}, OPTpages = {}, pagecount="8", year = 2004, mygrid="yes", ns="yes", pind = "EZ~03~03~04", export="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ahm04-lawley.pdf", abstract="Distributed notification services allow consumers and publishers of notifications to interact with different notification services. However, such a distributed infrastructure makes it difficult to share notifications between consumers when consumers are allowed to specify Quality of Service levels. In this paper, we present a chained negotiation engine, enabling distributed notification services to support negotiation and to reuse existing subscriptions. We demonstrate the benefit to the system as a whole by reducing load on service providers and enabling content to be shared." } @InProceedings{Papay:AHM04, author = {Juri Papay and Simon Miles and Michael Luck and Luc Moreau and Terry Payne}, title = {Principles of Personalisation of Service Discovery}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2004 (AHM'04)}, OPTpages = {}, pagecount="8", year = 2004, mygrid="yes", sd="yes", pind = "EZ~05~05~04", export="yes", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ahm04-papay.pdf", abstract="We define personalisation as the set of capabilities that enables a user or an organisation to customise their working environment to suit their specific needs, preferences and circumstances. In the context of service discovery on the Grid, the demand for personalisation comes from individual users, who want their preferences to be taken into account during the search and selection of suitable services. These preferences can express, for example, the reliability of a service, quality of results, functionality, and so on. In this paper, we identify the problems related to personalising service discovery and present our solution: a personalised service registry or View. We describe scenarios in which personsalised service discovery would be useful and describe how our technology achieves them." } @InProceedings{Wroe:AHM04, author = {Chris Wroe and Phillip Lord and Simon Miles and Juri Papay and Luc Moreau and Carole Goble}, title = {Recycling Services and Workflows through Discovery and Reuse}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the UK OST e-Science second All Hands Meeting 2004 (AHM'04)}, OPTpages = {}, pagecount="8", year = 2004, mygrid="yes", sd="yes", pind = "EZ~06~03~04", export="no", OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {Nottingham, UK}, month = sep, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {}, url="http://www.ecs.soton.ac.uk/~lavm/papers/ahm04-wroe.pdf", abstract="Workflows are a central component for representing e-Science procedures in myGrid. For myGrid to support their design, scientists must be able to discover appropriate services to orchestrate and also discover if colleagues have already designed something similar. myGrid integrates a number of software components to address these requirements. The myGrid registry stores service and workflow descriptions. PeDRo, a structured data entry tool, enables uses to annotate these descriptions. Taverna, the workflow workbench, closely integrates with the registry and PeDRo to ensure description and reuse of services and workflows is simple." } @TechReport{Moreau:VDS, author = {Luc Moreau and Yong Zhao and Ian Foster and Jens Voeckler and Michael Wilde}, title = {Specifying and Iterating over Virtual Datasets}, institution = {University of Southampton}, year = {2004}, url="http://www.ecs.soton.ac.uk/~lavm/papers/vds.pdf", note="http://www.ecs.soton.ac.uk/~lavm/papers/vds.pdf", OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @InProceedings{Miles:SGAI04, author = {Simon Miles and Juri Papay and Michael Luck and Luc Moreau}, title = {Implementing Policy Management through BDI}, booktitle = {The Twenty-third SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = dec, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @TechReport{archi:VDS, author = {Ian Foster and Luc Moreau and Mike Wilde}, title = {A Virtual Data System Architecture}, institution = {University of Chicago}, year = {2004}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } @Misc{Moreau:talk:griphyn, author = {Luc Moreau}, title = {Iterators over Virtual Data Sets}, howpublished = {Presentation at the GriPhyN All Hands Meeting \verb|http://www.griphyn.org/events/view_agenda.php?id=96|}, month = may, year = 2004 } @Misc{Moreau:talk:ggf11, author = {Luc Moreau}, title = {Towards iterators in the Virtual Data Language}, howpublished = {Presentation at the workflow workshop \verb|http://www.isi.edu/~deelman/wfm-rg/|}, month = jun, year = 2004 } @TechReport{Moreau:IHMC04, author = {Luc Moreau and Jeff Bradshaw and Maggie Breedy and Lary Bunch and Matt Johnson and Shri Kulkarni and James Lott and Niranjan Suri and Andrzej Uszok}, title = {Extending OWL with Role-Value Maps to support the KAoS Policy Language for Policy-Based Component Specification of Grid Services}, institution = {Institute for Human and Machine Cognition}, year = 2004, url="http://www.ecs.soton.ac.uk/~lavm/papers/polcfg.pdf", note="http://www.ecs.soton.ac.uk/~lavm/papers/polcfg.pdf", OPTkey = {}, OPTtype = {}, OPTnumber = {}, address = {Pensacola, Florida}, month = sep, OPTnote = {}, OPTannote = {} } @Misc{dagman, key = {dagman}, title = {Condor DAGMan}, howpublished = {http://www.cs.wisc.edu/condor/dagman/}, year = {last visited, 2004} } @InProceedings{wip2005-grimoires, author = {Wong, Sylvia C. and Tan, Victor and Fang, Weijian and Miles, Simon and Moreau, Luc}, title = {Grimoires: Grid Registry with Metadata Oriented Interface: Robustness, Efficiency, Security --- Work-in-Progress}, booktitle = {Proceedings of Work in Progress Session in Cluster Computing and Grid (CCGrid)}, year = {2005}, export = "yes", mygrid="yes", url = "http://eprints.ecs.soton.ac.uk/10862/" }