Verifiable properties of database transactions
type: Item
instance of: scholarly article
title: Verifiable properties of database transactions
zbMATH Open document ID: 0927.68032
author: Michael Benedikt
author: Timothy G. Griffin
author: Leonid Libkin
published in: Information and Computation
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1267925
zbMATH Keywords: database transactions
zbMATH Keywords: transaction languages
MaRDI profile type: Publication
full work available at URL: inco.1998.2731
OpenAlex ID: W2029670992
cites work: A transaction-based approach to relational database specification
cites work: Procedural languages for database queries and updates
cites work: Datalog extensions for database queries and updates
cites work: Reachability is harder for directed than for undirected finite graphs
cites work: Proving total correctness of nondeterministic programs in infinitary logic
cites work: Relational expressive power of constraint query languages
cites work: Formalizing Dijkstra's predicate transformer wp in weak second-order logic
cites work: Q4036554
cites work: Guarded commands, nondeterminacy and formal derivation of programs
cites work: Programming as a Discipline of Mathematical Nature
cites work: Counting quantifiers, successor relations, and logarithmic space
cites work: Finite-model theory -- A personal perspective
cites work: Q4353557
cites work: Comparing the Power of Games on Graphs
cites work: On monadic NP vs monadic co-NP
cites work: Q3666827
cites work: On the expressive power of counting
cites work: Q3758820
cites work: Languages that Capture Complexity Classes
cites work: The expressiveness of a family of finite set languages
cites work: Query languages for bags and aggregate functions
cites work: Maintaining state constraints in relational databases: a proof theoretic basis
cites work: Logic for improving integrity checking in relational data bases
cites work: On winning strategies with unary quantifiers
cites work: An axiom system for database transactions
cites work: The expressive power of the bounded-iteration construct
cites work: Q3949052
cites work: On winning Ehrenfeucht games and monadic NP
DOI: 10.1006/INCO.1998.2731
description: scientific article; zbMATH DE number 1267925