Coping with Complexity in Automated Reasoning about Database Systems.

Tim Sheard, David W. Stemple: Coping with Complexity in Automated Reasoning about Database Systems. VLDB 1985: 426-435

@inproceedings{DBLP:conf/vldb/SheardS85,
  author    = {Tim Sheard and
               David W. Stemple},
  editor    = {Alain Pirotte and
               Yannis Vassiliou},
  title     = {Coping with Complexity in Automated Reasoning about Database
               Systems},
  booktitle = {VLDB'85, Proceedings of 11th International Conference on Very
               Large Data Bases, August 21-23, 1985, Stockholm, Sweden},
  publisher = {Morgan Kaufmann},
  year      = {1985},
  pages     = {426-435},
  ee        = {db/conf/vldb/SheardS85.html},
  crossref  = {DBLP:conf/vldb/85},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Automated reasoning about database systems refers to using a program or programs to draw inferences about properties of systems and can be used by designers to analyze system designs, by query processors to optimize queries, and by transaction compilers or interpreters to optimize the checking of integrity constraints. Automated reasoning can also be used as logic programming and combined with database processing in ways that promise to be very powerful in dealing with problems currently intractable. In these efforts, complexity will be a ignificant problem to be dealt with. We report on experience in dealing with complexity during efforts to mechanically prove properties of database systems.

Copyright © 1985 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Alain Pirotte, Yannis Vassiliou (Eds.): VLDB'85, Proceedings of 11th International Conference on Very Large Data Bases, August 21-23, 1985, Stockholm, Sweden. Morgan Kaufmann 1985
Contents

References

[Balzer et al. 83]: ...
[Boyer and Moore 79]: ...
[Burstall 69]: ...
[Gardarain and Melkanoff 79]: Georges Gardarin, Michel A. Melkanoff: Proving Consistency of Database Transactions. VLDB 1979: 291-298
[Gerhart 83]: ...
[King 81]: Jonathan J. King: QUIST: A System for Semantic Query Optimization in Relational Databases. VLDB 1981: 510-517
[Schmidt 77]: Joachim W. Schmidt: Some High Level Language Constructs for Data of Type Relation. ACM Trans. Database Syst. 2(3): 247-261(1977)
[Stemple and Sheard 84]: David W. Stemple, Tim Sheard: Specification and Verification of Abstract Database Types. PODS 1984: 248-257
[Walker and Salveter 81]: ...
[Yokota 84]: Haruo Yokota, Susumu Kunifuji, Takeo Kakuta, Nobuyoshi Miyazaki, Shigeki Shibayama, Kunio Murakami: An Enhanced Inference Mechanism for Generating Relational Algebra Queries. PODS 1984: 229-238