1,720,964 research outputs found
Символьное моделирование систем базовых протоколов с произвольным количеством агентов
Full text linkA method of symbolic modeling of formal models is considered in the paper. Object of analysis is a domain
of multi-component concurrent systems specified in basic protocols language. A problem of dynamic
creation and stopping of agents during state-space exploration is considered. Corresponding algorithm has
been suggested as an extension of existing forward and backward predicate transformers. It provides ability
to introduce arbitrary number of concurrent processes in verification and test generation.В статті розглянуто метод символьного моделювання формальних моделей. Об’єктом аналізу є домен
багатокомпонентних паралельних систем, записаних у мові базових протоколів. Розглянуто проблему
динамічного створення та зупинки агентів під час обходу простору станів. Запропоновано
відповідний алгоритм як розширення існуючих прямого та зворотного предикатних трансформерів.
Він дає можливість вводити довільну кількість паралельних процесів при верифікації та генерації тестів.В статье рассматривается метод символьного моделирования формальных моделей. Объектом анализа
является домен многокомпонентных параллельных систем, описанных в языке базовых протоколов.
Рассмотрена проблема динамического создания и останова агентов во время обхода пространства
состояний. Предложен соответствующий алгоритм как расширение существующих прямого и
обратного предикатных трансформеров. Он дает возможность вводить произвольное количество
параллельных процессов при верификации и генерации тестов
Символьное моделирование систем базовых протоколов с произвольным количеством агентов
No full textA method of symbolic modeling of formal models is considered in the paper. Object of analysis is a domain
of multi-component concurrent systems specified in basic protocols language. A problem of dynamic
creation and stopping of agents during state-space exploration is considered. Corresponding algorithm has
been suggested as an extension of existing forward and backward predicate transformers. It provides ability
to introduce arbitrary number of concurrent processes in verification and test generation.В статті розглянуто метод символьного моделювання формальних моделей. Об’єктом аналізу є домен
багатокомпонентних паралельних систем, записаних у мові базових протоколів. Розглянуто проблему
динамічного створення та зупинки агентів під час обходу простору станів. Запропоновано
відповідний алгоритм як розширення існуючих прямого та зворотного предикатних трансформерів.
Він дає можливість вводити довільну кількість паралельних процесів при верифікації та генерації тестів.В статье рассматривается метод символьного моделирования формальных моделей. Объектом анализа
является домен многокомпонентных параллельных систем, описанных в языке базовых протоколов.
Рассмотрена проблема динамического создания и останова агентов во время обхода пространства
состояний. Предложен соответствующий алгоритм как расширение существующих прямого и
обратного предикатных трансформеров. Он дает возможность вводить произвольное количество
параллельных процессов при верификации и генерации тестов
Символьное моделирование систем базовых протоколов с произвольным количеством агентов
No full textA method of symbolic modeling of formal models is considered in the paper. Object of analysis is a domain
of multi-component concurrent systems specified in basic protocols language. A problem of dynamic
creation and stopping of agents during state-space exploration is considered. Corresponding algorithm has
been suggested as an extension of existing forward and backward predicate transformers. It provides ability
to introduce arbitrary number of concurrent processes in verification and test generation.В статті розглянуто метод символьного моделювання формальних моделей. Об’єктом аналізу є домен
багатокомпонентних паралельних систем, записаних у мові базових протоколів. Розглянуто проблему
динамічного створення та зупинки агентів під час обходу простору станів. Запропоновано
відповідний алгоритм як розширення існуючих прямого та зворотного предикатних трансформерів.
Він дає можливість вводити довільну кількість паралельних процесів при верифікації та генерації тестів.В статье рассматривается метод символьного моделирования формальных моделей. Объектом анализа
является домен многокомпонентных параллельных систем, описанных в языке базовых протоколов.
Рассмотрена проблема динамического создания и останова агентов во время обхода пространства
состояний. Предложен соответствующий алгоритм как расширение существующих прямого и
обратного предикатных трансформеров. Он дает возможность вводить произвольное количество
параллельных процессов при верификации и генерации тестов
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Generation of multipurpose formal models from legacy code
No full textIn this paper a method for generation of formal models from legacy systems code is proposed. The purpose of these models is to have a possibility of their application in different tasks such as automatic generation of executable tests, translation to modern programming languages, reverse engineering. The method pursues goals to decrease complexity of state space search and checking formulas satisfiability in relation to the direct code modeling, and to help legacy systems understanding and implementing in modern technologies. We focused on formalization of Cobol memory model as it is the most common language in legacy systems. Formal model is an attribute transition system with control flow. We proposed an algorithm for building enumerated types for any variables whose usage fulfills certain conditions, including translation procedure of numeric variables to enumerated ones. We considered a problem of translating non-comparable structures which overlap in memory (operator redefines in Cobol), are copied or compared with each other. In opposite to common approach of using union semantics (like union construction in C++), we described a method of structure fields decomposition which has no drawbacks of unions and makes for minimization of bytewise approach. We considered the developed method on the examples of structures as with simple fields as with arrays. We also gave examples of realization of bytewise approach in Java and C++ languages for those variables that cannot be represented as enumerated or numeric attributes. We tried this work for tests generation for middle-sized projects (up to 100 000 lines of code) where it showed efficiency of developed method, also generated formal models were used for debugging of Cobol to Java translator and business rules extraction. Problems in programming 2022; 3-4: 42-5
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
