A unified strategy for formal derivation and proof of binary tree nonrecursive algorithms
ZUO Zhengkang, Z HUANG, F Yue… - … Journal of Natural …, 2022 - wujns.edpsciences.org
In the formal derivation and proof of binary tree algorithms, Dijkstra's weakest predicate
method is commonly used. However, the method has some drawbacks, including a time …
method is commonly used. However, the method has some drawbacks, including a time …
Development Method of Three Kinds of Typical Tree Structure Algorithms and Isabelle-based Machine Assisted Verification
C Wang, F Xu, H Luo, Q Huang… - 2020 IEEE 20th …, 2020 - ieeexplore.ieee.org
The tree structure algorithms have been widely used in many computer fields. Developing
efficient and reliable tree structure algorithms is a challenging problem in the field of …
efficient and reliable tree structure algorithms is a challenging problem in the field of …
[HTML][HTML] Static analysis of lists by combining shape and numerical abstractions
L Chen, R Li, X Wu, J Wang - Science of Computer Programming, 2014 - Elsevier
We present an approach in the framework of abstract interpretation to analyze list-
manipulating programs by combining shape and numerical abstractions. The analysis …
manipulating programs by combining shape and numerical abstractions. The analysis …