Computer and information sciences topic list of research papers
-
Implementing Local Intervals in CASL
Abstract This paper defines the basis for the implementation in CASL (Common Algebraic Specification Language) of an interval library such that intervals behave as real numbers endowed with an error information. To achieve that, we redefine the...
2007 / Regivan H.N. Santiago, Anamaria M. Moreira, Katiane R. Lopes -
Distilling Programs for Verification
Abstract In this paper, we show how our program transformation algorithm called distillation can not only be used for the optimisation of programs, but can also be used to facilitate program verification. Using the distillation algorithm, programs...
2007 / G.W. Hamilton -
A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming
Abstract This paper presents a proposal for the cooperation of solvers in constraint functional logic programming, a quite expressive programming paradigm which combines functional, logic and constraint programming using constraint lazy narrowing as ...
2007 / S. Estévez-Martín, A.J. Fernández, T. Hortalá-González, M. Rodríguez-Artalejo, F. Sáenz-Pérez, et al. -
Probabilistic Barbed Congruence
Abstract This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence result, we provide a sound and complete axiomatisation for the...
2007 / Yuxin Deng, Wenjie Du -
Full Abstraction Without Synchronization Primitives
Abstract Using game semantics, we prove a full abstraction result (with respect to the may-testing preorder) for Idealized Algol augmented with parallel composition ( IA ...
2010 / Andrzej S. Murawski -
A Formal Approach to Service Specification and Matching based on Graph Transformation
Abstract When Web services are composed by linking service providers and requestors, the requestor's requirements for a "useful" service have to be matched against the service description offered by the provider. Among other things, service...
2004 / R. Heckel, A. Cherchago, M. Lohmann -
Reachability in Tree-Like Component Systems is PSPACE-Complete
Abstract The reachability problem in component systems is PSPACE-complete. We show here that even the reachability problem in the subclass of component systems with “tree-like” communication is PSPACE-complete. For this purpose we reduce the...
2010 / Mila Majster-Cederbaum, Nils Semmelrock -
Application Security Models for Mobile Agent Systems
Abstract Mobile agents are a distributed computing paradigm based on mobile autonomous programs. Mobile applications must balance security requirements with available security mechanisms in order to meet application level security goals. We...
2006 / J. Todd McDonald, Alec Yasinsac -
Context Management for Adaptive Information Systems
Abstract Modern technologies enable users accessing services using multiple channels. In the service design phase, this poses additional requirements for high software adaptivity along different technical requirements and different user...
2006 / Cinzia Cappiello, Marco Comuzzi, Enrico Mussi, Barbara Pernici -
Towards Model Transformation in Generated Eclipse Editor Plug-Ins
Abstract With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated code generation or verification in the software development process. In this paper, we ...
2006 / Karsten Ehrig, Claudia Ermel, Stefan Hänsgen -
From Distributed Memory Cycle Detection to Parallel LTL Model Checking
Abstract In [J. Barnat, L. Brim, and J. Chaloupka. Parallel Breadth-First Search LTL Model-Checking. In 18th IEEE International Conference on Automated Software Engineering (ASE'03), pages 106–115. IEEE Computer Society, Oct. 2003.] we proposed a...
2005 / J. Barnat, L. Brim, J. Chaloupka -
Tool Support for Pattern Selection and Use
Abstract Models are the main artifacts in Model Driven Engineering (MDE). Hence, the quality assessment of models is an important issue in MDE. Using pattern languages, while building software in the MDE approach, is of special interest to...
2009 / Bahman Zamani, Greg Butler, Sahar Kayhani -
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Abstract An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous work in that tuple distributivity is not assumed and set...
2008 / Lunjin Lu -
METHODS FOR SIMILARITY-BASED VIRTUAL SCREENING
Abstract Developing new medical drugs is expensive. Among the first steps is a screening process, in which molecules in existing chemical libraries are tested for activity against a given target. This requires a lot of resources and manpower....
2013 / Thomas G. Kristensen, Jesper Nielsen, Christian N.S. Pedersen -
A Novel Framework for Hypervisor Design
Abstract The paper discusses the constructive framework for writing hypervisor on the top of the VM. Hypervisor plays a vital role in monitoring VM in cloud. Hypervisors are system programs that virtualizes the running of the architecture. These are ...
2016 / M. Ambika, Kolasani Ramchand H. Rao -
"Intelligent Environments: a manifesto"2013 / Juan C Augusto, Vic Callaghan, Diane Cook, Achilles Kameas, Ichiro Satoh
-
A Technique of Filtering Dirty Data Based on Temporal- Spatial Correlation in Wireless Sensor Network
Abstract The problem of filtering dirty data in wireless sensor network is studied in this paper. To solve the problem, the technique of filtering dirty data based on temporal-spatial correlation is proposed. The technique takes advantage of the...
2011 / Chun-Hua Zhou, Bing Chen, Yong Gao, Chao Zhang, Zhan-Jie Guo -
Color-families are dense
Abstract Graphs, regarded as grammar forms as well as coloring specifications, induce graph-families, so-called color-families. In this paper a minimal producer-graph for every color-family is introduced and as the main result it is shown that...
2002 / E. Welzl -
Eine Neue invariante für kontextfreie sprachen
Abstract Let G = (V, T, P, S) a c.f. grammar and F(V ⌣ T) the free group generated by V ⌣ T, ( (G) = F(V ⌣ T/P is the quotient of F (V ⌣ T) factorized by the relationsystem generated by P. We prove that...
2002 / Günter Hotz -
Evaluation of Nicotiana Tabacum (FCV) Quality Using Off-Line Machine Vision
Abstract A number of techniques have been proposed in the past for automatic quality evaluations of pre–processed tobacco using image processing. Although some studies have aimed to evaluate the quality of processed tobacco. There is no automatic...
2012 / Kavindra R. Jain, Latesh N. Patel, Hitesh B. Shah, Chintan K. Modi