Computer and information sciences topic list of research papers
-
Throughput-optimal scheduling for cooperative relaying in wireless access networks2012 / Ngoc-Thai Pham, Thong Huynh, Won-Joo Hwang
-
An integrated diversity and fusion framework for binary consensus over fading channels2013 / Mehrzad Malmirchegini, Yasamin Mostofi
-
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Abstract Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic notion of weighted decision diagrams that captures many of them...
2006 / Jörn Ossowski, Christel Baier -
From Theory to Practice in Distributed Component Systems
Abstract This paper summarizes the keynote talk given at FACS'06, Formal Aspect of Component Systems, Prague, September 2006. The paper provides both an overview and a perspective of the papers cited in the reference. To achieve effective...
2007 / Denis Caromel -
On the Transformation of SystemC to AsmL Using Abstract Interpretation
Abstract SystemC is among a group of system level design languages proposed to raise the abstraction level for embedded system design and verification. A straight and sound verification by model checking or theorem proving of SystemC designs is,...
2005 / Ali Habibi, Sofiene Tahar -
A Component Model for Architectural Programming
Abstract Software architectures and modular composition help in constructing large-scale software systems. Current programming languages provide only insufficient support for software architecture. “Architectural programming” overcomes the problem...
2006 / Hubert Baumeister, Florian Hacklinger, Rolf Hennicker, Alexander Knapp, Martin Wirsing -
An Integrated and “Engaging” Package for Tree Animations
Abstract This paper describes a prototypical system for tree and tree algorithm animations. The system allows the user to create his or her own tree from a selection of supported tree types by inserting and removing nodes. At any point in time, the...
2007 / Guido Rößling, Silke Schneider -
Towards Trustworthy Spatial Messaging
Abstract Spatial messaging is a term that defines the virtual publication of data in physical places. Generally, anyone in the neighborhood of such a publication point gets the message. Frameworks allowing the users to publish freely spatial...
2007 / Michel Deriaz, Jean-Marc Seigneur -
Towards a General Solution to Drawing Area-Proportional Euler Diagrams
Abstract We present a deterministic algorithm for drawing Euler diagrams using n simple polygons so that the regions have a prescribed area. Our solution works for all Euler diagrams that have a region of common intersection (i.e., region ...
2005 / Stirling Chow, Frank Ruskey -
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Abstract Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a...
2008 / Andreas Abel -
Preface2007 / A. Brogi, J.-M. Jacquet, E. Pimentel
-
Quantum Programs With Classical Output Streams
Abstract We show how to model the semantics of quantum programs that give classical output during their execution. That is, in our model even non-terminating programs may have output. The modelling interprets a program as a measurement process on...
2007 / Dominique Unruh -
Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions
Abstract We use a modal logic in order to show that the strategy-based rewrite semantics for membrane systems fully preserves the maximal concurrency of evolution rules actions, whereas the maximal concurrency of communication actions and structural ...
2009 / Dorel Lucanu -
Peer Review of Animations Developed by Students
Abstract This paper describes the project “Visual Knowledge Communication”, a joint project that started recently. The partners are psychologists and computer scientists from four universities of the German state Rhineland-Palatinate. The starting...
2007 / Rainer Oechsle, Thiemo Morth -
Network Invariants for Real-Time Systems
Abstract We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition structures (which are similar in spirit to timed automata) and...
2004 / Olga Grinchtein, Martin Leucker -
Runtime Verification for High-Confidence Systems: A Monte Carlo Approach
Abstract We present a new approach to runtime verification that utilizes classical statistical techniques such as Monte Carlo simulation, hypothesis testing, and confidence interval estimation. Our algorithm, MCM, uses sampling-policy automata to...
2006 / Sean Callanan, Radu Grosu, Abhishek Rai, Scott A. Smolka, Mike R. True, et al. -
Design of Architectures for Proximity-aware Services: Experiments in Context-based Authentication with Subjective Logic
Abstract This paper addresses the design of architectures for proximity-aware services with unobtrusive and context-based identification and authentication features. A service is “proximity-aware” when it automatically detects the presence of...
2009 / Gabriele Lenzini -
Automatic Verification of Fault-Tolerant Register Emulations
Abstract The design and verification of fault-tolerant distributed algorithms is a complicated task. Usually, the proof of correctness is done manually, and thus depends on the skill of the prover. Using automated verification methods, such as model ...
2009 / Paul C. Attie, Hana Chockler -
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Abstract Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the...
2006 / Mikkel Bundgaard, Thomas Hildebrandt -
A Universal Accepting Hybrid Network of Evolutionary Processors
Abstract We propose a construction of an accepting hybrid network of evolutionary processors (AHNEP) which behaves as a universal device in the class of all these devices. We first construct a Turing machine which can simulate any AHNEP and then an...
2006 / Florin Manea, Carlos Martín-Vide, Victor Mitrana