Abstract Interpretation for Termination Analysis in Functional Active Databases

  • Authors:
  • James Bailey;Alexandra Poulovassilis

  • Affiliations:
  • Department of Computer Science, King‘s College London, Strand, London WC2R 2LS, UK. james@dcs.kcl.ac.uk;Department of Computer Science, King‘s College London, Strand, London WC2R 2LS, UK. alex@dcs.kcl.ac.uk

  • Venue:
  • Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

An active database consists of a traditional database supplementedby a set of Event-Condition-Action (ECA) rules. One of the key questions for active database designers is that of termination of the ECA rules. The behaviour of the ECA rules may be obscure and their semantics isoften not specified formally.Consequently, developing termination analysis algorithms and proving theircorrectness is a challenging task.In this paper we address this problem for functional active databasesby adopting an abstract interpretation approach.By “functional active databases” we mean active databases whosetransaction execution semantics have been expressed in a purely functionallanguage. Although we demonstrate our techniques for a specific active DBMSwhich supports a functional database programming language interface, thesetechniques are directly applicable to other active DBMSs whose executionsemantics have been specified using a functional or a denotational approach.