Computer and information sciences topic list of research papers
-
An Gen2 Based Security Authentication Protocol for RFID System
Abstract EPC Class-1 Generation-2 specification(Gen2 in brief) has been accepted as the standard for RFID tags under grant number ISO18000-6C. However, Gen2 does not pay due attention to security. For this reason, a Gen2 based security...
2012 / Xiaoluo Yi, Liangmin Wang, Dongmei Mao, Yongzhao Zhan -
Roles as a Coordination Construct: Introducing powerJava
Abstract In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the features of roles are their dependence on an institution, and the...
2006 / Matteo Baldoni, Guido Boella, Leendert van der Torre -
Preface2007 / Flavio Corradini, Carlo Toffalori
-
Preface2005 / Maribel Fernández
-
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
Abstract In Descriptive Complexity, we investigate the use of logics to characterize computational complexity classes. Since 1974, when Fagin proved that the class NP is captured by existential second-order logic, considered the first result in this ...
2011 / Cibele Matos Freire, Ana Teresa Martins -
Security Abstractions and Intruder Models (Extended Abstract)
Abstract Process algebraic specifications of distributed systems are increasingly being targeted at identifying security primitives well-suited as high-level programming abstractions, and at the same time adequate for security analysis and...
2009 / Michele Bugliesi, Riccardo Focardi -
A Logic for Graphs with QoS
Abstract We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing whether two sites are connected, but we want to express the...
2005 / Gianluigi Ferrari, Alberto Lluch-Lafuente -
Contraction-free Proofs and Finitary Games for Linear Logic
Abstract In the standard sequent presentations of Girard's Linear Logic [Girard, J.-Y., Linear logic, Theoretical Computer Science 50 (1987), pp. 1–102] (LL), there are two “non-decreasing” rules, where the premises are not smaller than the...
2009 / André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz -
Systematic Semantic Tableaux for PLTL
Abstract The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisfaction is made from the graph and it does not correspond with ...
2008 / J. Gaintzarain, M. Hermo, P. Lucio, M. Navarro -
Concurrent Transaction Frame Logic Formal Semantics for UML Activity and Class Diagrams
Abstract We propose Concurrent Transaction Frame Logic (CTFL) as a language to provide formal semantics to UML activity and class diagrams. CTFL extends first-order Horn logic with object-oriented class hierarchy and object definition terms, and...
2004 / Franklin Ramalho, Jacques Robin, Ulrich Schiel -
Axioms for Probability and Nondeterminism
Abstract This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. We present a domain model and an operational semantics for our calculus. The denotational model uses the probabilistic ...
2004 / Michael Mislove, Joël Ouaknine, James Worrell -
Web Categorisation Using Distance-Based Decision Trees
Abstract In Web classification, web pages are assigned to pre-defined categories mainly according to their content (content mining). However, the structure of the web site might provide extra information about their category (structure mining)....
2006 / V. Estruch, C. Ferri, J. Hernández-Orallo, M.J. Ramírez-Quintana -
Describing Secure Interfaces with Interface Automata
Abstract Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface structure for security (ISS), that allows for the modelling of...
2010 / Matias Lee, Pedro R. D'Argenio -
Signature Compilation for the Edinburgh Logical Framework
Abstract This paper describes the Signature Compiler, which can compile an LF signature to a custom proof checker in either C++ or Java, specialized for that signature. Empirical results are reported showing substantial improvements in...
2008 / Michael Zeller, Aaron Stump, Morgan Deters -
From Active Names to π-calculus Rewriting Rules
Abstract The problem of checking equivalences for π-agents is not trivial and has been widely studied in the last decade. Syntactic and semantic approaches can be taken to formally verify π-calculus equivalences. The syntactic approach rests mainly...
2005 / Ana C.V. de Melo -
Abstract Graph Transformation
Abstract Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alternative to bit vectors. The corresponding transitions are obtained as...
2006 / Arend Rensink, Dino Distefano -
A Formal Framework for Web Services Coordination
Abstract Recently the term Web Services Choreography has been introduced to address some issues related to Web Services Composition and Coordination. Several proposals for describing Choreography for Business Processes have been presented in the...
2007 / Claudio Guidi, Roberto Lucchi, Manuel Mazzara -
Preface2006 / Arend Rensink, Reiko Heckel, Barbara König
-
Characterization of Single Cycle CA and its Application in Pattern Classification
Abstract The special class of irreversible cellular automaton (CA) with multiple attractors is of immense interest to the CA researchers. Characterization of such a CA is the necessity to devise CA based solutions for diverse applications. This work ...
2009 / Sukanta Das, Sukanya Mukherjee, Nazma Naskar, Biplab K. Sikdar -
Rewriting-Based Access Control Policies
Abstract In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic term, which allows us to model several aspects of the policy...
2007 / Anderson Santana de Oliveira