Verification Technology for Object-Oriented/XML Transactions

Alagić, Suad; Royer, Mark; Briggs, D.

doi:10.1007/978-3-642-14681-7_2

Cited by 3 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our previous results include techniques based on JML and PVS [3]. Our most recent results that apply to XML Schema constraints and the associated transactions are based on Spec# [2].…”

Section: Related Researchmentioning

confidence: 96%

“…Careful investigation of the transaction model shows that it is actually temporal in nature. This is why we developed transaction verification techniques in PVS that are based on a suitable temporal logic [3]. The main disadvantage of this technology is that it requires very sophisticated users and hence it is not likely to be directly used by ordinary database programmers.…”

Section: -Dynamic Enforcement Of Constraintsmentioning

confidence: 99%

“…A pragmatic goal has been static automatic verification which completely hides the prover technology from the users. Automatic static verification of the object-oriented constraints is a major distinction with respect to our previous work [3,4] as well as with respect to other work [8,23,25,6]. Our goals are object-oriented schemas with general integrity constraints, transactions written in a mainstream object-oriented language, and their static verification that guarantees ACID properties in an implementation based on an object-oriented database management system.…”

Section: Introductionmentioning

confidence: 97%

“…In a typed constraint-based database technology, the constraints would fit into the type systems of object-oriented languages and they should be integrated with reflective capabilities of those languages [22] so that they can be introspected at run-time. Most importantly, all of that is not sufficient if there is no technology to enforce the constraints, preferably statically, so that expensive recovery procedures will not be required when a transaction violates the constraints at run-time [2,3].…”

Section: Introductionmentioning

confidence: 98%

“…In addition to keys and referential integrity, such constraints include ranges of values or number of occurrences, ordering, constraints that apply to inheritance, and the integrity requirements for complex objects obtained by aggregation [2]. More general constraints that are not necessarily classical database constraints come from complex application environments and they are often critical for correct functioning of those applications [3].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Verifiable Object-Oriented Transactions

Alagić

Fazeli

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Unlike the existing object-oriented and other database technologies, database schemas in the technology developed in this research are equipped with very general integrity constraints specified in a declarative, logic-based fashion. These declarative specifications are expressed in object-oriented assertion languages and they apply to transactions that are implemented in a full-fledged, mainstream object-oriented programming language. The model of transactions is based on more advanced features of object-oriented type systems, the ownership model, and very general constraints. The main distinction in comparison with other database technologies is that transactions can be verified to satisfy the schema integrity constraints. The two main contributions of this paper are object-oriented schemas equipped with integrity constraints and static verification of transactions with respect to the integrity constraints. Solutions to these open problems have been out of reach so far. Furthermore, transaction verification is not only largely static, but it is also automatic, so that the subtleties of the underlying verification technology are hidden from the users. In addition to static verification, the technology offers dynamic enforcement of the integrity constraints when necessary. The overall outcome is a significant increase in data integrity along with run-time efficiency and reliability of transactions.

show abstract

“…Our previous results include techniques based on JML and PVS [3]. Our most recent results that apply to XML Schema constraints and the associated transactions are based on Spec# [2].…”

Section: Related Researchmentioning

confidence: 96%

Section: -Dynamic Enforcement Of Constraintsmentioning

confidence: 99%