Staging Transformations for Multimodal Web Interaction Management

Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse interaction media. In addition to improving access and delivery capabilities, such interfaces enable flexible and personalized dialogs with websites, much like a conversation between humans. In this paper, we present a software framework for multimodal web interaction management that supports mixed-initiative dialogs between users and websites. A mixed-initiative dialog is one where the user and the website take turns changing the flow of interaction. The framework supports the functional specification and realization of such dialogs using staging transformations -- a theory for representing and reasoning about dialogs based on partial input. It supports multiple interaction interfaces, and offers sessioning, caching, and co-ordination functions through the use of an interaction manager. Two case studies are presented to illustrate the promise of this approach.Comment: Describes framework and software architecture for multimodal web interaction managemen

Abstract Program Slicing: an Abstract Interpretation-based approach to Program Slicing

In the present paper we formally define the notion of abstract program slicing, a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and reference values, and relies on the notion of abstract dependencies between program components (statements). The different forms of (backward) abstract slicing are added to an existing formal framework where traditional, non-abstract forms of slicing could be compared. The extended framework allows us to appreciate that abstract slicing is a generalization of traditional slicing, since traditional slicing (dealing with syntactic dependencies) is generalized by (semantic) non-abstract forms of slicing, which are actually equivalent to an abstract form where the identity abstraction is performed on data. Sound algorithms for computing abstract dependencies and a systematic characterization of program slices are provided, which rely on the notion of agreement between program states

Software Architecture of Code Analysis Frameworks Matters: The Frama-C Example

Implementing large software, as software analyzers which aim to be used in industrial settings, requires a well-engineered software architecture in order to ease its daily development and its maintenance process during its lifecycle. If the analyzer is not only a single tool, but an open extensible collaborative framework in which external developers may develop plug-ins collaborating with each other, such a well designed architecture even becomes more important. In this experience report, we explain difficulties of developing and maintaining open extensible collaborative analysis frameworks, through the example of Frama-C, a platform dedicated to the analysis of code written in C. We also present the new upcoming software architecture of Frama-C and how it aims to solve some of these issues.Comment: In Proceedings F-IDE 2015, arXiv:1508.0338

The Necessary Architecture of Self-Regulating Teams

In this paper we present the meaning of self-regulation in Self- Regulating Teams (SRTs) and show the importance of self- regulating teams in a learning organisation. Self-regulating (also known as self-managing) teams guide and perform their own tasks without a visible leader. In the present dynamic business environment, SRTs promise to deliver higher motivation and empowerment to the individuals that participate in them as well as elevated performance and efficiency to the organisations that implement them. However, as management support and change in business culture are prerequisites for the success of SRTs, their implementation is not an easy task. Often, unsuccessful SRTs have been (in our opinion, wrongly) criticized as a source of ambiguity for organisations and as yet another management technique that does not deliver its promises. We start exploring the validity of such a criticism by discussing the shift from a training paradigm to a self- development paradigm in order to draw the picture of a learning organisation as an entity that facilitates learning of all its members and continuously transforms itself as a whole. We continue by showing the contribution that SRTs could make to the process of an organisation that aims to become a learning organisation. In this paper we adopt a cybernetic approach to describe the role of SRTs and to identify the necessary conditions for SRTs to work at all. We present the necessary architecture of SRTs; the architecture that is needed to deliver their promised advantages. We show how Gordon Pasks Conversation Theory could be applied to self-regulating teams and present how learning conversation could provide the framework for successful organisational evolution through team development and team self- regulation. We show how the establishment of such an architecture can lead to a better understanding of self-regulating teams and thus to their successful evolution and development within an organisation. We conclude by stating the implications of our analysis

A scheduling theory framework for GPU tasks efficient execution

Concurrent execution of tasks in GPUs can reduce the computation time of a workload by overlapping data transfer and execution commands. However it is difficult to implement an efficient run- time scheduler that minimizes the workload makespan as many execution orderings should be evaluated. In this paper, we employ scheduling theory to build a model that takes into account the device capabili- ties, workload characteristics, constraints and objec- tive functions. In our model, GPU tasks schedul- ing is reformulated as a flow shop scheduling prob- lem, which allow us to apply and compare well known methods already developed in the operations research field. In addition we develop a new heuristic, specif- ically focused on executing GPU commands, that achieves better scheduling results than previous tech- niques. Finally, a comprehensive evaluation, showing the suitability and robustness of this new approach, is conducted in three different NVIDIA architectures (Kepler, Maxwell and Pascal).Proyecto TIN2016- 0920R, Universidad de Málaga (Campus de Excelencia Internacional Andalucía Tech) y programa de donación de NVIDIA Corporation

Proving soundness of combinatorial Vickrey auctions and generating verified executable code

Using mechanised reasoning we prove that combinatorial Vickrey auctions are soundly specified in that they associate a unique outcome (allocation and transfers) to any valid input (bids). Having done so, we auto-generate verified executable code from the formally defined auction. This removes a source of error in implementing the auction design. We intend to use formal methods to verify new auction designs. Here, our contribution is to introduce and demonstrate the use of formal methods for auction verification in the familiar setting of a well-known auction