Computer and information sciences topic list of research papers
-
New differential fault analysis on PRESENT2013 / Nasour Bagheri, Reza Ebrahimpour, Navid Ghaedi
-
Towards Efficient, Typed LR Parsers
Abstract The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to...
2006 / François Pottier, Yann Régis-Gianas -
A Universal Cellular Automaton on the Ternary Heptagrid
Abstract In this paper, we construct the first weakly universal cellular automaton on the ternary heptagrid. It requires six states only. It provides a universal automaton with less states than in the case of the pentagrid where the best result is...
2008 / Maurice Margenstern, Yu Song -
Comparing Three Coordination Models: Reo, ARC, and RRD
Abstract Three models of coordination—Reo, Actors-Roles-Coordinators (ARC), and Reflective Russian Dolls (RRD)—are compared and contrasted according to a set of coordination features. Mappings between their semantic models are defined. Use of the...
2008 / Carolyn Talcott, Marjan Sirjani, Shangping Ren -
Preface2009 / Belo Horizonte, Elaine Pimentel, Mario Benevides
-
Modifying Contracts with Larissa Aspects
Abstract This paper combines two successful techniques from software engineering, aspect-oriented programming and design-by-contract, and applies them in the context of reactive systems. For the aspect language Larissa and contracts expressed with...
2008 / David Stauch -
Covering Steps Graphs of Time Petri Nets
Abstract We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper...
2009 / Hanifa Boucheneb, Kamel Barkaoui -
Towards Testing and Analysis of Systems that Use Serialization
Abstract Object serialization facilitates the flattening of structured objects into byte streams and is therefore important for all component-based applications that strongly rely on data-exchange among components. Unfortunately, implementing and...
2005 / Giovanni Denaro, Leonardo Mariani -
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
Abstract A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been...
2008 / Cezara Dragoi, Gheorghe Stefanescu -
Structural Encoding of Static Single Assignment Form
Abstract Static Single Assignment (SSA) form is often used as an intermediate representation during code optimization in Java Virtual Machines. Recently, SSA has successfully been used for bytecode verification. However, constructing SSA at the code ...
2005 / Andreas Gal, Christian W. Probst, Michael Franz -
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems
Abstract The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a long way ahead to become a pervasive reality. One of the reasons...
2006 / Fernando Rosa-Velardo, Olga Marroquín-Alonso, David de Frutos-Escrig -
Tagged Systems: A Framework for the Specification of History-dependent Properties
Abstract We propose a general method for the treatment of history-dependent runtime errors. When one has to control this kind of errors, a tagged version of the language is usually defined, in which tags capture only the necessary information of the ...
2005 / Fernando Rosa-Velardo, Clara Segura, David de Frutos-Escrig -
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Abstract Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result...
2008 / Alexander Kurz, Daniela Petrişan -
Constructing Induction Rules for Deductive Synthesis Proofs
Abstract We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of correct computer programs from specifications of their...
2006 / Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques Fleuriot -
A new wireless sensor platform with camera
Abstract there are several platforms of wireless sensor networks such as micaz, mica2, etc. Each of them has specific characteristics. But the complexity of novel applications requires new characteristics, which more and more new designs of wireless ...
2012 / Huang Liu, Shouyi Yin, Leibo Liu, Shaojun Wei -
Integrating Signature Apriori based Network Intrusion Detection System (NIDS) in Cloud Computing
Abstract One of the major security issues in Cloud computing is to detect malicious activities at the network layer. In this paper, we propose a framework integrating network intrusion detection system (NIDS) in the Cloud. Our NIDS module consists...
2012 / Chirag N. Modi, Dhiren R. Patel, Avi Patel, Muttukrishnan Rajarajan -
Information Extraction from the Un-Structured Document using Grammatical Inference and Alignment Similarity
Abstract Huge amount of information is available in un-structured (text) documents. Knowledge discovery in un-structured document has been recognized as promising task in the recent years. Since un-structured document is typically formatted for...
2012 / Ramesh Thakur, Suresh Jain, Narendra S. Chaudhari, Rahul Singhai -
Dual Mode VLSI Architecture for Spread Spectrum Image Watermarking using Binary Watermark
Abstract Digital watermarking applications include content protection for audio and video content, forensics and piracy deterrence, content filtering,communication of ownership and copyrights, document and image security, broadcast monitoring and...
2012 / Sudip Ghosh, Somsubhra Talapatra, Jayasree Sharma, Navonil Chatterjee, Hafizur Rahaman, et al. -
Route Social Network
Abstract When a problem occurs on the road, traffic can become a real nightmare. Even with current resources and technologies, it's very difficult to track down every road problem, such as car accidents, ice or work on the road, natural obstructions ...
2012 / Joel Fernandes, Pedro Oliveira, Catarina Silva, Luis Marcelino -
Pair-wise Testing Using Simulated Annealing
Abstract Pair-wise testing is a combinatorial testing technique that tests all possible pairs of input values. Although, finding a smallest set of test cases for pair-wise testing is NP-complete. In this paper we formulate the problem of finding a...
2012 / Manisha Patil, P.J. Nikumbh