Formula rewriting systems and their application to automated program verification
We describe a notion of formula rewriting systems (FRSs) and investigate a relation between FRSs and techniques of term rewriting systems (TRSs) and narrowing. We demonstrate the use of FRSs for finding errors in array and file operations.
Towards animation of executional specifications of the REAL language
The work is devoted to a tool for simulation of executional specifications of distributed systems, simulation and testing of the behaviour of these systems. The systems are described in terms of the REAL language developed in A.P. Ershov Institute of Informatics Systems, SD RAS .
The use of finite automata to speed up searching in the text data bases
Pattern matching is a component of many information retrieval problems. We deal with searching for a set of patterns. The following generalizations of the problem are considered on the same basis: 1) searching for the set of patterns by a partially-specified query of large cardinality; 2) revealing the coincidences...
Support tools for supercomputing
The paper considers the problem of supercomputing support and Internet technologies. The PROGRESS project being developed at the A.P. Ershov Institute of Informatics Systems is discussed. The system is intended to support rapid prototyping of compilers for high-level languages (e.g., Fortran-77, Modula-2, Sisal-90) and for a family of architectures exploiting fine-grained...
On support tools for visual processing of hierarchical graph models
The HIGRES system is considered as a support tool for visual processing of hierarchical graph models. HIGRES is implemented in C++, works under MS Windows 95/NT and is available on WWW at http://pco.iis.nsk.su/higres.
Expert system for simulation of program optimization
This paper presents a brief description of an expert system LMESOP, a tool for investigation of already known systems of optimizing transformations and for development of the new ones.
Database processing in constraint programming paradigm based on subdefinite models
A technology for solving problems with large data sets in an object-oriented constraint programming environment NeMo+ is presented. We describe facilities for database access and interaction of data with NeMo+ objects.
The use of PS-nets in the design technology for distributed applications
Formal models of parallel computations are widely used in the design of parallel and distributed software (PDS) for multiprocessor computer systems (MCS). The choice of a model is decisive for efficiency of the solution of design problems. The necessity of such a choice is due to a splash of interest...
Hypertext environment for software and documents development
A hypertext system here presented supports some features essential for software and documents development environment; in particular, versioning (both logical and chronological), macro facilities, authoring facilities and interface with text representation systems HTML and TEX.
Hypertext is a natural environment for software project development. The hypertext of a...
The development of distributed dynamic systems in the technology of active objects
In the paper we present a technology for development of dynamic multi-agent systems which is based on a combination of the object-oriented approach with constraint programming. We introduce the notion of an active object as a way of describing and implementing the intellectual, reactive and communicative properties of agents. We...
τ-Equivalences for analysis of concurrent systems modelled by Petri nets with silent transitions
The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (τ-equivalences). Basic τ-equivalences and back-forth τ-bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations...
New facilities of constraint logic programming
In this paper we focus on new facilities of a logic programming system ECLiPSe and propose a way of using these facilities for implementation of a constraint programming method called Subdefinite Computations. We briefly describe the Interval Domain library which employs the proposed implementaion technique for solving...
Integration of constraint programming methods with knowledge base technology
An approach to integration of methods of constraint programming with various knowledge representation means, such as frames, semantic networks, and production rules, is considered. A knowledge representation language developed on the basis of this approach is presented. In contrast to other languages that also use the constraint programming technique, this...