Computer and information sciences topic list of research papers
-
Electroencephalograms for Ubiquitous Robotic Systems
Abstract Ubiquitous robotics augments the capabilities of one or more robots by leveraging ubiquitous computational and/or sen- sorial resources. Augmentation complements and/or enhances the capabilities of one or more robots while such robots can...
2013 / David Swords, Anara Sandygulova, Sameh Abdalla, Gregory M.P. O’Hare -
Hybrid Detector for Detection of Black Holes in Manets
Abstract MANET is building the new era for next-generation wireless world. In these types of networks routing of packets occurs in an infrastructure less network where identifying the faults and detecting is extremely difficult because of the...
2013 / J. Manoranjini, A. Chandrasekar, D. Rajinigirinath -
Continuation Models for the Lambda Calculus With Constructors
Abstract The lambda calculus with constructors decomposes the pattern matching à la ML into some atomic rules. Some of them do not match with the usual computational intuitions (in particular with typing intuitions). However it is possible to define ...
2012 / Barbara Petit -
Towards an Awareness-Based Semantics for Security Protocol Analysis
Abstract We report on work-in-progress on a new semantics for analyzing security protocols that combines complementary features of security logics and inductive methods. We use awareness to model the agents' resource-bounded reasoning and, in doing...
2004 / Rafael Accorsi, David Basin, Luca Viganò -
Run-Time Analysis for Atomicity
Abstract Writing and debugging concurrent (shared-variable) programs is notoriously difficult. This motivated the development of numerous static analysis and run-time analysis techniques designed to (help) ensure that concurrent programs satisfy...
2004 / Liqiang Wang, Scott D. Stoller -
Tool Supported Test Frameworks in TTCN-3
Abstract This paper presents the concept of test frameworks and the specification and implementation of test frameworks in TTCN-3 being the Testing and Test Control Notation for black-box and grey-box tests of reactive systems. Test frameworks...
2004 / Ina Schieferdecker, Theofanis Vassiliou-Gioles -
A Branching Time Logical System for Open Distributed Systems Development
Abstract We propose a new first-order many-sorted branching-time logical system with equality devoted to support the development of open distributed systems. The inherent characteristics of this family of systems, which ought to be treated in...
2004 / Carlos H.C. Duarte, Tom Maibaum -
A Simplified Account of the Metatheory of Linear LF1 1This material is based on work supported in part by NSF grants CCR-9984812 and CCR-0121633. Any opinions, findings, and conclusions or recommendations in this publication are those of the authors and do not reflect the views of this agency.
Abstract We present a variant of the linear logical framework LLF that avoids the restriction that well-typed terms be in pre-canonical form and adds λ-abstraction at the level of families. We abandon the use of β-conversion as definitional equality ...
2004 / Joseph C. Vanderwaart, Karl Crary -
AppRush: Using Dynamic Shortcuts to Facilitate Application Launching on Mobile Devices
Abstract When there are many applications (apps) installed on a mobile device, the simple task of launching an app could become inconvenient, as the user may need to swipe the screen several times to find the desired app. In this paper, we present...
2013 / Chen Sun, Jun Zheng, Huiping Yao, Yang Wang, D. Frank Hsu -
The Maude LTL Model Checker
Abstract The Maude LTL model checker supports on-the-fly explicit-state model checking of concurrent systems expressed as rewrite theories with performance comparable to that of current tools of that kind, such as SPIN. This greatly expands the...
2005 / Steven Eker, José Meseguer, Ambarish Sridharanarayanan -
Weak Reduction and Garbage Collection in Interaction Nets
Abstract This paper presents an implementation device for the weak reduction of interaction nets to interface normal form. The results produced by running several benchmarks are given, suggesting that weak reduction greatly improves the performance...
2005 / Jorge Sousa Pinto -
Redundancy of Arguments Reduced to Induction
Abstract We demonstrate that the problem of identifying redundant arguments of function symbols, i.e. parameters which can be replaced by any expression without changing the associated semantics, boils down to proving the validity of a particular...
2004 / María Alpuente, Rachid Echahed, Santiago Escobar, Salvador Lucas -
Hardness results for weak bisimilarity of simple process algebras
Abstract We do not know whether weak bisimilarity (denoted ≈) is decidable for general BPA and BPP but we may try to estimate what would be a least complexity of a decision procedure that might exist. That is achieved by taking problems complete for ...
2005 / Jitka StříAbrná -
Phase Semantics for Light Linear Logic (Extended Abstract)
Abstract Light linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of fibred phase spaces. Strong completeness is...
2005 / Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov -
Model-Based Verification and Validation of Properties
Abstract One of the key issues in software development, like in all engineering problems, is to ensure that the product delivered meets its specification. Verification and validation are well-established techniques for ensuring the quality of a...
2004 / Gregor Engels, Jochen M. Küster, Reiko Heckel, Marc Lohmann -
Term Rewriting with Type-safe Traversal Functions
Abstract Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. In this paper, many-sorted first-order term...
2004 / M.G.J. van den Brand, P. Klint, J.J. Vinju -
OnDemandOBJ
Abstract Strategy annotations are used in rule-based programming languages such as OBJ2, OBJ3, CafeOBJ, and Maude to improve efficiency and/or reduce the risk of nontermination. Syntactically, they are given either as lists of natural numbers or as...
2004 / María Alpuente, Santiago Escobar, Salvador Lucas -
Safe Composition of Linda-based Components
Abstract Component-Based Software Development is an emerging discipline in the field of Software Engineering. When constructing component-based systems, we must be sure that the cooperative behaviour of the components and their interaction will be...
2004 / Ana M. Roldan, Ernesto Pimentel, Antonio Brogi -
Spatial Pattern Discovering by Learning the Isomorphic Subgraph from Multiple Attributed Relational Graphs
Abstract Inexact graph matching has been widely investigated to relate a set of object/scene primitives extracted from an image to a set of counterparts representing a model or reference. However, little has been done to address how to build such a...
2004 / Pengyu Hong, Thomas S. Huang -
Metalevel Computation in Maude
Abstract Maude's language design and implementation make systematic use of the fact that rewriting logic is reflective. This makes the metatheory of rewriting logic accessible to the user in a clear and principled way, and makes possible many...
2005 / M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, et al.