Search

In this paper, we focus on some aspects of structural operational semantics for a selected domain-specific language for robot control. After defining a syntax for two independent languages for control of a robot's movements, we define a structural operational semantics for them. The integrated part of structural operational semantics is abstract implementation, which consists of defining abstract machine and transformation of a programming language to abstract machine instructions. The achieved results as well as the mentioned research are a part of the research in the field of semantic methods, where we focus on the formalization of semantic methods for software engineering. This area is also very important for the training of students and young IT experts because the semantic methods can help to understand program behavior and detect errors in program design. To make the teaching of formal semantics in the field of domain-specific languages more attractive, we have also prepared an application that serves to visualize the individual steps of the program on an abstract machine - simulation of translated code with visualization of a robot's movement. [ABSTRACT FROM AUTHOR]

This paper focuses on the formal semantics of programming languages, with a specific focus on Domain-Specific Languages (DSLs). It introduces the Robot DSL, characterized by total semantic functions, an infinite network size, and an obstacle-free environment. The study explores denotational and natural semantics, aiming to define and prove their equivalence. This work contributes to the understanding of programming languages with unique features, laying the groundwork for future developments in language design and formal semantics. [ABSTRACT FROM AUTHOR]

In the last decades linear logic became a useful logical system for various usage in computer science. Its ability to handle resources and its competence to describe dynamics of processes predetermine it for describing behavior of programs and program systems. Linear logic can be apprehended as a multiplicative and additive extension of usual logic. We show the possibilities how these fragments can be enriched to describe behavior and to achieve knowledge on an example of simplified Intrusion Detection System (IDS). We construct Kripke model over a coalgebra of modal linear logic for pursuing observable behavior of IDS. Using the same Kripke frame we show how knowledge and belief in the terms of epistemic linear logic can be achieved. [ABSTRACT FROM AUTHOR]

An important task in network routing is to find the best path for message passing through the computer networks. In our paper we show how network routing can be described by linear logic formulae and modeled as a game tree in terms of game semantics. [ABSTRACT FROM AUTHOR]

In this paper we present a short introduction into foundations of action semantics and its application in functional paradigm. We discuss the use of action semantics for functional paradigm. The obtained results are demonstrated on the particular well-known example from informatics the Fibonacci numbers. The computation of Fibonacci numbers has been implemented in the object-oriented functional language OCaml and the description of the program is given in action semantics. [ABSTRACT FROM AUTHOR]

Algebraic structures and number systems are widely used in computer science. They allow to abstract from concrete objects which leads to the mathematical branches of abstract algebra and universal algebra. Category theory provides possibilities to model many important features of computer science. Toposes as specific categories enable us to formulate mathematical structures in categorical terms as objects and morphisms. It is sufficiently like the category of sets that a kind of set theory can be modelled in it. For mathematical structures we define algebras and coalgebras for studying their properties. In this contribution we present algebra and coalgebra for group, and formulate monadic approach for such algebras. [ABSTRACT FROM AUTHOR]

The practical goal of program behavior studies is to enhance program and system performance. A behavior of running program can be described by evaluating the coalgebraic structure over a collection of algebraic terms on state space. Coalgebras are defined by polynomial endofunctors. We formulate the coalgebras in categories. Toposes are special kind of categories defined by axioms saying roughly that certain constructions one can make with sets can be done in a category. We use approach via toposes and comonads as dual structures to monads. In our paper we introduce the main ideas of our approach for describing the behavior of systems by coalgebras and we illustrate it on the simple examples of data structure queue. [ABSTRACT FROM AUTHOR]

Behavior of running program can be described by evaluating a coalgebraic structure over a collection of algebraic terms on state space. Coalgebras are defined by polynomial endofunctors. We formulate substantiation of coalgebras in categories. We use approach via Kleisli categories together with monads beside the approach via topoi and comonads as dual structures to monads. [ABSTRACT FROM AUTHOR]