Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model

DOI10.1002/cpe.610zbMath0971.68531OpenAlexW2111131575MaRDI QIDQ2744791

David Spelt, Susan Even

Publication date: 6 November 2001

Published in: Concurrency and Computation: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/compensation-methods-to-support-cooperative-applications-a-case-study-in-automated-verification-of-schema-requirements-for-an-advanced-transaction-model(9ca452e0-7833-4b9e-a6e1-86603c77831a).html

zbMATH Keywords

workflow systemstheorem provertransaction model

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Uses Software

• PVS
• Z

Cites Work

• The impact of recovery on concurrency control
• The expressive power of the bounded-iteration construct
• Isabelle. A generic theorem prover
• Commutativity-based concurrency control for abstract data types
• The notions of consistency and predicate locks in a database system
• Unnamed Item
• Unnamed Item

This page was built for publication: Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model