Computer and information sciences topic list of research papers
-
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
Abstract We investigate the question of how much hybrid machinery can be added to the interval neighbourhood logic PNL and its metric extension MPNL without losing the decidability of their satisfiability problem in N. In particular, we consider the ...
2011 / Dario Della Monica, Valentin Goranko, Guido Sciavicco -
Time Separation of Events: An Inverse Method
Abstract The problem of “time separation” can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, what is the maximum time for traversing the global system? This problem ...
2008 / Emmanuelle Encrenaz, Laurent Fribourg -
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
Abstract Formal systems for cryptographic protocol analysis typically model cryptosystems in terms of free algebras. Modeling the behavior of a cryptosystem in terms of rewrite rules is more expressive, however, and there are some attacks that can...
2005 / Christopher Lynch, Catherine Meadows -
Formality, Evolution, and Model-driven Software Engineering
Abstract This paper introduces an approach to software development in which a series of working implemen- tations are generated automatically from a series of formal specifications. The implementations are data stores, communicating through standard ...
2005 / Jim Davies, Charles Crichton, Edward Crichton, David Neilson, Ib Holm Sørensen -
Consistent Partial Model Checking2004 / Michael Huth, Shekhar Pradhan
-
Equivalences for Silent Transitions in Probabilistic Systems
Abstract We address abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model. In particular, we define the notion of branching bisimilarity and study its properties by...
2005 / S. Andova, T.A.C. Willemse -
Token-passing Nets for Functional Languages
Abstract Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the λ-calculus in interaction nets. This work extends token-passing nets to cover a typed functional language equipped with structured...
2008 / José Bacelar Almeida, Jorge Sousa Pinto, Miguel Vilaça -
Mathematical Knowledge Management Symposium 20032004 / Fairouz Kamareddine
-
Reduced Functional Consistency of Uninterpreted Functions
Abstract A reduction of Equality Logic with Uninterpreted Functions (EUF) to Equality Logic with Ackermann's method suffers from a quadratic growth in the number of functional consistency constraints (constraints of the form ...
2006 / Amir Pnueli, Ofer Strichman -
A Framework for Stochastic System Modelling and Analysis
Abstract Stochastic Graph Transformation combines the benefits of graphical modelling with stochastic analysis techniques. In this paper we report on our framework Sma for Stochastic Modelling and Analysis, and SGT⋆, a tool which uses the framework...
2006 / Sebastian Menge, Georgios Lajios -
A Functional Algorithm for Exact Real Integration with Invariant Measures
Abstract We develop an algorithm for exact real integration over a class of self-similar spaces and measures defined by Hutchinson. We construct the algorithm in an idealised lazy functional programming language and prove its correctness using...
2008 / Adam Scriven -
Architecture Description for Mobile Distributed Systems Using Typed π-Calculus
Abstract In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on typed π-calculus. Different from other approaches, the non-functional properties, which are essential when mobile architectures are ...
2006 / Volker Gruhn, Clemens Schäfer -
Simulating Algebraic Specification Genericity on Languages with Initial Semantics
Abstract This paper discusses the concept of genericity often used in algebraic specification languages and how this concept can be simulated in a meta level in languages with purely initial semantics, as it is the case for ELAN and ASF+SDF. This...
2004 / Anamaria Martins Moreira, Anderson Santana de Oliveira -
What You Lose is What You Leak: Information Leakage in Declassification Policies
Abstract This paper suggests the following approach for checking whether a program satisfies an information flow policy that may declassify secret information: (a) Compute a finite abstract domain that over-approximates the information released by...
2007 / Anindya Banerjee, Roberto Giacobazzi, Isabella Mastroeni -
Propagation time for zero forcing on a graph
Abstract Zero forcing (also called graph infection) on a simple, undirected graph G is based on the color-change rule: if each vertex of G is colored...
2012 / Leslie Hogben, My Huynh, Nicole Kingsley, Sarah Meyer, Shanise Walker, et al. -
A personalized recommendation framework based on cam and document annotations
Abstract This paper presents a solution for recommending documents to students according to their current activity that is tracked in terms of semantic annotations associated to the accessed resources. Our approach is based on an existing tracking...
2010 / Julien Broisin, Mihaela Brut, Valentin Butoianu, Florence Sedes, Philippe Vidal -
AUC Maximizing Support Vector Machines with Feature Selection
Abstract In this paper, we proposed a new algorithm, the Sparse AUC maximizing support vector machine, to get more sparse features and higher AUC than standard SVM. By applying p-norm where 0 < p < 1 to the weight w of the separating...
2011 / Yingjie Tian, Yong Shi, Xiaojun Chen, Wenjing Chen -
PSO with mutation for fuzzy classifier design
Abstract One of the important issues in the design of fuzzy classifiers is the formation of fuzzy if-then rules and the membership functions. This paper presents a hybrid Particle Swarm Optimization based approach for fuzzy classifier design which...
2010 / C. Rania, S.N. Deepa -
Optical omega networks with centralized buffering and wavelength conversion
Abstract In this paper, we study the internal blocking problem in optical Multistage Interconnection Networks (MINs). We introduce algorithms to resolve internal blocking in optical MINs based on buffering and/or wavelength conversion. Since the...
2011 / Abdulaziz S. Almazyad -
Preface2009 / Patrícia D.L. Machado