A formal verification approach for composite smart contracts security using FSM

Almakhour, Mouhamad; Sliman, Layth; Samhat, Abed Ellatif; Mellouk, Abdelhamid

doi:10.1016/j.jksuci.2022.08.029

Cited by 12 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various formal verification methods are used in efforts to improve smart contracts. Concerning recent work in this area, Nam et al [30] propose to analyze Solidity smart contracts using Alternating-time Temporal Logic model checking, whereas Almakhour et al [31] deal with formal verification of composite smart contracts that require other smart contracts to be executed. They employ the finite state machine models to verify Solidity smart contracts.…”

Section: Related Workmentioning

confidence: 99%

Smart Contract Design Pattern for Processing Logically Coherent Transaction Types

Górski

2024

Applied Sciences

View full text Add to dashboard Cite

Recent research shows that the source code of smart contracts is often cloned. The processing of related types of transactions in blockchain networks results in the implementation of many similar smart contracts. The rules verifying transactions are therefore duplicated many times. The article introduces the AdapT v2.0 smart contract design pattern. The design pattern employs a distinct configuration for each transaction type, and verification rule objects are shared among configurations. The redundancy of logical conditions was eliminated at two levels. Firstly, it is possible to combine similar smart contracts into one. Secondly, a configuration in a smart contract reuses verification rule objects at runtime. As a result, only one object is instantiated for each verification rule. It allows for the effective use of operating memory by the smart contract. The article presents the implementation of the pattern using object-oriented and functional programming mechanisms. Applying the pattern ensures the self-adaptability of a smart contract to any number of transaction types. The performance tests were carried out for various numbers of verification rules in a smart contract and a different number of checked transactions. The obtained evaluation time of 10,000,000 transactions is less than 0.25 s.

show abstract

Section: Related Workmentioning

confidence: 99%

Smart Contract Design Pattern for Processing Logically Coherent Transaction Types

Górski

2024

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Assuming that expert 𝑢𝑢 estimates the interval of the trigger delay for transition 𝑣𝑣 as [𝑥𝑥, 𝑦𝑦], calculating the average trigger delay for this transition can be accomplished easily, as shown in (10), 𝑇𝑇𝑇𝑇 𝑢𝑢,𝑣𝑣 is the average trigger delay estimate of expert 𝑢𝑢 for transition 𝑣𝑣. Subsequently, the average trigger delays of 𝑢𝑢 experts for 𝑣𝑣 transitions can be represented by a matrix, as indicated in (11),…”

Section: Determination Of the Transition Trigger Delaymentioning

confidence: 99%

“…Among many methods, formal methods are gradually emerging in the development and verification of intelligent networked vehicle systems. Formal method is a verification method based on mathematics and logic, which is used to formally describe the behavior and properties of the system, and reason and analyze it [10][11][12]. Formal methods are often widely used in biology [13,14], hardware [15], software [16], industry [17][18][19] and other fields.…”

Section: Introductionmentioning

confidence: 99%

A refinement and abstraction method of the SPZN formal model for intelligent networked vehicles systems

2024

KSII TIIS

View full text Add to dashboard Cite

Security and reliability are the utmost importance facts in intelligent networked vehicles. Stochastic Petri Net and Z (SPZN) as an excellent formal verification tool for modeling concurrent systems, can effectively handles concurrent operations within a system, establishes relationships among components, and conducts verification and reasoning to ensure the system's safety and reliability in practical applications. However, the application of a system with numerous nodes to Petri Net often leads to the issue of state explosion. To tackle these challenges, a refinement and abstraction method based on SPZN is proposed in this paper. This approach can not only refine and abstract the Stochastic Petri Net but also establish a corresponding relationship with the Z language. In determining the implementation rate of transitions in Stochastic Petri Net, we employ the interval average and weighted average method, which significantly reduces the time and space complexity compared to alternative techniques and is suitable for expert systems at various levels. This reduction facilitates subsequent comprehensive system analysis and module analysis. Furthermore, by analyzing the properties of Markov Chain isomorphism in the case study, recommendations for minimizing system risks in the application of intelligent parking within the intelligent networked vehicle system can be put forward.

show abstract

“…The approach utilizes finite state machine models and model checking, considering both standard and contextdependent properties. Computation tree logic is used to express the properties, and the nuXmv symbolic model checker verifies the model [31].…”

Section: A Model Checking Usage In Blockchainmentioning

confidence: 99%

BlockASP: A Framework for AOP-Based Model Checking Blockchain System

AlSobeh,

Magableh

2023

IEEE Access

View full text Add to dashboard Cite

Blockchain systems are lauded for their security and reliability. Security is a cornerstone, as they employ cryptographic techniques to ensure the immutability of data, making it extremely resistant to tampering. With decentralized networks, they also reduce the risk of a single point of failure, enhancing reliability. Model checking plays a vital role in ensuring the security and reliability of blockchain systems. However, traditional model-checking approaches face challenges in handling the inherent dynamism exhibited in blockchain systems. To overcome this challenge, Aspect-Oriented programming (AOP) offers capabilities to enhance blockchain model checking through the modularization of cross-cutting concerns, enabling traceability and monitoring, facilitating dynamic instrumentation, and supporting fine-grained property specifications. The aim of this research is to enable more effective and efficient verification of dynamic behaviors in blockchain systems compared to conventional model-checking techniques using AOP. As a result, this research introduces BlockASP, a novel blockchain model verification method that leverages AOP to analyze and monitor dynamic behavior of the blockchain system. BlockASP integrates the benefits of aspect-orientation and model checking into the blockchain architecture to strengthen security and reliability. This research has examined prior arts that are related to blockchain modeling using Objectoriented (OO) and those that are using AOP. Our research has proposed and discussed the BlockASP technique, the research provided a case study to demonstrate the validity and superiority in facilitating the monitoring of dynamic blockchain behavior using AOP compared to traditional approaches such as Model-Driven Architecture (MDA).

show abstract

A formal verification approach for composite smart contracts security using FSM

Cited by 12 publications

References 16 publications

Smart Contract Design Pattern for Processing Logically Coherent Transaction Types

Smart Contract Design Pattern for Processing Logically Coherent Transaction Types

A refinement and abstraction method of the SPZN formal model for intelligent networked vehicles systems

BlockASP: A Framework for AOP-Based Model Checking Blockchain System

Contact Info

Product

Resources

About