EDP Sciences logo
Submit your paper
Search
Menu
All issues Volume 28 / No 6 (December 2023) Wuhan Univ. J. Nat. Sci., 28 6 (2023) 483-492 References
Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 28, Number 6, December 2023
Page(s) 483 - 492
DOI https://doi.org/10.1051/wujns/2023286483
Published online 15 January 2024
  1. Wang J, Zhan N J, Feng X Y, et al. Overview of formal methods [J]. Journal of Software, 2019, 30(1): 33-61(Ch). [Google Scholar]
  2. Gu T L. Formal Methods of Software Development[M]. Beijing: Higher Education Press, 2005(Ch). [Google Scholar]
  3. CAS. Chinese Disciplinary Development Strategy·Software Science and Engineering [M]. Beijing: Science Press, 2021(Ch). [Google Scholar]
  4. You Z, Xue J Y, Zuo Z K. Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms [J]. Cluster Computing, 2016, 19(4): 2145-2156. [CrossRef] [Google Scholar]
  5. Wang C J, Cao Z X, Yu C L,et al. Nonlinear program construction and verification method based on partition recursion and Morgan's refinement rules[J]. Wuhan University Journal of Natural Sciences, 2023, 28(3):246-255.. [CrossRef] [EDP Sciences] [Google Scholar]
  6. Shi H P, Shi H H, Xu S H. Algorithm design through the optimization of reuse-based generation [C]// Proc of National Conference of Theoretical Computer Science. Singapore:Springer-Verlag, 2020: 14-32. [Google Scholar]
  7. Zuo Z K, Hu Y, Huang Q, et al. Automatic algorithm programming model based on the improved Morgan's refinement calculus[J]. Wuhan University Journal of Natural Sciences, 2022, 27(5):405-414. [CrossRef] [EDP Sciences] [Google Scholar]
  8. Dijkstra E W. A Discipline of Programming [M]. Englewood Cliffs: Prentice Hall, 1976. [Google Scholar]
  9. Zuo Z K, Huang Z P, Fang Y, et al. A unified strategy for formal derivation and proof of binary tree nonrecursive algorithms[J]. Wuhan University Journal of Natural Sciences, 2022, 27(5): 415-423. [CrossRef] [EDP Sciences] [Google Scholar]
  10. Shi H H, Xue J Y. Formal development of algorithm based on PAR [J]. Chinese Journal of Computers, 2009(5): 138-147(Ch). [Google Scholar]
  11. Chaudhari D L, Damani O. Introducing formal methods via program derivation [C]// Proc of ACM Conference on Innovation & Technology in Computer Science Education. New York: ACM Press, 2015: 266-271. [Google Scholar]
  12. Chaudhari D L, Damani O. Combining top-down and bottom-up techniques in program derivation [C]// Proc of Inter Sym on Logic-Based Program Synthesis and Transformation. Cham: Springer-Verlag, 2015: 244-258. [MathSciNet] [Google Scholar]
  13. Kourie D G, Watson B W. Correctness-by-Construction Approach to Programming [M]. Berlin: Springer-Verlag, 2012. [CrossRef] [Google Scholar]
  14. Watson B W, Cleophas L G, Kourie D G. Using correctness-by-construction to derive dead-zone algorithms [C]// Prague Stringology Conference 2014 Computer Science. Prague: Prague Stringology Club, 2014: 84-95. [Google Scholar]
  15. Manber U. Introduction to Algorithms–A Creative Approach [M]. Boston: Addison-Wesley Longman Publishing Co. Inc, 2010. [Google Scholar]
  16. Shi H H, Xue J Y. Development of a set of highly reliable search algorithm programs based on PAR [J]. Computer Research and Development, 2010(S1): 212-216(Ch). [Google Scholar]
  17. Michael J B, Dinolt G W, Drusinsky D. Open questions in formal methods [J]. IEEE Annals of the History of Computing, 2020, 53(5): 81-84. [CrossRef] [Google Scholar]
  18. Xue J Y, You Z, Hu Q M, et al. PAR: A practicable formal method and its supporting platform [C]// Proc of Inter Con on Formal Engineering Methods. Cham: Springer-Verlag, 2018: 70-86. [Google Scholar]
  19. Zuo Z K, Su W, Liang Z Y, et al. A formal method for developing algebraic and numerical algorithms[J]. Wuhan University Journal of Natural Sciences, 2021, 26(2): 191-199. [Google Scholar]
  20. Bundy A. The automation of proof by mathematical induction —ScienceDirect [J]. Handbook of Automated Reasoning, 2001, 1: 845-911. [CrossRef] [Google Scholar]
  21. Xue J Y. A unified approach for developing efficient algorithmic programs [J]. Comput Sci & Technol,1997, 12(4): 314-329. [CrossRef] [MathSciNet] [Google Scholar]
  22. Morgan C. Programming from Specifications[M]. Englewood Cliffs: Prentice-Hall Inc, 1994. [Google Scholar]
  23. Gries D. A note on a standard strategy for developing loop invariants and loops [J]. Science of Compute Programming, 1982, 2(3): 207-214. [CrossRef] [Google Scholar]
  24. Lai Y. Development of APLA to C++ Automatic Program Transformation System [D]. Nanchang: Jiangxi Normal University, 2002(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.