Computer and information sciences topic list of research papers
-
Requirements for a Practical Network Event Recognition Language
Abstract We propose a run-time monitoring and checking architecture for network protocols called Network Event Recognition. Our framework is based on passively monitoring the packet trace produced by a protocol implementation and checking it for...
2004 / Karthikeyan Bhargavan, Carl A. Gunter -
Reachability in Conditional Term Rewriting Systems
Abstract In this paper, we study the reachability problem for conditional term rewriting systems. Given two ground terms s and t, our practical aim is to prove s ↛ R ∗ ...
2004 / Guillaume Feuillade, Thomas Genet -
Prospec
Abstract Although formal verification techniques have been demonstrated to improve program dependability, software practitioners have not widely adopted them. One reason often cited is the difficulty in writing formal specifications. This paper...
2004 / Oscar Mondragón, Ann Q. Gates, Steven Roach -
Petri nets with generalized algebra: a comparison
Abstract In the last decade we can see substantial effort to develop an abstract and uniform constructions for Petri nets. Most of such abstractions are based on algebraic characterizations of Petri nets. They work mostly over commutative monoids...
2005 / Gabriel Juhás -
Preface
Abstract This volume contains the Proceedings of the 9th Workshop on Logic, Language, Information and Computation (WoLLIC'2002). The Workshop was held in Rio de Janeiro, Brazil from July 30 to August 2, 2002, in the campus of the Pontifícia...
2005 / Ruy de Queiroz, Luiz Carlos Pereira, Edward Hermann Haeusler -
Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach
Abstract The state space explosion problem in model checking remains the chief obstacle to the practical verification of real-world distributed systems. We attempt to address this problem in the context of verifying concurrent (message-passing) C...
2005 / Sagar Chaki, Joël Ouaknine, Karen Yorav, Edmund Clarke -
Preface
Abstract This volume contains the Proceedings of the Third Workshop on Coalgebraic Methods in Computer Science (CMCS'2000). The Workshop was held in Berlin, Germany on March 25 and 26, 2000, as satellite event to ETAPS'2000. During ...
2005 / Horst Reichel -
A Type System for Object Initialization In the Java Bytecode Language (summary)
Abstract In the standard Java implementation, a Java language program is compiled to Java bytecode and this bytecode is then interpreted by the Java Virtual Machine. Since bytecode may be written by hand, or corrupted during network transmission,...
2005 / Stephen N. Freund, John C. Mitchell -
An Operational Semantics for Handel-C1 1Handel-C is the registered trademark of Celoxica Ltd (www.celoxica.com)
Abstract We describe an operational semantics for the hardware compilation language Handel-C [10], which is a C-like language with channel communication and parallel constructs which compile down to mainly synchronously clocked hardware. The work in ...
2004 / Andrew Butterfield, Jim Woodcock -
Towards Fingerprinting Malicious Traffic
Abstract The primary intent of this paper is detect malicious traffic at the network level. To this end, we apply several machine learning techniques to build classifiers that fingerprint maliciousness on IP traffic. As such, J48, Näıve Bayesian,...
2013 / Amine Boukhtouta, Nour-Eddine Lakhdari, Serguei A. Mokhov, Mourad Debbabi -
Properties of Input-Consuming Derivations
Abstract We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations do not employ a fixed selection rule, and can be used to model the behavior of logic programs using dynamic scheduling and employing ...
2004 / A. Bossi, S. Etalle, S. Rossi -
Adequate Sets of Temporal Connectives in CTL
Abstract An adequate set of temporal connectives for CTL is a subset of the logic's temporal connectives that is sufficient to express equivalents for all CTL formulas. In this paper, a characterization of all such adequate sets is ...
2004 / Alan Martin -
Abstract Interpretation for Proving Secrecy Properties in Security Protocols
Abstract A cryptographic protocol is a distributed program that can be executed by several actors. Since several runs of the protocol within the same execution are allowed, models of cryptoprotocols are often infinite. Sometimes, for verification...
2004 / K. Adi, M. Debbabi -
Automatic Identification of Gasoline – Biofuel Blend Type in an Internal Combustion Four-stroke Engine based on Unsupervised Novelty Detection and Active Learning
Abstract In this study, unsupervised novelty detection was applied to determine automatically both the type of fuel and the blending ratio of the fuel mixture based on analysis vibrational signals during operation of a four-stroke combustion engine...
2014 / Xanthoula Eirini Pantazi, Dimitrios Moshou, Dimitrios Kateris, Ioannis Gravalos, Panagiotis Xyradakis -
Text-dependent speaker verification: Classifiers, databases and RSR2015
Abstract The RSR2015 database, designed to evaluate text-dependent speaker verification systems under different durations and lexical constraints has been collected and released by the Human Language Technology (HLT) department at Institute for...
2014 / Anthony Larcher, Kong Aik Lee, Bin Ma, Haizhou Li -
Human System Integration Ontology: Enhancing Model Based Systems Engineering to Evaluate Human-system Performance
Abstract As we move forward to integrate system descriptive models and system analytical models, there is a key opportunity to integrate other viewpoints into the system model. Specifically, we have the opportunity to extend current modeling...
2014 / Douglas W. Orellana, Azad M. Madni -
An A* Label-setting Algorithm for Multimodal Resource Constrained Shortest Path Problem
Abstract Multimodal resource constrained shortest path problem consists of finding a least travel time path with multiple resources and mode chain constraints on a multimodal transportation network. Existing solution approaches based on Lagrangian...
2014 / Tai-Yu Ma -
Accessibility to Mobile Interfaces for Older People
Abstract Accessibility is a major concern in our society nowadays. However, technology is always one step ahead and new devices appear before we can address the accessibility problems for the older ones. People with disabilities are not the only...
2014 / José-Manuel Díaz-Bossini, Lourdes Moreno -
Inferring Effective Types for Static Analysis of C Programs
Abstract The C language does not have a specific Boolean type: Boolean values are encoded with integers. This is also true for enumerated types, that may be freely and silently cast to and from integers. On the other hand, verification tools aiming...
2012 / Bertrand Jeannet, Pascal Sotin -
An elegant algorithm for the construction of suffix arrays
Abstract The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memory efficient alternative for suffix trees. The suffix array...
2014 / Sanguthevar Rajasekaran, Marius Nicolae