Methods of Formal Software Verification in the Context of Distributed Systems

Fatkina, Anna; Iakushkin, Oleg; Selivanov, Dmitry; Korkhov, Vladimir

doi:10.1007/978-3-030-24296-1_43

Cited by 4 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike the abovementioned studies, we focus specifically on rotary kinematics problems and use the Coq Proof Assistant [23] to formally verify robot rotary kinematics.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Formal Verification of Robot Rotary Kinematics

et al. 2023

View full text Add to dashboard Cite

With the widespread application of robots in aerospace, medicine, automation, and other fields, their motion safety is essential for the well-being of humans and the accomplishment of vital socially beneficial programs. Conventional robot hardware and software designs mainly rely on experiential knowledge and manual testing to ensure safety, but this fails to cover all possible testing paths and adds risks. Alternatively, formal, mathematically rigorous verifications can provide predictable and reliable guarantees of robot motion safety. To demonstrate the feasibility of this approach, we formalize the mathematical coordinate transformation of a robot’s rigid-body kinematics using the Coq Proof Assistant to verify the correctness of its theoretical design. First, based on record-type matrix formalization, we define and verify a robot’s spatial geometry by constructing formal expressions of the matrix’ Frobenius norm, trace, and inner product. Second, we divide rotary motion into revolution and rotation construct and provide their formal definitions. Next, we formally verify the rotational matrices of angle conventions (e.g., roll–pitch–yaw and Euler), and we complete the formal verification of the Rodriguez formula to formally verify the correctness of the motion theory in specific rotating kinematics problems. The formal work of this paper has a variety of essential applications and provides a generalizable kinematics analysis framework for robot control system verification. Moreover, it paves the way for automatic programming capabilities.

show abstract

“…Unlike the abovementioned studies, we focus specifically on rotary kinematics problems and use the Coq Proof Assistant [23] to formally verify robot rotary kinematics.…”

Section: Related Workmentioning

confidence: 99%

“…We use the formal methods to infer and verify Formula (23). First, we formally define revolution axis u, revolution angle φ, and revolution matrix _0RG of G → B (in the initial state) and set the length of u to one.…”

Section: Generalized Rodriguez Formulamentioning

confidence: 99%

Formal Verification of Robot Rotary Kinematics

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Prior work has made significant contributions to the formalization and verification of distributed systems such as [31,1,15,33]. Model checking and theorem proving are two main methods in these works with the support of typical tools such as HOL4 [16], TLC model checker [39], NuSMV [9].…”

Section: Related Workmentioning

confidence: 99%

“…Significant contributions have been made to verify distributed systems with two mainstream techniques of formal methods including model checking and automated theorem proving. Model-checking techniques [22,15,33] prove to be effective to check safety and liveness properties of distributed system design and algorithms. However, it is noteworthy that these model checking techniques suffer from the state-space explosion problem, which leads to the ineffectiveness of complicated realistic systems, though many model-checking tools such as SPIN [19], NuSMV [9], Cubicle [10] provide space-efficient and on-the-fly algorithm to optimize the methods.…”

Section: Introductionmentioning

confidence: 99%

Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic

Ding

Satō

2020

Preprint

View full text Add to dashboard Cite

Decentralized techniques are becoming crucial and ubiquitous with the rapid advancement of distributed ledger technologies such as the blockchain. Numerous decentralized systems have been developed to address security and privacy issues with great dependability and reliability via these techniques. Meanwhile, formalization and verification of the decentralized systems is the key to ensuring correctness of the design and security properties of the implementation. In this paper, we propose a novel method of formalizing and verifying decentralized systems with a kind of extended concurrent separation logic. Our logic extends the standard concurrent separation logic with new features including communication encapsulation, environment perception, and node-level reasoning, which enhances modularity and expressiveness. Besides, we develop our logic with unitarity and compatibility to facilitate implementation. Furthermore, we demonstrate the effectiveness and versatility of our method by applying our logic to formalize and verify critical techniques in decentralized systems including the consensus mechanism and the smart contract.

show abstract

“…Smart contracts rely on more complex validation rules that are not supported by the base UTXO model. Due to the complexities of implementing a smart contract, the more straightforward account model is usually used instead [7].…”

Section: Introductionmentioning

confidence: 99%

Formalizing IOTA Extended UTXO in Isabelle

Dlugauskas,

Petrauskas

2024

open-series

View full text Add to dashboard Cite

The IOTA Extended UTXO (IOTA EUTXO) model extends the UTXO blockchain to include features like smart contracts and non-fungible tokens. In this work, we show that the IOTA EUTXO model maintains the base correctness properties of the UTXO model while extending it with extra functionality. We achieve this by specifying and verifying the essential concepts of the base UTXO model and the extensions proposed by IOTA using the Isabelle proof assistant. The specification is designed to be modular and extensible, meaning it can be used as a foundation for further research of the UTXO and IOTA EUTXO models.

show abstract

Methods of Formal Software Verification in the Context of Distributed Systems

Cited by 4 publications

References 6 publications

Formal Verification of Robot Rotary Kinematics

Formal Verification of Robot Rotary Kinematics

Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic

Formalizing IOTA Extended UTXO in Isabelle

Contact Info

Product

Resources

About