一个描述内存工作区操作的公理语义方法

THE ALGORITHMS OF NETWORK SYSTEM CLEANING PROBLEM

本文定义了一个内存工作区处理语言ＭＰＬ，并提出用于描述该语言的形式化方法．作为示例，文中最后给出一个程序部分正确性的验证提纲．

This paper gives two algorithms on general network cleaning problem: one is greedy, its complexity is O(|E|), the other uses b-c tree and tree-cleaning algorithm; its complexity is O(n3logn).