Computer and information sciences topic list of research papers
-
A Term Rewriting Technique for Decision Graphs
Abstract We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to...
2009 / Bahareh Badban -
A Hybrid Public Announcement Logic with Distributed Knowledge
Abstract In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has been changed such that nominals only partially denote states....
2011 / Jens Ulrik Hansen -
Building Reputations for Internet Clients
Abstract We propose a design of a client reputation system that can be used to reduce unwanted traffic in the Internet. Many reputation systems proposed in the trust literature are provider-oriented, but because of different use and adversary...
2007 / Songjie Wei, Jelena Mirkovic -
Synthesis of Mealy Machines Using Derivatives
Abstract In Rutten [Rutten, J., Algebraic specification and coalgebraic synthesis of Mealy machines, Technical Report SENR0514, Centrum voor Wiskunde en Informatica (CWI) (2005), to appear in Proceedings FACS 2005] the theoretical basis was given...
2007 / Helle Hvid Hansen, David Costa, Jan Rutten -
Expressiveness of Probabilistic π-calculus
Abstract In this work we propose a probabilistic extension of the π-calculus. The main novelty is a probabilistic mixed choice operator, that is, a choice construct with a probability distribution on the branches, and where input and output actions...
2006 / Sylvain Pradalier, Catuscia Palamidessi -
Design and development of an adaptive mesh manipulation module for detailed FEM simulation of flows
Abstract We present a strategy to develop a mesh manipulation module of a flexible and robust adaptive finite element application that will perform accurate modelling of flows, handling complicated computational domains. We describe guidelines for...
2010 / Krzysztof Banaś, Kazimierz Michalik -
Raising the order of multivariate approximation schemes using supplementary derivative data
Abstract We propose a generic procedure to raise the approximation order of multivariate approximation schemes using supplementary derivative data. The procedure applies to all schemes that reproduce polynomials to a certain degree, including most...
2010 / Dirk Kraaijpoel, Tristan van Leeuwen -
E-learning success model for instructors’ satisfactions in perspective of interaction and usability outcomes
Abstract E-learning approaches could be handled in a system design view in which the system components and factors have critical roles in order to assure success of whole system. In such an e-learning design view, online instructors (or faculties)...
2011 / Ilker Yengin, Adem Karahoca, Dilek Karahoca -
Parallel signal processing with S-Net
Abstract We argue that programming high-end stream-processing applications requires a form of coordination language that enables the designer to represent interactions between stream-processing functions asynchronously. We further argue that the...
2010 / Frank Penczek, Stephan Herhut, Clemens Grelck, Sven-Bodo Scholz, Alex Shafarenko, et al. -
IODA - an Interactive Open Document Architecture
Abstract Objective of the proposed architecture is to enable representing an electronic document as a multi-layered structure of executable digital objects, which is extensible and without a need to support any particular formats or user interfaces. ...
2011 / J. Siciarek, B. Wiszniewski -
Towards Test Purpose Generation from CTL Properties for Reactive Systems
Abstract This paper presents an approach for the generation of test purposes in the form of labelled transition systems from specifications of properties in CTL. The approach is aimed at adapting the model checking process, by extending search...
2006 / Daniel Aguiar da Silva, Patrícia D.L. Machado -
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Abstract Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, that co-operate to accomplish a large sensing task. Such...
2007 / Ioannis Chatzigiannakis, Elisavet Konstantinou, Vasiliki Liagkou, Paul Spirakis -
GUPRO - Generic Understanding of Programs An Overview
Abstract GUPRO is an integrated workbench to support program understanding of heterogenous software systems on arbitrary levels of granularity. GUPRO can be adapted to specific needs by an appropriate conceptual model of the...
2005 / Jürgen Ebert, Bernt Kullbach, Volker Riediger, Andreas Winter -
Adaptive sliding menubars make existing software more accessible to people with severe motion impairments2013 / Christopher W. Kwan, Isaac Paquette, John J. Magee, Margrit Betke
-
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Abstract Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous data-flow programs with Boolean and numerical variables, e.g....
2010 / Peter Schrammel, Bertrand Jeannet -
Bisimulations Generated from Corecursive Equations
Abstract We consider the problem of determining the unicity of solutions for corecursive equations. This can be done by transforming the equations into a guarded form, that is, representing them as a coalgebra. However, in some examples this...
2010 / Venanzio Capretta -
Verification of A Key Chain Based TTP Transparent CEM Protocol
Abstract In certified email (CEM) protocols, TTP transparency is an important security requirement which helps to avoid bad publicity as well as protecting individual usersʼ privacy. Recently we have extended the CEM protocol of Cederquist et al. to ...
2011 / Zhiyuan Liu, Jun Pang, Chenyi Zhang -
The Mechanical Verification of a DPLL-Based Satisfiability Solver
Abstract Recent years have witnessed dramatic improvements in the capabilities of propositional satisfiability procedures or SAT solvers. The speedups are the result of numerous optimizations including conflict-directed backjumping. We use the...
2011 / Natarajan Shankar, Marc Vaucher -
Measuring a Java Test Suite Coverage Using JML Specifications
Abstract We propose in this paper a way to measure the coverage of a Java test suite by considering the JML specification associed to the Java program under test. This approach is based on extracting a predicate-based graph from the JML method...
2007 / F. Dadeau, Y. Ledru, L. du Bousquet -
Steering of Discrete Event Systems: Control Theory Approach
Abstract Runtime verification involves monitoring the system at runtime to check for conformance of the execution trace to user defined safety properties. Typically, run-time verifiers do not assume a system model and hence cannot predict violations ...
2006 / Arvind Easwaran, Sampath Kannan, Oleg Sokolsky