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: Computing Science in the Netherlands 1991. (Full text available)

Download (166kB)
Download (474kB)


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: Conference or workshop item (Paper)
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: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Eerke Boiten
Date Deposited: 23 Mar 2010 23:58
Last Modified: 20 Oct 2015 14:29
Resource URI: (The current URI for this page, for reference purposes)
ORCiD (Boiten, Eerke Albert):
  • Depositors only (login required):


Downloads per month over past year