Computer and information sciences topic list of research papers
-
The Reverse Problem of Range Query
Abstract We design an efficient algorithm for the reverse problem of the two-dimensional range query. In the range query problem, we specify a range of a rectangular shape in a given (n,n) array, and count the number of points in the range. If the...
2004 / Tadao Takaoka -
Secure and Interoperable e-Learning Platforms Based on Web Services
Abstract Distance education's popularity is increasing day by day and has become one of the most preferred methods for obtaining information. It provides great facilities in many aspects according to traditional education. With these improvements,...
2012 / Umit Kocabicak, Deniz Dural -
Lifting in Z
Abstract Formal notations such as Z provide powerful support for writing clear specifications, and for undertaking proofs of properties of those specifications. In this paper, we explore one particular style of specification, with applications in...
2004 / Andrew Martin, Colin Fidge -
Testing Concurrent Java Programs using Randomized Scheduling
Abstract The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness but are not easily scalable to large programs. The approach...
2004 / Scott D. Stoller -
Operational Semantics for Functional Logic Languages* *This work has been partially supported by CICYT TIC 2001-2705-C03-01, by Acción Integrada Hispano-Alemana HA2001-0059, by Acc. Int. Hispano-Austriaca HU2001-0019, by Acc. Int. Hispano-Italiana HI2000-0161, and by the DFG under grant Ha 2457/1-2.
Abstract In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential, for instance, to have appropriate language definitions in...
2004 / Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, Germán Vidal -
Slicing Event Spaces
Abstract Java event spaces are partial orders of memory and thread actions as generated by a multi-threaded Java program in execution. This paper shows how standard techniques of slicing can be used to reduce the size of Java event spaces....
2004 / Néstor Cataño -
Modeling Petri Net Based Systems by Net Transformations
Abstract Net transformations are used as powerful techniques for manipulation of Petri net based models. They allow arbitrary modification of a given net, including the change of given net class. This paper presents a summary of results in the area...
2004 / Milan Urbášek -
An Overview of Synchronous Message-Passing and Topology
Abstract A slowly-growing number of computer scientists have found that ideas from topology can be used to analyze and understand problems in distributed computing. In this paper, we review one approach we have used in the past to write a succinct...
2005 / Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle -
Demonstrating Lambda Calculus Reduction
Abstract We describe lambda calculus reduction strategies using big-step operational semantics and show how to efficiently trace such reductions. This is used in a web-based lambda calculus reducer, at http://www.dina.kvl.dk/~sestoft/lamreduce/. ...
2004 / Peter Sestoft -
Formal Specification and Verification of Complex Systems1 1Work partially founded by Miur projectSP4.2004 / S. Gnesi
-
Absolute versus Relative Time in Process Algebras
Abstract Timed process algebras are useful tools for the specification and verification of real time systems. We study the relationships between two of these algebras, cIpa ('Closed Interval Process Algebra') and TCCS ('Temporal CCS') which deal...
2005 / Flavio Corradini -
Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)
Abstract Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of “compositional...
2005 / Mario Bravetti, Roberto Gorrieri -
Composing Programming Languages by Combining Action-Semantics Modules
Abstract This article demonstrates a method for composing a programming language by combining action-semantics modules. Each module is defined separately, and then a new module is defined by either extending or combining existing modules. This...
2004 / Kyung-Goo Doh, Peter D. Mosses -
A Verification Method for a Commitment Strategy of the BDI Architecture
Abstract We present a method to solve a verification problem that arises in implementing a commitment strategy for the BDI architecture. This problem introduces a new aspect of verification such that a state transition depends on a verification done ...
2004 / Tadashi Araragi, Shiro Takata, Nide Naoyuki -
Set Types and Applications
Abstract We present pml B , a programming language that includes primitive sets and associated operations. The language is equipped with a precise type discipline that statically captures dynamic...
2004 / Christian Skalka, Scott Smith -
Forum as a Logic Programming Language: Preliminary Report
Abstract When Miller introduced Forum he called it a specification logic, rather than a logic programming language. In this paper we outline those features that create problems in attempting to implement an interpreter for the language, and describe ...
2005 / Joshua S. Hodas, Jeffrey Polakow -
Preface
Abstract Introduction Graph Transformation and Visual Modeling Techniques - GT-VMT 2001 After the success of last year in Geneva (Switzerland), also this year ICALP hosts the International Workshop on Graph...
2005 / Luciano Baresi, Mauro Pezze, Gabriele Taentzer -
Parking Can Get You There Faster
Abstract We present an approximation technique, that can render real-time model checking of safety and universal path properties more efficient. It is beneficial, when loops lead to repetition of control situations. Basically we augment a timed...
2004 / M.Oliver Möller -
Real Numbers and BDDs
Abstract We present a proposal for representing large vectors of real numbers using binary decision diagrams (BDDs). If the vectors contain structured data, the necessary size may be reduced significantly compared to an explicit representation of...
2004 / Norbert Th. Müller -
A Privilege Management Scheme for Mobile Agent Systems2004 / W.A. Jansen