Computer and information sciences topic list of research papers
-
Strategies and User Interfaces in Maude at Work
Abstract Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the...
2005 / Manuel Clavel -
Tiling Transactions in Rewriting Logic
Abstract We propose a modular high-level approach to the specification of transactions in rewriting logic, where the operational and the abstract views are related by suitable adjunctions between categories of tile theories and of rewrite theories. ...
2005 / Roberto Bruni, José Meseguer, Ugo Montanari -
Supermodular mechanism design2010 /
-
Lotteries in student assignment: An equivalence result2011 / Parag A. Pathak, Jay Sethuraman
-
Manipulative auction design2011 / Philippe Jehiel
-
Term Rewriting for Sale
Abstract Term rewriting has a large potential for industrial applications, but these applications are always larger than one could ever dream of: huge sets of rewrite rules and gigantic terms to rewrite pose interesting challenges for implementors...
2005 / M.G.J. van den Brand, P. Klint, C. Verhoef -
A formal approach for checking security properties in SecSpaces1 1Work partially supported by MEFISTO Progetto “Metodi Formali per la Sicurezza e il Tempo” and Microsoft Research Europe.
Abstract SecSpaces is a Linda-like coordination model whose aim is to provide a support for secure coordination in Open System applications. Substantially it provides a methodology to restrict the access to the objects stored in the shared...
2004 / Roberto Lucchi, Mario Bravetti, Roberto Gorrieri -
Long Normal Form Proof Search and Counter-Model Generation
Abstract This paper describes an algorithm of proof search for implicational formula in intuitionistic logic. It is based on a natural deduction style formulation of long normal form of simply typed λ-calculus. The algorithm returns a deduction...
2005 / Sachio Hirokawa, Daisuke Nagano -
From Algebras and Coalgebras to Dialgebras
Abstract This paper investigates the notion of dialgebra, which generalises the notions of algebra and coalgebra. We show that many (co)algebraic notions and results can be generalised to dialgebras, and investigate the essential differences between ...
2004 / Erik Poll, Jan Zwanenburg -
The complexity of scheduling TV commercials
Abstract Television commercial scheduling is a generalised form of partition problem, but the lengths involved are rather small, leaving the complexity of the problem unclear. This paper shows that the related problem of colour-restricted spot...
2005 / Klemens Hägele, Colm Ó Dúnlaing, Søren Riis -
Applying ELAN Strategies in Simulating Processors over Simple Architectures
Abstract The simulation of processors over simple architectures is important for enabling test and verification prior to the expensive implementation involved in the development of new hardware technologies. Arvind's group has illustrated how to...
2004 / Mauricio Ayala-Rincón, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, Reiner W. Hartenstein -
Semantic domains based on sets with families of equivalences
Abstract This paper contains a preliminary study of a class of spaces that can be seen as special cases of metric spaces. These spaces seem to cover all practical needs, as exemplified e.g. by the work in [2]. Their interest lies mainly in the fact...
2004 / Luís Monteiro -
On the Symbolic Reduction of Processes with Cryptographic Functions
Abstract We study the reachability problem for cryptographic protocols represented as processes relying on perfect cryptographic functions. We introduce a symbolic reduction system that can handle hashing functions, symmetric keys, and public keys....
2004 / Roberto Amadio -
Model Checking Erlang Programs – Abstracting the Context-Free Structure
Abstract We present an approach for the verification of Erlang programs using abstract interpretation and model checking. In previous work we defined a framework for abstract interpretations for Erlang. In this framework it is guaranteed, that the...
2004 / Frank Huch -
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
Abstract A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composition operator. This means the subfragments can be analyzed...
2004 / Assaf Kfoury, Geoffrey Washburn, J.B. Wells -
Timing Analysis and Code Generation of Vehicle Control Software using Taxys
Abstract PATH's automated vehicle control application software is responsible for the longitudinal and lateral control of each vehicle in a platoon [5]. The software consists of a set of processes running concurrently on a PC, reading data from...
2004 / Stavros Tripakis, Sergio Yovine -
DDoS Attack Analyzer: Using JPCAP and WinCap
Abstract Nowadays, Computers and their Networks leads to being complex and diverse systems that communicate with speed and flexible. There is always room for sophisticated and highly specific network/Packet analyzing tool. Network traffic monitoring ...
2016 / Pankaj Shinde, Thaksen J. Parvat -
Towards VR-based Systems for School Experiments
Abstract In this paper we present the steps towards a well-designed concept of a VR system for school experiments in scientific domains like physics, biology and chemistry. The steps include the analysis of system requirements in general, the...
2013 / Anton Sigitov, André Hinkenjann, Thorsten Roth -
Overview of Bayesian sequential Monte Carlo methods for group and extended object tracking
Abstract This work presents the current state-of-the-art in techniques for tracking a number of objects moving in a coordinated and interacting fashion. Groups are structured objects characterized with particular motion patterns. The group can be...
2013 / Lyudmila Mihaylova, Avishy Y. Carmi, François Septier, Amadou Gning, Sze Kim Pang, et al. -
Salient Features of Cluster based Routing for Mobile Networks
Abstract Clustering maps a physical network to its corresponding virtual network of interconnected clusters of nodes. A clustering based approach reduces traffic and communication overhead during the routing process. In this context, control...
2014 / Parag Kumar Guha Thakurt