The ACID model checker and code generator for transaction processing

Abstract

Traditional transaction processing aims in delivering the ACID properties (Atomicity, Consistency, Isolation, Durability)

Model checking and code generation for transaction processing software

“…Preliminary results for the basic transaction model were published in [13]. In this article, we verify the properties of nested transactions [16], a well-known advanced transaction model.…”

“…Correctness property 1 Workers conform to the coordinator decision (either commit or abort). This correctness property should be verified for the basic 2PC protocol , as well as for the nested transaction model. The following two functions return TRUE for the paths, where the decision of the coordinator is not applied by the worker (negation of property 1):

…”

“…The verification and code generation functions have been implemented in a tool called ACID Model Checker & Code Generator . The tool generates code for ACID Sim Tools , a simulator for studying the performance and recovery tradeoffs in transaction processing.…”

Quantification of interacting runtime qualities in software architectures: Insights from transaction processing in client–server architectures

“…Class hierarchies that combined with the code generation functionality allow specification, verification [37] and rapid implementation of simulations for new transaction models. Embedded debugging functions and an OMNeT++ graphical user interface that supports interactive simulation and model inspection.…”

“…For the verification of transaction models we employ the ACID Model Checker utility [37], which uses the state machine based model definition adopted by the ACID Sim Tools. Specifically, it is verified that: (i) there are no unreachable states and non-terminating execution paths in the state machines corresponding to the worker and the coordinator, (ii) the transition relation is not partially defined, which would cause simulation run-time errors, (iii) workers conform to the decision of the coordinator, (iv) workers and the coordinator reach exactly one of the two possible decisions (commit or abort), (v) a transaction is committed if and only if all workers have voted for commit, (vi) the transaction participants eventually reach a decision, even in the presence of communication and system failures.…”