Verifiable properties of database transactions

DOI10.1006/inco.1998.2731zbMath0927.68032OpenAlexW2029670992MaRDI QIDQ1281498

Michael Benedikt, Timothy G. Griffin, Leonid O. Libkin

Publication date: 22 March 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2731

zbMATH Keywords

database transactionstransaction languages

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Game-based notions of locality over finite models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expressiveness of a family of finite set languages
• On the expressive power of counting
• Formalizing Dijkstra's predicate transformer wp in weak second-order logic
• Finite-model theory -- A personal perspective
• Procedural languages for database queries and updates
• An axiom system for database transactions
• Proving total correctness of nondeterministic programs in infinitary logic
• Logic for improving integrity checking in relational data bases
• Datalog extensions for database queries and updates
• The expressive power of the bounded-iteration construct
• Counting quantifiers, successor relations, and logarithmic space
• Query languages for bags and aggregate functions
• On monadic NP vs monadic co-NP
• On winning Ehrenfeucht games and monadic NP
• On winning strategies with unary quantifiers
• A transaction-based approach to relational database specification
• Reachability is harder for directed than for undirected finite graphs
• Languages that Capture Complexity Classes
• Maintaining state constraints in relational databases: a proof theoretic basis
• Relational expressive power of constraint query languages
• Guarded commands, nondeterminacy and formal derivation of programs
• Comparing the Power of Games on Graphs
• Programming as a Discipline of Mathematical Nature