There are many examples of actions on abstract data types which can be correctly implemented with nonserralizable and nonrecoverable schedules of reads and writes. We examme a model of multiple layers of abstraction that explains this phenomenon and suggests an approach to burldmg layered systems with transaction oriented synchromzatron and roll back. Our model may make it easier to provide the high data mtegrrty of reliable database transaction processmg in a broader class of mformatron systems. We concentrate on the recovery aspects here, a technical report [Moss et al 851 has a more complete drscussron of concurrency control.
Available at: http://works.bepress.com/eliot_moss/64/