Solving a combinatorial problem by transformation of abstract data types

Boiten, Eerke Albert (1991) Solving a combinatorial problem by transformation of abstract data types. In: van Leeuwen, J., ed. UNSPECIFIED Stichting Mathematisch Centrum, Amsterdam, pp. 99-108. ISBN 90-6196-403-2. (KAR id:20987)

Postscript Language: English
Click to download this file (166kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format
PDF Language: English
Click to download this file (474kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format

Abstract

Techniques from the area of formal specification are shown to be useful in the analysis of combinatorial problems. A problem description is given, using an abstract data type. By gradual elimination of the equivalences on the data types a unique representation of the type is derived which reduces the new problem to a known one.

Item Type:	Book section
Additional information:	Also a chapter in PhD thesis
Uncontrolled keywords:	program transformation, abstract data types, permutations
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Eerke Boiten
Date Deposited:	23 Mar 2010 23:58 UTC
Last Modified:	16 Nov 2021 09:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/20987 (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:	https://orcid.org/0000-0002-9184-8968

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.