Model checking for database theoreticians

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Algorithmic verification is one of the most successful applications of automated reasoning in computer science. In algorithmic verification one uses algorithmic techniques to establish the correctness of the system under verification with respect to a given property. Model checking is an algorithmic-verification technique that is based on a small number of key ideas, tying together graph theory, automata theory, and logic. In this self-contained talk I will describe how this "holy trinity" gave rise to algorithmic-verification tools, and discuss its applicability to database verification. © 2005 Springer-Verlag.

Cite

CITATION STYLE

APA

Vardi, M. Y. (2005). Model checking for database theoreticians. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3363 LNCS, pp. 1–16). https://doi.org/10.1007/978-3-540-30570-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free