School of Computing

Intersections of sets and bags of extended substructures, and Can bag comprehension be used at all?

E.A. Boiten

Technical Report 91-21, Dept. of Informatics, University of Nijmegen, September 1991.

Abstract

Formal specifications that exhibit similarities will often have similar solutions. Thus, it is useful to construct generalized specifications that describe classes of problems, since (partial) solutions to the generalized problem can be used for obtaining solutions for the specific problems.

In this paper we study a class of generalized pattern matching problems, in which the essential operation is the intersection of a particular set and a bag of extended substructures of a structured object. We present a formalization of bags of extended substructures and define the ISBES (Intersection of Sets and Bags of Extended Substructures) class of problems. Some example ISBES specifications are shown, and we present some first ideas about applicable program transformation strategies for ISBES problems.

The second paper discusses conditions under which the non-standard specification mechanism of a bag comprehension may be safely used.

The first paper has been published (details) and included in my PhD thesis.



Bibtex Record

@techreport{163,
author = {E.A. Boiten},
title = {Intersections of Sets and Bags of Extended Substructures,             and {C}an Bag Comprehension be Used at All?},
month = {September},
year = {1991},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1991/163},
    institution = {Dept. of Informatics, University of Nijmegen},
    number = {91-21},
}

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

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

Last Updated: 21/03/2014