IEEE Transactions on Software Engineering
On the modes and meaning of feedback to transaction designers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Integrity checking for multiple updates
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Database theory for supporting specification-based database system development
ICSE '85 Proceedings of the 8th international conference on Software engineering
A Formal System for Reasoning about Programs Accessing a Relational Database
ACM Transactions on Programming Languages and Systems (TOPLAS)
Social processes and proofs of theorems and programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Reasoning about recursively defined data structures
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The logic of a relational data manipulation language
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Specification and verification of abstract database types
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Abstract Data Types in Databases: Specification, Manipulation and Access
Proceedings of the Second International Conference on Data Engineering
Coping with complexity in automated reasoning about database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New hope on data models and types: report of an NSF-INRIA workshop
ACM SIGMOD Record - Directions for future database research & development
DAIDA: an environment for evolving information systems
ACM Transactions on Information Systems (TOIS)
The deductive synthesis of database transactions
ACM Transactions on Database Systems (TODS)
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
Verifiable properties of database transactions
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Behavioural Conflicts in a Causal Specification
Automated Software Engineering
Orthogonally persistent object systems
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
Thémis: a database programming language handling integrity constraints
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
Exploring into Programs for the Recovery of Data Dependencies Designed
IEEE Transactions on Knowledge and Data Engineering
Synthesizing Database Transactions
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Database Application Development as an Object Modeling Activity
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Integrity Maintenance in Object-Oriented Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Reliable Transaction Design Using MTS
COMPSAC '00 24th International Computer Software and Applications Conference
A Family of the ODMG Object Models
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Typed Sets as a Basis for Object-Oriented Database Schemas
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Nested Transactions with Integrity Constraints
Selected papers from the Eight International Workshop on Foundations of Models and Languages for Data and Objects, Transactions and Database Dynamics
A Theorem Prover-Based Analysis Tool for Object-Oriented Databases
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Concurrent checking of global cross-database integrity constraints
Integrity and internal control in information systems V
Automated elicitation of inclusion dependencies from the source code for database transactions
Journal of Software Maintenance: Research and Practice
Management of business process constraints using BPTrigger
Computers in Industry
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Verification technology for object-oriented/XML transactions
ICOODB'09 Proceedings of the Second international conference on Object databases
Object-oriented constraints for XML schema
ICOODB'10 Proceedings of the Third international conference on Objects and databases
Qex: symbolic SQL query explorer
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Maintaining database integrity with refinement types
Proceedings of the 25th European conference on Object-oriented programming
Verification theories for XML schema
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
Automatic versus interactive program verification
Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
Hi-index | 0.00 |
Maintaining the integrity of databases is one of the promises of database management systems. This includes assuring that integrity constraints are invariants of database transactions. This is very difficult to accomplish efficiently in the presence of complex constraints and large amounts of data. One way to minimize the amount of processing required to maintain database integrity over transaction processing is to prove at compile-time that transactions cannot, if run atomically, disobey integrity constraints. We report on a system that performs such verification for a robust set of constraint and transaction classes. The system accepts database schemas written in a more or less traditional style and accepts programs in a high-level programming language. Automatic verification fast enough to be effective on current workstation hardware is performed.