Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access policies to compute secure user view on XML data sets. User queries are then evaluated on those views. In the second category of approaches, authorization rules are used to transform user queries to be evaluated against ...

While Markov chain generators have been employed throughout the history of computer music as a tool for the creation of musical parameter values, input notations for Markov transition values are often cumbersome and opaque. Rejecting the transition matrix as an input notation, this paper offers a new language-independent, string-based input notation for incomplete, multiple-order, static Markov...

In the LOGON machine translation system where semantic transfer using Minimal Recursion Semantics is being developed in conjunction with two existing broad-coverage grammars of Norwegian and English, we motivate the use of a grammar-specific semantic interface (SEM-I) to facilitate the construction and maintenance of a scalable translation engine. The SEM-I is a theoretically grounded component...

THALES is a software package for plane geometry constructions, supplied with a natural language interlace. Using THALES requires no knowledge of a programming language. The interface is capable of processing practically all kinds of instructions within the subset of plane geometry English. The "static semantic" module has been generated on the basis of a high-level attribute specification. Tran...

The main significance of this document is two source systems namely GIPSY and DMARF. Intensional languages are required like GIPSY for absoluteness and forward practical investigations on the subject.DMARF mainly focuses on software arechetictual design and implementation on Distributed Audio recognition and its applications such as speaker identification which can run distributively on web ser...

This article presents the language LinF for L-System specification. L-Systems are formal string rewriting systems introduced in 1968 by the botanist Aristid Lindenmayer that are used to model fractal images. LinF allows the definition of three-dimensional fractals and stochastic fractals. Together with the LinF definition this paper presents the implementation of cFLC, an OpenGL-based system th...

One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to a correctness query with a counterexample to the satisfaction of the specification in the system. On the other hand, when the answer to the correctness query is positive, most model-checking tools provide no witness for the satisfaction of the specification. In the last few years ther...

The term Requirements Engineering refers to this part of a database development cycle that involves investigating the problems and requirements of the users community and developing a conceptual specification of the future system. Natural language plays an important role during this stage that has proved to be crucial in the development of computerized systems. The required acquisition of appli...

Abs t rac t This paper is part of a long-term effort to increase expressiveness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been efficient...

This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH algorithm is a sophisticated state-of-the-art scheduling algorithm with advanced capacity sharing features for reusing unused execution budgets. Because the number of elements in the queue of unused resources can gro...