Computer and information sciences topic list of research papers
-
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Abstract Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between...
2004 / Miguel Palomino Tarjuelo -
IFHNFS: fast indexing information in mobile devices
Abstract To track movements of objects and people we need to use expensive technologies and complex softwares. Usually these softwares need lots of memory. There are many examples of objects and people of which would be useful to know the precise...
2011 / Nicola Corriero, Giuseppe Gargiuolo, Giovanni Pani -
Imaging mechanisms analysis of compact digital holographic microscope for microparticles measurement
Abstract Conventional optical microscopy suffers from small depth of focus due to its high numerical aperture and magnification of the microscope objective. In comparison, digital in-line holographic microscopy (DIHM) provides information about the...
2011 / Jianglei Di, Arvind Rajendran, Vinay Kariwala, Anand Krishna Asundi, Jianlin Zhao -
A Subcategory-based Parser Directed to Generating Representations for Text Understanding
Abstract This paper describes a parser in progress which is directed to generating representations for text understanding. For the purpose of reducing the proliferation of unwanted parse trees, and collecting information necessary for generating the ...
2011 / Yukiko Sasaki Alam -
Document Recommendation Using Data Compression
Abstract We propose a new method of content-based document recommendation using data compression. Though previous studies mainly used bags-of-words to calculate the similarity between the profile and target documents, users in fact focus on larger...
2011 / Takafumi Suzuki, Shin Hasegawa, Takayuki Hamamoto, Akiko Aizawa -
Image Capture and Display Based on Embedded Linux
Abstract For the requirement of building a highly reliable communication system, SpaceWire was selected in the integrated electronic system. There was a need to test the performance of SpaceWire. As part of the testing work, the goal of this paper...
2012 / Zhang Weigong, Di Suran, Zhang Yongxiang, Li Liming -
AVERIST: An Algorithmic Verifier for Stability
Abstract In this paper, we present the tool AVERIST, which implements an algorithmic approach for the stability analysis of polyhedral switched systems. It implements an abstraction based model-checking approach proposed in the earlier work of the...
2015 / Pavithra Prabhakar, Miriam García Soto -
Fairness, Resources, and Separation
Abstract Fair interleaving plays a fundamental rôle in denotational semantic models for shared-memory parallel programs, beginning with Park's trace semantics, based on a fairmerge relation designed so that ( ...
2010 / Stephen Brookes -
Towards the Semantics and Verification of BPEL4WS
Abstract In this paper, we discuss the semantics of BPEL4WS language which is a de facto standard for specifying and execution workflow specification for web service composition and orchestration. We propose a language μ-BPEL that includes most...
2006 / Geguang Pu, Xiangpeng Zhao, Shuling Wang, Zongyan Qiu -
Preface2009 / Y.-X. Chen, E.-E. Doberkat, A. Jung
-
A Compositional Automata-based Approach for Model Checking Multi-Agent Systems
Abstract This paper addresses the issue of model checking knowledge in concurrent systems. The work benefits from many recent results on model checking and combined logics for time and knowledge, and focus on the way knowledge relations can be...
2008 / Mario Benevides, Carla Delgado, Carlos Pombo, Luis Lopes, Ricardo Ribeiro -
A Model Checking Approach to Protocol Conversion
Abstract System-on-chip verification is an active research area. Of particular interest is protocol conversion, where two components with different protocols are controlled to communicate accurately. We present an approach to protocol conversion...
2008 / Roopak Sinha, Partha S. Roop, Samik Basu -
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
Abstract This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on λ-abstractions, using an instance of a generic...
2011 / Rafael del Vado Vírseda -
Formal ReSpecT in the A&A Perspective
Abstract Coordination models and languages have found a new course in the context of MAS (multiagent systems). By re-interpreting results in terms of agent-oriented abstractions, new conceptual spaces are found, which extend the reach of...
2007 / Andrea Omicini -
Dynamic Consistency in Process Algebra: From Paradigm to ACP
Abstract The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at various levels of abstraction. To enable...
2009 / S. Andova, L.P.J. Groenewegen, E.P. de Vink -
Type Checking Circus Specifications
Abstract Circus is a formal language that combines Z, CSP and additional constructors of Morgan's refinement calculus. It is aimed at the development by refinement of state-rich...
2008 / Manuela Xavier, Ana Cavalcanti, Augusto Sampaio -
Equational Abstractions for Model Checking Erlang Programs
Abstract This paper provides a contribution to the formal verification of programs written in the concurrent functional programming language Erlang, which is designed for telecommunication applications. It presents a formal description of this...
2005 / Thomas Noll -
Directed Homology2004 / Ulrich Fahrenberg
-
Return Value Prediction meets Information Theory
Abstract Accurate return value prediction is a key tool for enabling effective speculative method-level parallelism, which will be a standard feature in the next generation of chip-multiprocessor architectures. In this paper we give some information ...
2006 / Jeremy Singer, Gavin Brown -
Compositional Model Checking of product-form CTMCs
Abstract Product form Markov chains are a class of compositional Markovian models that can be proved to benefit from a decomposed solution of the steady-state distribution (i.e. the steady-state distribution is given by the product of the...
2009 / Paolo Ballarini, András Horváth