Computer and information sciences topic list of research papers
-
Lazy Context Cloning for Non-Deterministic Graph Rewriting
Abstract We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and prove its correctness. Our strategy and its extension to narrowing are intended for the implementation of non-strict...
2007 / Sergio Antoy, Daniel W. Brown, Su-Hui Chiang -
Tags for Multi-Protocol Authentication
Abstract Formal methods have been proved successful in analyzing different kinds of security protocols. They typically formalize and study the security guarantees provided by cryptographic protocols, when executed by a (possibly unbounded) number of ...
2005 / Matteo Maffei -
Experiments with Non-Termination Analysis for Java Bytecode
Abstract Non-termination analysis proves that programs, or parts of a program, do not terminate. This is important since non-termination is often an unexpected behaviour of computer programs and exposes a bug in their code. While research has found...
2009 / Étienne Payet, Fausto Spoto -
Verified Safety and Information Flow of a Block Device
Abstract This work reports on the author's experience designing, implementing, and formally verifying a low-level piece of system software. The timing model and the adaptation of an existing information flow policy to a monadic framework are...
2008 / Paul Graunke -
Connectors as Designs
Abstract The complex interactions that appear in service-oriented computing make coordination a key concern in service-oriented systems. Over the past years, the need for high-confidence coordination mechanisms has intensified as new technologies...
2009 / Sun Meng, Farhad Arbab -
A Game Semantics for Proof Search: Preliminary Results
Abstract We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contains one element for each de Morgan pair of connectives in...
2006 / Dale Miller, Alexis Saurin -
PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems
Abstract We present a generic mediator, called PlatΩ, between text-editors and proof assistants. PlatΩ aims at integrated support for the development, publication, formalization, and verification of mathematical documents in a natural way as...
2007 / Marc Wagner, Serge Autexier, Christoph Benzmüller -
Requirements-Driven Verification of Web Services
Abstract We propose a requirements-driven approach to the design and verification of Web services. The proposed methodology starts from a requirements model, which defines a business domain at a “strategic” level, describing the participating...
2004 / Marco Pistore, Marco Roveri, Paolo Busetta -
Preface2008 / Peter Selinger
-
Local Module Checking for CTL Specifications
Abstract Model checking is a well known technique for the verification of finite state models using temporal logic specification. While model checking is suitable for transformational systems (also called closed systems), it is unsuitable for open...
2007 / Samik Basu, Partha S Roop, Roopak Sinha -
Preface2008 / Rachid Echahed
-
Measuring and Reducing Clutter in Euler Diagrams
Abstract When modelling with three or more sets Euler diagrams can become crowded or cluttered and their ability to intuitively represent relationships between sets diminishes. Projections are a notation that bring syntactic efficiency to Euler...
2005 / Chris John -
Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
Abstract Proofs Without Syntax [Hughes, D.J.D. Proofs Without Syntax. Annals of Mathematics 2006 (to appear), http://arxiv.org/abs/math/0408282 (v3). August 2004 submitted version also available: [35]] introduced...
2006 / Dominic J.D. Hughes -
Policies of System Level Pipeline Modeling
Abstract Pipelining is a well understood and often used implementation technique for increasing the performance of a hardware system. We develop several SystemC/C++ modeling techniques that allow us to quickly model, simulate, and evaluate...
2009 / Ed Harcourt -
Reactive Concurrent Programming Revisited
Abstract In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the absence of an event can be detected instantaneously. We...
2006 / Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani -
Efficient and Adaptive Threshold Signatures for Ad hoc networks
Abstract In this paper, we propose a secure, flexible, robust and fully distributed signature service, for ad hoc groups. In order to provide the service, we use a new threshold scheme, that allows to share a secret key among the current group...
2007 / Roberto Di Pietro, Luigi Vincenzo Mancini, Giorgio Zanin -
Elimination of Local Variables from Definite Logic Programs
Abstract In logic programming, a variable is said to be local if it occurs in a clause body but not in its head atom. It is well-known that local variables are the main cause of inefficiency (sometimes even incompleteness) in negative goal...
2005 / Javier Álvez, Paqui Lucio -
Motion in Augmented Reality Games: An Engine for Creating Plausible Physical Interactions in Augmented Reality Games2010 / Brian Mac Namee, David Beaney, Qingqing Dong
-
Service Discovery Framework Supported by EM Algorithm and Bayesian Classifier
Abstract Service oriented computing has become the main stream research field nowadays. Meanwhile, machine learning is a promising AI technology which can enhance the performance of traditional algorithm. Therefore, aiming at solving service...
2012 / Yanbin Peng -
Energy-aware multicast routing in manet based on particle swarm optimization
Abstract Mobile ad hoc is an autonomous network whose nodes can move. Multicast is a mechanism in the network that a node sends data to a set of nodes in the network. Finding a multicast tree which satisfies the problem constraints is a NP-Complete...
2012 / Alireza Sajedi Nasab, Vali Derhami, Leyli Mohammad Khanli, Ali Mohammad Zareha Bidoki