Requirement patterns in deductive verification of poST Programs-Reference-Cited by-同舟云学术

Requirement patterns in deductive verification of poST Programs

Published:2024-03-28 Issue:1 Volume:31 Page:6-31
ISSN:2313-5417
Container-title:Modeling and Analysis of Information Systems
language:
Short-container-title:Model. anal. inf. sist.

Author:

Chernenko Ivan M.¹^ORCID,Anureev Igor S.¹^ORCID,Garanina Natalia O.¹^ORCID

Affiliation:

1. Institute of Automation and Electrometry SB RAS

Abstract

Process-oriented programming is one of the approaches to developing control software. A process-oriented program is defined as a sequence of processes. Each process is represented by a set of named states containing program code that define the logic of the process's behavior. Program execution is sequential execution of each of these processes in their current states at every iteration of the control cycle. Processes can interact through changing each other's states and shared variables. The paper expands a method for classifying temporal requirements for process-oriented programs in order to simplify and automate the deductive verification of such programs. The method consists of the following steps. At the first step, the requirements are formalized in a specialized language DV-TRL, a variant of typed first-order predicate logic with a set of interpreted types and predicate and functional symbols, that reflect specific concepts of control systems in a process-oriented paradigm. At the second step, the formalized requirements are divided into classes, each of which is defined by a pattern — a parametric formula of the DV-TRL language. The correctness conditions generated for process-oriented programs regarding requirements satisfying the same pattern have the same proof scheme. At the third step, appropriate proof schemes are developed. In our paper, we first give a brief introduction to the poST language, a process-oriented extension to the ST language of the IEC 61131-3 standard. Next, the DV-TRL language is defined. We also provide a collection of natural language requirements for several control systems. Then we define patterns that fully cover all the requirements of this collection. For each of these patterns we give an example of a formalized requirement from the collection and describe a scheme for proving the correctness conditions for this pattern. Statistics on the distribution of requirements from the collection across patterns reveals the most popular patterns. We also analyzed related works.

Publisher

P.G. Demidov Yaroslavl State University

Reference31 articles.

1. V. E. Zyubin, “Hyper-automaton: a Model of Control Algorithms,” in 2007 Siberian Conference on Control and Communications, 2007, pp. 51–57, doi: 10.1109/SIBCON.2007.371297.

2. I. Anureev, N. Garanina, T. Liakh, A. Rozov, V. Zyubin, and S. Gorlatch, “Two-step deductive verification of control software using Reflex,” in International Andrei Ershov Memorial Conference on Perspectives of System Informatics, 2019, pp. 50–63, doi: 10.1007/978-3-030-37487-7_5.

3. V. E. Zyubin, T. V. Liakh, and A. S. Rozov, “Reflex language: a practical notation for cyber-physical systems,” System Informatics, no. 12, pp. 85–104, 2018.

4. C. Paulin-Mohring, “Introduction to the Coq proof-assistant for practical software verification,” in LASER Summer School on Software Engineering, Springer, 2011, pp. 45–95.

5. I. Chernenko, I. S. Anureev, N. O. Garanina, and S. M. Staroletov, “A Temporal Requirements Language for Deductive Verification of Process-Oriented Programs,” in IEEE 23rd International Conference of Young Professionals in Electron Devices and Materials (EDM), 2022, pp. 657–662, doi: 10.1109/EDM55285.2022.9855145.