A Random Bag Preserving Product Operation

Michel Schellekens
2009 Electronical Notes in Theoretical Computer Science  
The author's current research programme is the development of a modular calculus for the average-cost of data structuring. This modular calculus provides a novel foundation for the analysis of algorithms. Its applicability to the analysis of algorithms has been demonstrated at the Center for Efficiency-Oriented Languages (CEOL) through the design of the novel programming language MOQA and the associated average-case analysis tool DISTRI-TRACK [8, 4, 5, 2, 3] . Modular computations of the
more » ... tions of the average cost of data structuring are possible through the fundamental notion of random bag preservation. Random bag preserving operations enable the constructive tracking of the data and the distribution of the data states during a MOQA computation. This in turn enables the (semi-)automated derivation of the average cost of the operations. Two fundamental MOQA operations enable the creation and destruction of data structures: the MOQA product operation, which is the subject of this paper, and the MOQA delete operation, which forms the subject of [3] . The introduction of the entire MOQA language is well beyond the scope of this paper and will be reported in a book [2] . The language has been implemented at CEOL and automated derivations of average-cost of data structuring are under way. Here we report on a (simplified) version of the fundamental notion of random bag preservation and demonstrate that the central MOQA product operation possesses this crucial property.
doi:10.1016/j.entcs.2008.12.085 fatcat:lku33q2ggza6dbamr5a7e6to4m