Automatic verification of transactions on an object-oriented database

Spelt, David; Balsters, Herman

doi:10.1007/3-540-64823-2_22

Cited by 10 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in this paper extends our previous work ( [15]) by considering additional topics such as inheritance and heterogeneity. Here, emphasis is placed on modelling an object-oriented database schema in HOL, and on the extensions to the Isabelle system to provide automated reasoning for such a database schema.…”

Section: Related Worksupporting

confidence: 53%

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

Spelt

Even

1999

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (such as transaction safety, compensation, and commutativity) to support the advanced transaction models used in workflow and cooperative work. We give an example of method safety analysis for the generic structure editing operations of a cooperative authoring system.

show abstract

Section: Related Worksupporting

confidence: 53%

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

Spelt

Even

1999

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another is the verification of consistency requirements, i.e. whether a method can potentially violate a number of integrity constraints [38,42].…”

Section: Discussionmentioning

confidence: 99%

A set‐oriented method definition language for object databases and its semantics

Bertino

Guerrini

Merlo

2003

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn this paper we propose a set-oriented rule-based method definition language for object-oriented databases. Most existing object-oriented database systems exploit a general-purpose imperative objectoriented programming language as the method definition language. Because methods are written in a general-purpose imperative language, it is difficult to analyze their properties and to optimize them. Optimization is important when dealing with a large amount of objects as in databases. We therefore believe that the use of an ad hoc, set-oriented language can offer some advantages, at least at the specification level. In particular, such a language can offer an appropriate framework to reason about method properties.In this paper, besides defining a set-oriented rule-based language for method definition, we formally define its semantics, addressing the problems of inconsistency and non-determinism in set-oriented updates. Moreover, we characterize some relevant properties of methods, such as conflicts among method specifications in sibling classes and behavioral refinement in subclasses.

show abstract

“…Concerning the reasoning problems we tackle, verifying consistency of transactions is a crucial problem that has been studied extensively in Databases. It has been considered for different kinds of transactions and constraints, over traditional relational databases (Sheard and Stemple 1989), object-oriented databases (Spelt and Balsters 1998;Bonner and Kifer 1994), and deductive databases (Kowalski, Sadri, and Soper 1987), to name a few. Most of these works adopt expressive formalisms like (extensions of) first or higher order predicate logic (Bonner and Kifer 1994), or undecidable tailored languages (Sheard and Stemple 1989) to express the constraints and the operations on the data.…”

Section: Related Workmentioning

confidence: 99%

Managing Change in Graph-Structured Data Using Description Logics

Ahmetaj

Calvanese

Ortiz

et al. 2017

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

In this paper, we consider the setting of graph-structured data that evolves as a result of operations carried out by users or applications. We study different reasoning problems, which range from ensuring the satisfaction of a given set of integrity constraints after a given sequence of updates, to deciding the (non-)existence of a sequence of actions that would take the data to an (un)desirable state, starting either from a specific data instance or from an incomplete description of it. We consider an action language in which actions are finite sequences of conditional insertions and deletions of nodes and labels, and use Description Logics for describing integrity constraints and (partial) states of the data. We then formalize the above data management problems as a static verification problem and several planning problems. We provide algorithms and tight complexity bounds for the formalized problems, both for an expressive DL and for a variant of DL-Lite.

show abstract

Automatic verification of transactions on an object-oriented database

Cited by 10 publications

References 16 publications

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

A set‐oriented method definition language for object databases and its semantics

Managing Change in Graph-Structured Data Using Description Logics

Contact Info

Product

Resources

About