Preprints of IIS SB RAS, 2004

Preprint 122
Alexander G. Marchuk
Distributed electronic archives, libraries and data bases

This preprint describes the concepts, architecture and implementation of our approach to creation of information systems of the semantic-web class [1]. In addition to the ideas and technology of semantic web, this approach is based on the refined notion of the information space and on the data scheme elaborated by the author for representation of real-world entities and relationships. The model is open and extendable, which allows a wide class of universal and special purpose systems to be created.

Preprint 121
Sergey A. Brazhnik
Review of formal approaches for the uml and ocl languages

UML is a de-facto standard language for the Object-Oriented analysis and design of information systems. This paper contains a review of basic formal approaches for the UML 1.x and OCL languages.

Preprint 120
И.В. Дубрановский
C#-program verification: translation from C#-LIGHT into C#-KERNEL

This paper presents C#-light, an input language of the C#-program verification system, and C#-kernel, an internal language that is used in the three-level scheme of verification. The algorithms of translation from C#-light into C#-kernel are considered.

Preprint 119
N. S. Gribovskaja
The category theoretical characterization of different equivalences for timed automata models

The timed extensions of a test equivalence and a weak barbed bisimularity are defined and developed for model of timed transition systems. This work is supported by Federal Agency of education, grant б04-3.16-217.

Preprint 118
I. V. Krechetov
The automated building of sql queries for an object data

The problem of query generation arises in the context of a persistent layer implementation for an object-oriented application which utilizes a relational DBMS. Here we propose a set of software design solutions successfully approved in practice. These solutions cover the following aspects: flexibility of the object-relational mapping, minimization of the quantity of database calls, independence from a SQL dialect, query parameterization and caching.

Preprint 117
Leonid Novak, Alexandre Zamulin
Algebraic semantics of xml schema

The semantics of the core features of XML Schema in terms of XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many sorted algebra whose sorts are sets of data type values and different kinds of nodes and whose operations are data type operations and node accessors. The values of some node accessors, such as "parent", "children" and "attributes", define a document tree with a definite order of nodes. The values of other node accessors help to make difference between kinds of nodes, learn the names, types and values associated with the corresponding document entities, etc., i.e., provide primitive facilities for a query language. As a result, a document can be easily mapped to its implementation in terms of nodes and accessors defined on them.

Preprint 115
Vladimir I. Shelekhov
Development of a suffix tree construction program in the predicate programming technology

A suffix tree provides the compact representation of the set of all substrings for some string of characters. The suffix trees are widely used for quick searching, data compression, etc. In the predicate programming framework, development of an efficient program of suffix tree construction based on the McCreight's algorithm [11] is described. The predicate program for this algorithm is a set of recursive computable definitions of predicates. For each predicate, the specification in the second-order predicate calculus language is included. Mathematical proof of conclusion the right part of predicate definition from the predicate specification is provided for each predicate. The proof is based on the fragment of mathematical suffix tree theory included the notion system and eight lemmas. Equivalent optimizing source-to-source transformations are applied to the predicate program. Result predicate program is transformed to efficient imperative one. The following transformations are applied: variable merging, replacement of tail-recursion by loop, substitution predicate definition instead of a predicate call, etc.

Preprint 114
I.S. Anureev
Usl - the language of natural state machines

An approach to description of formal operational semantics of modern programming languages is proposed. The approach yields specifications of programming languages syntactically close to specifications in natural languages, but with a formal semantics. The approach is based on natural state machines, a new class of abstract machines. The language of natural state machines called USL is presented and its formal semantics is defined. A library of USL instructions destined for development of programming language semantics is outlined. The examples of application of the approach to the modern programming languages are given.

Preprint 113
R. S. Dubtsov
Epi- and monomorphism criteria in categories of real-time and concurrent models

The intention of the paper is to study properties of categories of Petri net based models with dense time. To this purpose we define categories of timed net processes, equipped with different semantics. In the categories, we formalize criteria of epi- and monomorphisms. We also extract subcategories of timed net processes whose mophisms satisfy formalized conditions.

Preprint 112
Stepan V. Kalichkin
A review of tools for static debugging of programs

Static debugger is a tool which analyzes and visualizes information collected as a result of the static analysis of program in order to localize errors in it. The purpose of this work is to review static debuggers on the following aspects: kinds of program analyses, specific features of displaying the program information, visualization and navigation. As it was possible to find out only two static debuggers other tools are also considered in this review: dynamic debuggers, static analyzers and data visualization tools.

Preprint 111
I. V. Zapreev
Analysis of information flow quality in modula-2/oberon-2 programs

This paper describes the static analysis of quality of Modula-2/Oberon-2 programs. It presents implementation of two criteria of information flow quality,namely, the criteria for being regular and confirmed. The criteria of information flow quality are implemented on the basis of data flow analysis. The information derived by analyzer is stored in the XML-format. We have implemented a graphical interface that allows us to visualize information flows and the locations of their low-quality, as well as to provide additional flow information.

Preprint 110
A. P. Stasenko
Internal representation of functional programming system sisal 3.0

This work describes COM (Component Object Model) interface system, called Internal Representation IR1, representing Intermediate Form graph language IF1, created for System of Function Programming (SFP) SISAL 3.0 (successor of SISAL-90 functional language). The way to use IR1 for describing SISAL 3.0 program module is shown. Nodes and compound nodes used by IF1 graph are presented along with description and basing of introduced differences in IF1 specification for some compound nodes. For non-trivial syntactic constructions of SISAL 3.0 language the way of their representation in IR1 is explained.

Preprint 109
Vladimir S. Ryzhov
Object approach to creation of standard for document workflow in internet environment

Данная работа посвящена обсуждению организации документооборота в среде Интернет. В работе вводится расширенное понятие документа, выбираются наиболее перспективные и надежные форматы документов и технологии доступа к ним, а также рассматриваются варианты взаимодействия документов в сети. Таким образом, в работе предлагается некоторый стандарт на организацию документооборота в среде Интернет.




You are reporting a typo in the following text:
Simply click the "Send typo report" button to complete the report. You can also include a comment.