Computer and information sciences topic list of research papers
-
V for Virtual
Abstract Operating system virtualization has been available on commodity hardware for a few years, and today attracts considerable commercial and research interest. Virtualization allows one or more virtual machines (VMs) to run on a single physical ...
2006 / Andrew D. Gordon -
Model Checking Merged Program Traces
Abstract During a program's execution, state information can be collected and stored in the form of program traces. With such traces, one can analyze dynamic properties of the program. In this paper, we consider the problem of merging multiple...
2009 / Paulo Salem da Silva, Ana C.V. de Melo -
Reversibility and Models for Concurrency
Abstract There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [Danos, V. and J. Krivine, Reversible communicating systems,...
2007 / Iain Phillips, Irek Ulidowski -
Formalisation of C Language Interfaces
Abstract In practical computing, implementations of programming languages provide an interface that allow programs written in a language to call code written in another programming language, most often C. Usually, those language interfaces are left...
2009 / Gustavo A. Ospina, Baudouin Le Charlier -
A Language For Multiplicative-additive Linear Logic
Abstract A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive...
2009 / J.R.B. Cockett, C.A. Pastro -
Recursive Functions with Pattern Matching in Interaction Nets
Abstract We compile functional languages with pattern-matching features into interaction nets, extending the well-known efficient evaluation strategies developed for the pure λ-calculus. We give direct translations of recursion and pattern matching...
2009 / Maribel Fernández, Ian Mackie, Shinya Sato, Matthew Walker -
Model-based User Interface Testing With Spec Explorer and ConcurTaskTrees
Abstract Analytic usability analysis methods have been proposed as an alternative to user testing in early phases of development due to the cost of the latter approach. By working with models of the systems, analytic models are not capable of...
2008 / José L. Silva, José Creissac Campos, Ana C.R. Paiva -
Synthesis of Moduli of Uniform Continuity by the Monotone Dialectica Interpretation in the Proof-system MinLog
Abstract We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of Gödel's T of type ( N → ...
2007 / Mircea-Dan Hernest -
A Filter Model for Safe Ambients2004 / Ines Margaria, Maddalena Zacchi
-
Conditional Term Graph Rewriting with Indirect Sharing
Abstract For reasons of efficiency, term rewriting is usually implemented by term graph rewriting. In term rewriting, expressions are represented as terms, whereas in term graph rewriting these are represented as directed graphs. Unlike terms,...
2007 / Enno Ohlebusch -
Understanding Game Semantics Through Coherence Spaces
Abstract Game Semantics has successfully provided fully abstract models for a variety of programming languages not possible using other denotational approaches. Although it is a flexible and accurate way to give semantics to a language, its...
2010 / Ana C. Calderon, Guy McCusker -
Demand-driven Movement Strategy for Moving Beacons in Distributed Sensor Localization
Abstract In a wireless sensor network, range-free localization with a moving beacon can reduce susceptibility to communication noises while concomitantly eliminate need for large number of expensive anchor nodes that are vulnerable to malicious...
2011 / Anindya Iqbal, Manzur Murshed -
Conceptual framework for dynamic trust monitoring and prediction
Abstract The dynamic and collaborative nature of mobile and sensor networks raises the issue of how connected mobile devices can be trusted. Despite the existing security paradigms such as cryptographic mechanisms, and reputation and trust models,...
2010 / Olufunmilola Onolaja, Rami Bahsoon, Georgios Theodoropoulos -
Continuous interactive simulation: Engaging the human sensory-motor system in understanding dynamical systems
Abstract Direct and continuous interaction with a simulated dynamical system enables the full human sensory-motor loop to be applied to the problem of understanding the behaviour of dynamical systems. A virtual environment consisting of a continuous ...
2010 / Rohan J. McAdam -
Harnessing the Scientific Data Produced by the Experimental Evaluation Search Engines and Information Access Systems
Abstract Measuring is a key to scientific progress. This is particularly true for research concerning complex systems, whether natural or human-built. Multilingual and multimedia information systems are increasingly complex: they need to satisfy...
2011 / Nicola Ferro, Allan Hanbury, Henning Müller, Giuseppe Santucci -
Model-based probabilistic frequent itemset mining2012 / Thomas Bernecker, Reynold Cheng, David W. Cheung, Hans-Peter Kriegel, Sau Dan Lee, et al.
-
Measuring torsional eye movements by tracking stable iris features
Abstract We propose a new method to measure torsional eye movements from videos taken of the eye. In this method, we track iris features that have been identified as Maximally Stable Volumes. These features, which are stable over time, are dark...
2010 / James K.Y. Ong, Thomas Haslwanter -
Extending Brickell–Davenport theorem to non-perfect secret sharing schemes2013 / Oriol Farràs, Carles Padró
-
Interfacing Concepts
Abstract A concept (or signature) describes the interface of a set of abstract types by listing the operations that should be supported for those types. When implementing a generic operation, such as sorting, we may then specify requirements such as ...
2010 / Anya Helene Bagge, Magne Haveraaen -
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
Abstract We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in solvable theory X. Our algorithm CC(X) is reminiscent of...
2008 / Sylvain Conchon, Evelyne Contejean, Johannes Kanig, Stéphane Lescuyer