On computing a longest path in a tree

An exercise in proof design is presented. Such design consists in isolating the relevant concepts for the problem at hand, introducing special-purpose notation for them that is geared to manipulation and crisp formal specification, and then solving the problem in a demand-driven way.

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 81; no. 2; pp. 93 - 96
Main Authors:	Bulterman, R.W., van der Sommen, F.W., Zwaan, G., Verhoeff, T., van Gasteren, A.J.M., Feijen, W.H.J.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31-01-2002 Elsevier Sequoia S.A
Subjects:	Calculational reasoning Decision trees Linear programming Program derivation Studies Program derivation Calculational reasoning
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	An exercise in proof design is presented. Such design consists in isolating the relevant concepts for the problem at hand, introducing special-purpose notation for them that is geared to manipulation and crisp formal specification, and then solving the problem in a demand-driven way.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/S0020-0190(01)00198-3