On computing a longest path in a tree

被引：39

作者：

Bulterman, RW ^{[1
]}

van den Sommen, FW ^{[1
]}

Zwaan, G ^{[1
]}

Verhoeff, T ^{[1
]}

van Gasteren, AJM ^{[1
]}

Feijen, WHJ ^{[1
]}

机构：

[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 02期

关键词：

program derivation; calculational reasoning;

D O I：

10.1016/S0020-0190(01)00198-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An exercise in proof design for computing a longest path in a tree was presented. The design isolates the relevant concepts for the given problem and introduces special-purpose notation and solves the problem in a demand-driven way. It is found that the calculation proper consists of eight small calculational steps in which there is no involvement of case analysis.

引用

页码：93 / 96

页数：4