Computer and information sciences topic list of research papers
-
Fast recursive matrix multiplication for multi-core architectures
Abstract In this article, we present a fast algorithm for matrix multiplication optimized for recent multicore architectures. The implementation exploits different methodologies from parallel programming, like recursive decomposition, efficient...
2010 / Gudula Rünger, Michael Schwind -
Integrating scheduling policies into workflow engines
Abstract Workflow applications running on distributed environments are a promising solution for resource and computing intensive problems. However, the heterogeneity of resources in these kind of environments may turn scheduling of such applications ...
2010 / G. Martinez, E. Heymann, M. Senar -
From BSP routines to high-performance ones: Formal verification of a transformation case
Abstract Paderborn’s and Oxford’s BSPLib are C libraries supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time, avoids deadlocks and non-determinism. A natural semantics of ...
2010 / Jean Fortin, Frédéric Gava -
Automatic design optimization using parallel workflows
Abstract Workflows support the automation of scientific processes, leading to a more robust experimental process. They facilitate access to remote instruments, databases and parallel and distributed computers. Importantly, software pipelines can be...
2010 / David Abramson, Blair Bethwaite, Colin Enticott, Slavisa Garic, Tom Peachey, et al. -
The uncertain representation ranking framework for concept-based video retrieval2012 / Robin Aly, Aiden Doherty, Djoerd Hiemstra, Franciska de Jong, Alan F. Smeaton
-
Efficient Public Key Certificate Management for Mobile Ad Hoc Networks2010 / P. Caballero-Gil, C. Hernández-Goya
-
Smart Cloud Engine and Solution Based on Knowledge Base
Abstract Complexity of cloud infrastructures needs models and tools for process management, configuration, scaling, elastic computing and healthiness control. This paper presents a Smart Cloud solution based on a Knowledge Base, KB, with the aim of...
2015 / Pierfrancesco Bellini, Daniele Cenni, Paolo Nesi -
A Calculus for Team Automata
Abstract Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patterns among systems, thus extending I/O automata. Furthermore,...
2008 / Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens -
Static search games played over graphs and general metric spaces
Abstract We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a...
2013 / Thomas P. Oléron Evans, Steven R. Bishop -
Refinement Patterns for UML
Abstract This paper describes strategies or 'patterns' for the refinement of UML specifications into executable implementations, using a semantically precise subset, UML-RSDS, of UML.
2005 / K. Lano, K. Androutsopolous, D. Clark -
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
Abstract This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems that we discuss are (1) efficient automatic reasoning for...
2008 / Hendrik Tews, Tjark Weber, Marcus Völp -
An Automated Approach for the Interpretation of Counter-Examples
Abstract Model checking is an automatic technique used for the verification of finite systems. A model checker explores the full state space of a given model and checks it against a set of requirements. If a state exists in which a requirement is...
2007 / Lionel van den Berg, Paul Strooper, Wendy Johnston -
Transformational Pattern System – Some Assembly Required
Abstract In the context of Model Driven Architecture (MDA), most model transformation mechanisms aim for rigorously and unambiguously defined, fully automatic transformations. We argue that such techniques, even when fully mature, are not applicable ...
2008 / Mika Siikarla, Tarja Systä -
Implementing Nominal Unification
Abstract Nominal matching and unification underly the dynamics of nominal rewriting. Urban, Pitts and Gabbay gave a nominal unification algorithm which finds the most general solution to a nominal matching or unification problem, if one exists....
2007 / Christophe Calvès, Maribel Fernández -
An Action Compiler Targeting Standard ML
Abstract We present an action compiler that can be used in connection with an action semantics based compiler generator. Our action compiler produces code with faster execution times than code produced by other action compilers, and for some...
2005 / Jørgen Iversen -
A Taxonomy of Model Transformation
Abstract This article proposes a taxonomy of model transformation, based on the discussions of a working group on model transformation of the Dagstuhl seminar on Language Engineering for Model-Driven Software Development. This taxonomy can be used,...
2006 / Tom Mens, Pieter Van Gorp -
Towards Abstract Interpretation for Recovering Design Information
Abstract It is a well-known problem that design information of object-oriented programs is often lost or is not kept up-to-date when the program evolves. This design information can be recovered from the program using such techniques as logic meta...
2005 / Coen De Roover, Kris Gybels, Theo D'Hondt -
Formalizing Type Operations Using the “Image” Type Constructor
Abstract In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized and the correctness of these axioms is argued semantically....
2006 / Aleksey Nogin, Alexei Kopylov -
Deciding the Security of Protocols with Commuting Public Key Encryption
Abstract Many cryptographic protocols and attacks on these protocols make use of the fact that the order in which encryption is performed does not affect the result of the encryption, i.e., encryption is commutative. However, most models for the...
2005 / Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani -
Open Bisimulation, Revisited
Abstract In the context of the π-calculus, open bisimulation is prominent and popular due to its congruence properties and its easy implementability. Motivated by the attempt to generalise it to the spi-calculus, we offer a new, more refined...
2006 / Sébastien Briais, Uwe Nestmann