159,758 research outputs found

    Abstract State Machines 1988-1998: Commented ASM Bibliography

    Get PDF
    An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

    Loyalty Programme Applications in Indian Service Industry

    Get PDF
    Retaining all customers would not be a good idea for any business. In contrast, allowing the profitable customers to leave would be an even worse idea. Consequently the real solution rests in knowing the value of each customer and then focusing loyalty efforts on those customers. Customers are more likely to be loyal to a group of brands than to a single brand. This is particularly true if the chosen brand is the category leader and costs more. In contrast to the one – brand- for – life mentality of the past, today’s consumers are blatant in their divided loyalties, for their own safety and pleasure. The conceptual framework presented helps to understand the evolving logic of loyalty programs and process of implementing the same. Applications in different service industry for building and sustaining loyalty provide an overview of the status of such programmes.

    Ensuring Query Compatibility with Evolving XML Schemas

    Get PDF
    During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and accommodate the impact of theses changes in rapidly evolving XML applications. This article proposes a logical framework and tool for verifying forward/backward compatibility issues involving schemas and queries. First, it allows analyzing relations between schemas. Second, it allows XML designers to identify queries that must be reformulated in order to produce the expected results across successive schema versions. Third, it allows examining more precisely the impact of schema changes over queries, therefore facilitating their reformulation

    Equivalence is in the Eye of the Beholder

    Get PDF
    In a recent provocative paper, Lamport points out "the insubstantiality of processes" by proving the equivalence of two different decompositions of the same intuitive algorithm by means of temporal formulas. We point out that the correct equivalence of algorithms is itself in the eye of the beholder. We discuss a number of related issues and, in particular, whether algorithms can be proved equivalent directly.Comment: See also the ASM web site at http://www.eecs.umich.edu/gasm
    • 

    corecore