Handbook of theoretical computer science (vol. B)
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Evolving algebras 1993: Lipari guide
Specification and validation methods
Temporal versus first-order logic to query temporal databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressiveness issues in active databases
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Electronic Commerce: An Overview
Proceedings of the Workshop at NIST on Electronic Commerce, Current Research Issues and Applications
Model Checking and Transitive-Closure Logic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Evolving databases: an application to electronic commerce
IDEAS '97 Proceedings of the 1997 International Symposium on Database Engineering & Applications
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards First-Order Temporal Resolution
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Model Checking Abstract State Machines and Beyond
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
An Ontology-Based Approach to Validation of E-Services under Static and Dynamic Constraints
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Deciding the verification problem for abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the verification of security-aware E-services
Journal of Symbolic Computation
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
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].