Search

Experimental analysis of the texts of requirements for software systems by means of frequency analysis is carried out. The “timer language,” i.e., a set of natural-language sentences of definite structure that describe actions with timers, is distinguished according to the results of the experiments. Means for transforming sentences of timer language into marked structured expressions of intermediate language are developed. The intermediate language proposed can be used as an auxiliary mean in the chain of steps from the natural-language text of requirements for a system to the formal model of this system. [ABSTRACT FROM AUTHOR]

Experimental analysis of the texts of requirements for software systems by means of frequency analysis is carried out. The "timer language," i.e., a set of natural-language sentences of definite structure that describe actions with timers, is distinguished according to the results of the experiments. Means for transforming sentences of the timer language into marked structured expressions of intermediate language are developed. The intermediate language proposed can be used as an auxiliary mean in the chain of steps from the natural-language text of requirements for a system to the formal model of this system. [ABSTRACT FROM AUTHOR]

Copyright of Cybernetics & Systems Analysis / Kibernetiki i Sistemnyj Analiz is the property of V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper describes the operating environment of the language processor intended for processing behavioral models of systems represented in natural language. This environment provides the tuning of the language processor; the main stage of this tuning is the construction of a syntactic table. An approach is proposed for automating the construction of grammar rules intended for replenishment of the syntactic table used by the language processor. [ABSTRACT FROM AUTHOR]

The paper tries to put together one computer languages view on Battle Management Languages (BMLs) with the current C-BML Phase 1 Standard: We present a case study on creating language representations by means of formal parsable context-free grammars and corresponding language processors in the area of military C2 systems utilizing the standardized C-BML data structures. We point out how techniques and tools previously used in the area of compilers (namely Flex, Bison) are exploitable in the military domain and thus might be helpful in integration of national command and control systems and deployment in multinational environment. We start with an introduction to C-BML principles and data model; next we describe the basis for our (Slovak) language representation followed by its specification in the form of a parsable context-free grammar; next follows the section devoted to the lexical, syntactic, and semantic processing of the language representation with the utilisation of Flex and Bison tools. [ABSTRACT FROM AUTHOR]

An approach is proposed to the construction of functional specifications and automation of the transition from natural language specifications to formal models in a format convenient for the subsequent verification and validation of these models. Texts are transformed into models with the help of the interactive system PNS. The described approach is illustrated by a detailed example. [ABSTRACT FROM AUTHOR]

In this paper, we describe automated memory analysis, a technique to improve the memory efficiency of a sparse linear iterative solver. Our automated memory analysis uses a language processor to predict the data movement required for an iterative algorithm based upon a MATLAB implementation. We demonstrate how automated memory analysis is used to reduce the execution time of a component of a global parallel ocean model. In particular, code modifications identified or evaluated through automated memory analysis enable a significant reduction in execution time for the conjugate gradient solver on a small serial problem. Further, we achieve a 9% reduction in total execution time for the full model on 64 processors. The predictive capabilities of our automated memory analysis can be used to simplify the development of memory-efficient numerical algorithms or software. [ABSTRACT FROM AUTHOR]