Abstract

Motivated by recent work of Abiteboul, Vianu, Fordham, and Yesha [3] we investigate the verifiability of transaction protocols specifying the interaction of multiple parties via 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].

Citations

1267	Foundations of Databases - Abiteboul, Hull, et al. - 1995
1009	Temporal and modal logic - Emerson - 1990
431	Finite Model Theory - Ebbinghaus, Flum - 1999
384	Evolving algebras 1993: Lipari guide - Gurevich - 1995
63	draft of the ASM guide - Gurevich - 1997
30	den Bussche. Temporal Versus First-Order Logic to Query Temporal Databases - Abiteboul, Herr, et al. - 1996
22	and V.Vianu. Semantics and expressiveness issues in active databases - Picouet - 1997
17	Abstract State Machines 1988–1998: Commented ASM Bibliography - Börger, Huggins - 1998
17	Semantics of object-oriented data models - The evolving algebra approach - Gottlob, Kappel, et al. - 1990
14	Model Checking and Transitive Closure Logic - Immerman, Vardi
12	Electronic commerce: An overview - Yesha, Adam - 1996
5	Evolving databases: An application to electronic commerce - Fordham, Abiteboul, et al. - 1997
3	Automatic veri of abstract state machines - Spielmann - 1999
2	Equivalence, queryreachability, and satis in Datalog extensions - Levy, Mumick, et al. - 1993
2	Archive for Mathematical Logic - Spielmann - 1999