Abstract
Over the last decade, software architecture emerged as a critical issue in Software Engineering. This encompassed a shift from traditional programming towards software development based on the deployment and assembly of independent components. The specification of both the overall systems structure and the interaction patterns between their components gbecame a major concern for the working developer. Although a number of formalisms to express behaviour and to supply the indispensable calculational power to reason about designs, are available, the task of deriving architectural designs on top of popular component platforms has remained largely informal. This paper introduces a systematic approach to derive, from CCS behavioural specifications the corresponding architectural skeletons in the Microsoft. Net framework, in the form of executable C# and C? code. The prototyping process is fully supported by a specific tool developed in Haskell.

Abstract
One of the challenges in grid computing research is to provide means to automatically submit, manage, and monitor applications which spread a large number of tasks. The usual way of managing these tasks is to represent each one as an explicit node in a graph, and this is the approach taken by many grid systems up to date. This approach can quickly saturate the machine where the application is launched, as we increase the number of tasks. In this work we present and validate a novel architectural model, GRAND (Grid Robust ApplicatioN Deployment), whose main objective is to deal with the problem of memory and load saturation of the submission machine. GRAND is implemented at a middleware level, aiming at providing a distributed task submission through a hierarchical organization. This paper provides an overview of the GRAND submission model as well our implementation. Initial results show that our approach can be much more effective than other approaches in the literature. Copyright 2005 ACM.

Abstract
This paper introduces a generic semantic framework for component-based development, expressed in the unified modelling language UML. The principles of a coalgebraic semantics for class, object and statechart diagrams as well as for use cases, are developed. It is also discussed how to formalize the refinement steps in the development process based upon a suitable notion of behavior refinement. In this way, a formal basis for component-based development in UML is studied, which allows the construction of more complex and specific systems from independent components. © 2005 Published by Elsevier B.V.

Abstract
Functional programs are particularly well suited to formal manipulation by equational reasoning. In particular, it is straightforward to use calculational methods for program transformation. Well-known transformation techniques, like tupling or the introduction of accumulating parameters, can be implemented using calculation through the use of the fusion (or promotion) strategy. In this paper we revisit this transformation method, but, unlike most of the previous work on this subject, we adhere to a pure point-free calculus that emphasizes the advantages of equational reasoning. We focus on the accumulation strategy initially proposed by Bird, where the transformed programs are seen as higher-order folds calculated systematically from a specification. The machinery of the calculus is expanded with higher-order point-free operators that simplify the calculations. A substantial number of examples (both classic and new) are fully developed, and we introduce several shortcut optimization rules that capture typical transformation patterns.

Abstract
This paper addresses the short-term allocation of active/reactive power supplies in transmission systems in a market environment. The basic issue addressed by most papers is related to market mechanisms involving active power either in terms of a pool or by bilateral contracts. However, in several countries Volt/Var control started to be considered, at least partially, as a marketable service and so new methodologies are required to support this process. This paper presents an integrated mathematical formulation for the active power dispatch using bids from market agents and inherently taking into account the local nature of Volt/Var control by considering an AC model for the network. The discrete operation of several components as transformer taps and capacitor sections are accurately taken care by using Simulated Annealing. The proposed methodology is applied on the 30-bus IEEE test system highlighting its advantages and demonstrating the feasibility of its use in real systems.

Abstract
Good documentation benefits every software development project, especially large ones, but it can be hard, costly, and tiresome to produce when not supported by appropriate tools and methods. The documentation of a software system uses different artifacts, namely source code, for low-level internal documentation, and specific-purpose models and documents, for higher-level external documentation (e.g. requirements documents, use-case specifications, design notebooks, and reference manuals). All these artifacts require continual review and modification throughout the life-cycle to preserve their consistency and value. Good software documents are often heterogeneous, i.e., they combine different kinds of contents (text, code, models, images) gathered from separate software artifacts, a combination usually difficult to maintain as the system evolves over time, considering that source code, models and documents are typically produced and maintained separately in multiple sources using different environments and editors. This paper presents a wiki that helps on quickly weaving different kinds of contents into a single heterogeneous document, whilst preserving its semantic consistency. The fundamental goal of this wiki (XSDoc Wiki) is to reduce the development-documentation gap by making documentation more convenient and attractive to developers. An example taken from the JUnit framework documentation helps to illustrate the features more relevant to do such weaving. Copyright 2005 ACM.