EDP Sciences logo
Submit your paper
Search
Menu
All issues Volume 30 / No 2 (April 2025) Wuhan Univ. J. Nat. Sci., 30 2 (2025) 184-194 References
Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 2, April 2025
Page(s) 184 - 194
DOI https://doi.org/10.1051/wujns/2025302184
Published online 16 May 2025
  1. Lochbihler A. A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory[J]. Journal of Automated Reasoning, 2022, 66(4): 585-610. [Google Scholar]
  2. Wang X B, Kou M S, Li C Y, et al. Implementation of theorem prover for PPTL with indexed expressions[J]. Journal of Software, 2022, 33(6): 2172-2188(Ch). [Google Scholar]
  3. Zhao Y W. Functional Programming and Proof[EB/OL]. [2021-07-06]. https://www.yuque.com/zhaoyongwang/fpp/(Ch). [Google Scholar]
  4. Dong M, Chang Z J, Zhang R J. A multiple pattern matching algorithm for specifications of incremental metadata for sci-tech literature[J]. Data Analysis and Knowledge Discovery, 2021, 5(6): 135-144(Ch). [Google Scholar]
  5. Aho A V, Corasick M J. Efficient string matching: An aid to bibliographic search[J]. Communications of the ACM, 1975, 18(6): 333-340. [Google Scholar]
  6. Shen Z, Wang Y C, Liu G S. Improved multiple pattern algorithm for Chinese string matching[J]. Journal of the China Society for Scientific and Technical Information, 2002, 21(1): 27-32(Ch). [Google Scholar]
  7. Zhu Y Q, Qin Z G. Multi-pattern matching algorithm based on coding association[J]. Computer Science, 2016, 43(2): 26-30(Ch). [Google Scholar]
  8. Liao M T, Zhang D Y, Li J K. High efficiency Chinese-English multi-pattern match algorithm based on network processor[J]. Computer Engineering, 2007, 33(5): 38-40(Ch). [Google Scholar]
  9. Sun Q D, Huang X B, Wang Q. Multiple pattern matching on Chinese/English mixed texts[J]. Journal of Software, 2008, 19(3): 674-686(Ch). [Google Scholar]
  10. Zhang P, Liu Y B, Yu J, et al. HashTrie: A space-efficient multiple string matching algorithm[J]. Journal on Communications, 2015, 36(10): 172-180(Ch). [Google Scholar]
  11. Binna R, Zangerle E, Pichl M, et al. HOT: A height optimized trie index for main-memory database systems[C]//Proceedings of the 2018 International Conference on Management of Data. New York: ACM, 2018: 521-534. [Google Scholar]
  12. Wang Z, Li R F, Li Y B, et al. A parallel multiple pattern matching algorithm on Chinese/English mixing[J]. Computer Engineering, 2014, 40(4): 318-321(Ch). [Google Scholar]
  13. Henriksen T. Bounds checking on GPU[J]. International Journal of Parallel Programming, 2021, 49(6): 761-775. [Google Scholar]
  14. Moore J S, Martinez M. A mechanically checked proof of the correctness of the Boyer-Moore fast string searching algorithm[C]//Engineering Methods and Tools for Software Safety and Security. Marktoberdorf: IOS Press, 2009: 267-284. [Google Scholar]
  15. Boyer R S, Moore J S. A fast string searching algorithm[J]. Communications of the ACM, 1977, 20(10): 762-772. [CrossRef] [Google Scholar]
  16. Moreno P, Areias M, Rocha R. On the implementation of memory reclamation methods in a lock-free hash trie design[J]. Journal of Parallel and Distributed Computing, 2021, 155: 1-13. [Google Scholar]
  17. Areias M, Rocha R. On the correctness and efficiency of a novel lock-free hash trie map design[J]. Journal of Parallel and Distributed Computing, 2021, 150: 184-195. [Google Scholar]
  18. Atighehchi K, Rolland R. Optimization of tree modes for parallel hash functions: A case study[J]. IEEE Transactions on Computers, 2017, 66(9): 1585-1598. [Google Scholar]
  19. Lochbihler A, Nipkow T. Trie[EB/OL]. [2024-05-26]. https://www.isa-afp.org/browser_info/current/AFP/Trie/document.pdf. [Google Scholar]
  20. Zuo Z K, Ke Y H, Huang Q, et al. Trie+ structural functional modeling, mechanized verification and application[J]. Journal of Software, 2024, 35(9): 4242-4264(Ch). [Google Scholar]
  21. Nipkow T, Paulson L C, Wenzel M. A proof assistant for higher-order logic[EB/OL]. [2024-05-23]. https://isabelle.in.tum.de/dist/Isabelle/doc/tutorial.pdf. [Google Scholar]
  22. Nipkow T, Blanchette J, Eberl M. Functional algorithms, verified![EB/OL]. [2024-09-22]. https://functional-algorithms-verified.org. [Google Scholar]
  23. Zeng Z C. Modeling, Mechanized Verification, and Application of HashTrie Functional Algorithm[D]. Jiangxi: Jiangxi Normal University, 2024(Ch). [Google Scholar]
  24. Eßmann R, Nipkow T, Robillard S. Verified approximation algorithms[C]// Automated Reasoning. Cham: Springer International Publishing, 2020: 291-306. [Google Scholar]
  25. Zuo Z K, Fang Y, Huang Q, et al. Derivation and formal proof of binary tree sorting non-recursive algorithm[J]. Journal of Jiangxi Normal University (Natural Science), 2020, 44(6): 625-632(Ch). [Google Scholar]
  26. Zuo Z K, Fang Y, Huang Z P, et al. The derivation and formal proof of non-recursive algorithm for binary tree queue relation problems[J]. Journal of Jiangxi Normal University (Natural Science), 2022, 46(1): 49-58(Ch). [Google Scholar]
  27. Wang C J, He J F, Luo H M, et al. The model-driven Dafny program generation and automatic verification[J]. Journal of Jiangxi Normal University (Natural Science), 2020, 44(4): 378-384(Ch). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.