Computer and information sciences topic list of research papers
-
Proving Quicksort Correct in Event-B
Abstract The Event-B method can be used to model all sorts of discrete event systems, among them sequential programs. We have made the experience that the minimalist nature of Event-B is of advantage when it comes to tool support and to using proof...
2009 / Stefan Hallerstede -
Complexity of Operators on Compact Sets
Abstract Based on oracle Turing machines, we investigate the computational complexity of operators on compact sets. For the projection and convex hull we are able to show exponential upper and lower bounds as well as a connection to the ...
2008 / Xishun Zhao, Norbert Müller -
Topological Analysis of Refinement
Abstract A modal transition system has a class of implementations, its maximal refinements. This class determines satisfiability and validity judgments, and their compositional approximations, for formulas of Hennessy-Milner logic. Using topology,...
2006 / Michael Huth -
An Orchestrator for Dynamic Interconnection of Software Components
Abstract Composing and orchestrating software components is a fundamental concern in modern software engineering. This paper addresses the possibility of such orchestration being dynamic, in the sense that the structure of component's...
2007 / Marco Antonio Barbosa, Luís Soares Barbosa -
A Visual Technique for Web Pages Comparison
Abstract Despite the exponential WWW growth and the success of the Semantic Web, there is limited support today to handle the information found on the Web. In this scenario, techniques and tools that support effective information retrieval are...
2009 / María Alpuente, Daniel Romero -
Specification and Generation of Environment for Model Checking of Software Components
Abstract Model checking of isolated software components is inherently not possible because a component does not form a complete program with an explicit starting point. To overcome this obstacle, it is typically necessary to create an environment of ...
2007 / Pavel Parizek, Frantisek Plasil -
A Logical Characterisation of Static Equivalence
Abstract The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are indistinguishable under the notion of static equivalence if...
2007 / Hans Hüttel, Michael D. Pedersen -
Thoughts on Requirements and Design Issues of User Interfaces for Proof Assistants2004 / Norbert Völker
-
Reasoning with Uncertain and Conflicting Opinions in Open Reputation Systems
Abstract Reputation systems support users to distinguish between trustworthy and malicious or unreliable services. They collect and evaluate available user opinions about services and about other users in order to determine an estimation for the...
2009 / Andreas Gutscher -
Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe
Abstract We consider finite decidable FP-sketches within an arithmetic universe. By an FP-sketch we mean a sketch with terminal and binary product cones. By an arithmetic universe we mean a list-arithmetic pretopos, which is the general categorical...
2009 / Maria Emilia Maietti -
Fragments-based Model Reduction: Some Case Studies
Abstract Molecular biological models usually suffer from a dramatic combinatorial blow up. Indeed, proteins form complexes and can modify each others, which leads to the formation of a huge number of distinct chemical species (ie non-isomorphic...
2010 / Jérôme Feret -
Composition Theorems for Generalized Sum and Recursively Defined Types2005 / Alexander Rabinovich
-
Proving Approximate Implementations for Probabilistic I/O Automata
Abstract In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally controlled actions and a task scheduler ...
2007 / Sayan Mitra, Nancy Lynch -
Syntactic Cut-elimination for Common Knowledge
Abstract We see a cut-free infinitary sequent system for common knowledge. Its sequents are essentially trees and the inference rules apply deeply inside of these trees. This allows to give a syntactic cut-elimination procedure which yields an upper ...
2009 / Kai Brünnler, Thomas Studer -
Rational Unification in 28 Characters
Abstract We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is...
2005 / Pietro Cenciarelli, Alessandro Tiberi -
The Functional Interpretation of Direct Computations
Abstract The concept of direct computation used by Statman (1977) was instrumental in the development of a notion of normal form for proofs of equality. In order to find a functional (Curry–Howard style) interpretation of direct computations we take ...
2011 / Ruy J.G.B. de Queiroz, Anjolina G. de Oliveira -
On the Unification of Process Semantics: Equational Semantics
Abstract The complexity of parallel systems has produced a large collection of semantics for processes, a classification of which is provided by Van Glabbeek's linear time-branching time spectrum; however, no suitable unified definitions were...
2009 / David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino -
Activity driven modeling of time varying networks2012 / N. Perra, B. Gonçalves, R. Pastor-Satorras, A. Vespignani
-
Tamperproof transmission of fingerprints using visual cryptography schemes
Abstract Visual Cryptography and biometrics have been identified as the two most important aspects of digital security. In this paper, we propose a method for the preparation and secure transmission of fingerprint images using visual cryptography...
2010 / Thomas Monoth, Babu Anto P. -
Face recognition based on eigen features of multi scaled face components and an artificial neural network
Abstract Face recognition has been a very active research area in the past two decades. Many attempts have been made to understand the process of how human beings recognize human faces. It is widely accepted that face recognition may depend on both...
2010 / K. Rama Linga Reddy, G.R. Babu, Lal Kishore