METHODS AND MODELS OF SOFTWARE DEVELOPMENT USING AUTOMATED APPROACH

Article Sidebar

PDF
Number of views 290

Published: Apr 20, 2022
DOI: https://doi.org/10.51582/interconf.19-20.04.2022.045
Keywords:
automata-based programming, state machine, state transition, event manager, output signal, design pattern
Issue
No. 20(105) (2022): 5th ISPC «Current Issues and Prospects for The Development of Scientific Research» (April 19-20, 2022; Orléans, France).
Section
Information and Web technologies
Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Main Article Content

Dmytro Nikitin
Kharkiv National University of Radio Electronics
Vira Golian
Kharkiv National University of Radio Electronics

Abstract

The present article deals with the main methods and models of automatic software systems development. The main types of implementations of automata abstract models are determined and analyzed. A new option of creating a software system module that is responsible for the behavior of an object, which can change depending on its current state, is proposed. The diagram and main components of this module are presented.


Google Scholar

CrossRef

OUCI

Scilit

WorldCat

Index Copernicus

Semantic Scholar


Article Details

How to Cite
Nikitin, D., & Golian, V. (2022). METHODS AND MODELS OF SOFTWARE DEVELOPMENT USING AUTOMATED APPROACH. Scientific Collection «InterConf+», (20(105), 473–477. https://doi.org/10.51582/interconf.19-20.04.2022.045
Author Biographies

Dmytro Nikitin, Kharkiv National University of Radio Electronics

Postgraduate Student of the Department of Software Engineering

Vira Golian, Kharkiv National University of Radio Electronics

Phd of Technical Sciences, Associate Professor, Associate professor of the Department of Software Engineering

References

Fowler, Martin, and Kent Beck. 1999. Refactoring: improving the design of existing code. Reading, MA: Addison-Wesley.

Pouly, Marc; Kohlas, Jurg. 2011. Generic Inference: A Unifying Theory for Automated Reasoning. John Wiley & Sons. Chapter 6. Valuation Algebras for Path Problems, p. 223.

Wang, Jiacun. 2019. Formal Methods in Computer Science. CRC Press. p. 34.

Finite-State Machines: Theory and Implementation – https://gamedevelopment.tutsplus.com/ tutorials/finite-state-machines-theory-and-implementation--gamedev-11867

Ulyantsev V., Zakirzyanov I., Shalyto A. 2015. BFS-Based Symmetry Breaking Predicates for DFA Identification. Language and Automata Theory and Applications. Lecture Notes in Computer Science. Vol. 8977. pp. 611–622.

Johnson, W. L.; Porter, J. H.; Ackley, S. I.; Ross, D. T. (1968). "Automatic generation of efficient lexical processors using finite state techniques". Comm ACM.

Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides. 1994. Design Patterns: Elements of Reusable Object-Oriented Software. Addison Wesley. pp. 305.

Polikarpova N., Shalyto A. 2009. Automata-based programming, SPb.: Piter.

Ollongren, Alexander. 1974. Definition of programming languages by interpreting automata. London: Academic Press. ISBN 0-12-525750-3.

Craig Larman. 2004. Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development (3rd Edition). Prentice Hall PTR, USA.