School of Computing

Solving a combinatorial problem by transformation of abstract data types

E.A. Boiten

In J. van Leeuwen, editor, Computing Science in the Netherlands 1991, pages 182-196, Amsterdam, November 1991. Stichting Mathematisch Centrum Also a chapter in PhD thesis.

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.

Download publication 66 kbytes

Bibtex Record

@conference{156,
author = {E.A. Boiten},
title = {Solving a combinatorial problem by transformation of             abstract data types},
month = {November},
year = {1991},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Also a chapter in PhD thesis},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1991/156},
    ISBN = {90-6196-403-2},
    address = {Amsterdam},
    booktitle = {Computing Science in the Netherlands 1991},
    editor = {J. van Leeuwen},
    publisher = {Stichting Mathematisch Centrum},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014