The New Standards System for Processing Food to Be Proved

It is reported that the work of re-structuring the frame of China nationalstandards system for processing food has been finished with the print and distribution of 2004-2005Development Plan of National Standards for Food (hereinafter Plan). According to the demand of thePlan, there will be great changes among the current national standards and the professionalstandards for processing food, in which some standards will be integrated with others, somestandards will be cancelled, and some will be brought into the new standards system after the reviewof standards. The standards after being changed and the new national standards and the professionalstandards that need to be developed compose the new standards system for processing food.

A Unified Strategy for Formal Derivation and Proof of Binary Tree Nonrecursive Algorithms

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-consuming derivation process,complicated loop invariants,and the inability to generate executable programs from the specification.This paper proposes a unified strategy for the formal derivation and proof of binary tree non-recursive algorithms to address these issues.First,binary tree problem solving sequences are decomposed into two types of recursive relations based on queue and stack,and two corresponding loop invariant templates are constructed.Second,high-reliability Apla(abstract programming language)programs are derived using recursive relations and loop invariants.Finally,Apla programs are converted automatically into C++executable programs.Two types of problems with binary tree queue and stack recursive relations are used as examples,and their formal derivation and proof are performed to validate the proposed strategy’s effectiveness.This strategy improves the efficiency and correctness of binary tree algorithm derivation.