Verification of relational tranducers for electronic commerce

Motivated by recent work of Abiteboul, Vianu, Fordham, and Yesha [3] we investigate the verifiability of transaction protocols specifying the interaction of multiple partiesvia a network, where each party is equipped with an (active) database that participates in the interaction. Such transaction protocols typically occur in the context of electronic commerce applications and can be formalized as relational transducers. We introduce a class of powerful relational transducers based on Gurevich's abstract state machines and show that several verification problems related to electronic commerce applications can be solved for these transducers. Our approach is, in some sense, complementary to the approach in [3].

[1]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[2]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[3]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[4]  Yelena Yesha,et al.  Electronic Commerce: An Overview , 1994, Electronic Commerce.

[5]  Serge Abiteboul,et al.  Temporal versus first-order logic to query temporal databases , 1996, PODS.

[6]  Marc Spielmann.  Automatic Verification of Abstract State Machines , 1999, CAV.

[7]  Serge Abiteboul,et al.  Relational transducers for electronic commerce , 1998, J. Comput. Syst. Sci..

[8]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[9]  Serge Abiteboul,et al.  Evolving databases: an application to electronic commerce , 1997, Proceedings of the 1997 International Database Engineering and Applications Symposium (Cat. No.97TB100166).

[10]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[11]  Yuri Gurevich.  Draft of the ASM Guide , 1997 .

[12]  Victor Vianu,et al.  Semantics and Expressiveness Issues in Active Databases , 1998, J. Comput. Syst. Sci..

[13]  Neil Immerman,et al.  Model Checking and Transitive-Closure Logic , 1997, CAV.

[14]  Alon Y. Halevy,et al.  Equivalence, query-reachability and satisfiability in Datalog extensions , 1993, PODS '93.

[15]  Michael Schrefl,et al.  Semantics of Object-Oriented Data Models - The Evolving Algebra Approach , 1990, East/West Database Workshop.

[16]  Eric Rosen,et al.  An existential fragment of second order logic , 1999, Arch. Math. Log..

[17]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[18]  Egon Börger,et al.  Abstract State Machines 1988-1998: Commented ASM Bibliography , 1998, Bull. EATCS.

[19]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.