Semantic tree based asynchronous dynamic push-down network reachability analysis method

Abstract

The invention discloses a semantic tree based asynchronous dynamic push-down network reachability analysis method and belongs to the technical field of software safety and reliability. The semantic-tree based asynchronous dynamic push-down network reachability analysis method is characterized in that leading a semantic tree to a dynamic push-down network; establishing a semantic tree of a simulated middle model and enabling the reachability of the model to be decidable through a context limit method to calculate a reachable pattern set inside limited context execution for k times; calculating whether an intersection of the reachable pattern set and a target pattern set is empty or not to judge whether the reachable pattern set is reachable or not, accordingly judging whether design errors or bugs exist in an abstract model of a program and guaranteeing the model being correct and reliable.

Description

technical field [0001] The invention belongs to the field of software security and reliability research, relates to a verification method of concurrent programs, and specifically relates to a technique for solving the accessibility of an abstract model of concurrent programs. Aiming at an asynchronous dynamic push-down network model, an intermediate model is constructed to simulate a tree Semantic execution mode, an automatic method to solve the reverse reachability problem of the model using context bounding technology. Background technique [0002] With the development of multi-core processors, the research on concurrent programs has become a hot spot in program design. However, the uncertainty of concurrent program execution makes it difficult for traditional testing methods to find hidden errors in programs. As an automatic verification technology, model checking has become one of the important means to ensure the security and reliability of concurrent programs. Reacha...

AI Technical Summary

Problems solved by technology

Usually, the execution semantics of the dynamic pushdown network is interleaved semantics, but the efficiency of reverse reachability analysis under the interleaved semantics is not high. In order to efficiently perform reverse reachability analysis, Lammich et al. proposed the tree semantics of the dynamic pushdown network in 2009. The execution of the program is modeled as a tree form, which is more in line with the actual operation of the program, and the reachability analysis method of the dynamic push-down network under the tree semantics is given, but the communication between threads is not considered (P. Lammich, M. Müller-Olm, and A. Wenner. Predecessor sets of dynamic pushdown networks with tree-regular constraints. In Proc. of ICCAV2009, LNCS 5643, Grenoble: ArtistDesign, 2009, 525-539)

Bouajjani proposed an asynchronous dynamic pushdown network model based on the dynamic pushdown network model, which can model the asynchronous communication of threads based on shared memory, but its reachability problem is undecidable (A.Bouajjani, J.Esparza, S. Schwoon, and J. Strejcek. Reachability analysis of multithreaded software with asynchronous communication. In Proc. of FSTTCS 2005, LNCS3821, Hyderabad: Springer, 2005, 348-359)

Images