Computer and information sciences topic list of research papers
-
Hybrid blob and particle filter tracking approach for robust object tracking
Abstract Analysing and characterising human behaviour is now receiving much attention from the visual surveillance research community. Generally, human behaviour recognition requires human to be detected and tracked so that the trajectory patterns...
2010 / Sze Ling Tang, Zulaikha Kadim, Kim Meng Liang, Mei Kuan Lim -
An applicable master plan to develop city’s information technology infrastructure
Abstract Nowadays, communication devices are widespread exponentially. People use some of these devices in daily life like as using mobile to access for shopping from Internet and pay by credit cards or student email their homework to their teacher. ...
2011 / Saeed Sarencheh, Bahram Sadeghi Bigham -
A Relative Timed Semantics for BPMN
Abstract We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion ...
2009 / Peter Y.H. Wong, Jeremy Gibbons -
Data Privacy in Tuple Space Based Mobile Agent Systems
Abstract More recently, distributed variants of tuple spaces have been proposed to exploit the Linda model for programming distributed applications over wide area networks, possibly exploiting code mobility. However, the flexibility of the shared...
2005 / Lorenzo Bettini -
Error Diagnosis in Equivalence Checking of High Performance Microprocessors
Abstract We describe techniques for diagnosing errors in formal equivalence checking of RTL and transistor level models of high performance microprocessors at Freescale Semiconductor Inc. We use Symbolic Trajectory based Evalaution (STE) for...
2007 / Alper Sen -
Work in Progress: Automatic Generation of Algorithm Animations for Lecture Slides
Abstract Algorithm visualizations have not been widely adopted in teaching. One possible reason for this is that visualizations are often developed as standalone systems which can be difficult to integrate into lectures. Recently XML based formats...
2009 / Otto Seppälä, Ville Karavirta -
Separation Logic Verification of C Programs with an SMT Solver
Abstract This paper presents a methodology for automated modular verification of C programs against specifications written in separation logic. The distinguishing features of the approach are representation of the C memory model in separation logic...
2009 / Matko Botinčan, Matthew Parkinson, Wolfram Schulte -
An Algebra of Pure Quantum Programming
Abstract We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previously developed denotational semantics of QML. The completeness ...
2007 / Thorsten Altenkirch, Jonathan Grattage, Juliana K. Vizzotto, Amr Sabry -
Bigraphs and Their Algebra
Abstract Bigraphs are a framework in which both existing process calculi and new models of behaviour can be formulated, yielding theory that is shared among these models. A short survey of the main features of bigraphs is presented, showing how they ...
2008 / Robin Milner -
A Statistically Customisable Web Benchmarking Tool
Abstract We describe a statistically customisable solution for Web benchmarking that includes three utilities: an Internet traffic generator for HTTP traffic, an static and dynamic Web pages generator in the Web server that is going to be tested and ...
2009 / Katja Gilly, Carlos Quesada-Granja, Salvador Alcaraz, Carlos Juiz, Ramon Puigjaner -
TILC: The Interactive Lambda-Calculus Tracer
Abstract This paper introduces TILC: the interactive lambda-calculus tracer. TILC aims to be a friendly user graphical application that helps teaching/studying the main basic concepts of pure untyped lambda-calculus. This is achieved by allowing...
2009 / David Ruiz, Mateu Villaret -
An Evolutionary Trust and Distrust Model
Abstract In this paper we propose a trust model, where besides considering trust and distrust, we also consider another parameter that measures the reliability on the stability of trust or distrust. The inclusion of this new parameter will allow us...
2009 / Isaac Agudo, Carmen Fernández-Gago, Javier Lopez -
Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations
Abstract In nowadays applications of temporal deontic logic to the verification of security policies, an issue arises concerning the temporal inheritance of future directed obligations that have net yet been met. We investigate decision procedures...
2009 / Philippe Balbiani, Jan Broersen, Julien Brunel -
Operational Semantics and Rewriting Logic in Membrane Computing2006 / Oana Andrei, Dorel Lucanu, Gabriel Ciobanu
-
Compositional State Space Reduction Using Untangled Actions
Abstract We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a failure-based equivalence which preserves divergences) that...
2007 / Xu Wang, Marta Kwiatkowska -
Engineering of An Assertion-based PSLSimple-Verilog Dynamic Verifier by Alternating Automata
Abstract Alternating Finite Automata (AFA) has linear space complexity in representing Linear-Time Temporal Logics. However, It is difficult to manipulate AFA in the run-time. In this paper, we focus on implementation methods to make alternating...
2008 / Naiyong Jin, Chengjie Shen, Jun Chen, Taoyong Ni -
A Distributed Implementation of Mobile Maude
Abstract We present a new specification/implementation of the mobile agent language Mobile Maude. This new version uses the external sockets provided by Maude since its 2.2 version, thus obtaining a really distributed implementation of the mobile...
2007 / Francisco Durán, Adrián Riesco, Alberto Verdejo -
Distributed Verification of Multi-threaded C++ Programs
Abstract Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper presents our efforts in addressing these issues by combining...
2008 / Stefan Edelkamp, Shahid Jabbar, Damian Sulewski -
Adaptive Latency Insensitive Protocols and Elastic Circuits with Early Evaluation: A Comparative Analysis
Abstract Latency Insensitive Protocols (LIP) and Elastic Circuits (EC) solve the same problem of rendering a design tolerant to additional latencies caused by wires or computational elements. They are performance-limited by a firing semantics that...
2009 / Mario R. Casu, Luca Macchiarulo -
Structured Types and Separation Logic
Abstract Structured types, such as C's arrays and structs, present additional challenges in pointer program verification. The conventional proof abstractions, multiple independent typed heaps and separation logic, which in previous work have been...
2008 / Harvey Tuch