Model checking for database theoreticians

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3363 LNCS, Issue , 2005, Pages 1-16

  Vardi, Moshe Y ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC TECHNIQUES; ALGORITHMIC VERIFICATION; AUTOMATED REASONING; VERIFICATION TECHNIQUES; VERIFICATION TOOLS;

ALGORITHMS; DATABASE SYSTEMS; MODEL CHECKING;

AUTOMATA THEORY;

EID: 77049096075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_1     Document Type: Conference Paper

References (76)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: from Relations to Semistructured Data and XML. Morgan Kaufmann, San Mateo, CA, 2000.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison-Wesley, 1995.
3. S. Abiteboul, V. Vianu, B.S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. J. Comput. Syst. Sci., 61(2):236-269, 2000.
4. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. 13th Int'l Conf. on Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 207-220. Springer-Verlag, 2001.
5. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symp. on Foundations of Computer Science, pages 100-109, Florida, October 1997.
6. R. Alur, K.L. McMillan, and D. Peled. Model-checking of correctness conditions for concurrent objects. Information and Computation, 160(1-2):167-188, 2000.
7. R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification logic. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 296-211, Grenoble, France, April 2002. Springer-Verlag.
8. P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin/Cummings, 1993.
9. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 135-150,Warsaw, July 1997. Springer-Verlag.
10. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
11. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
12. O. Burkart, D. Caucal, F. Moller, and B. Steffen.Verification over infinite states. In J. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, pages 545-623. Elsevier, 2001.
13. O. Burkart and B. Steffen. Model checking for context-free processes. In Proc. 3rd Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 123-137. Springer-Verlag, 1992.
14. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic J. Comut., 2:89-125, 1995.
15. T. Cachat. Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In Proc. 30th International Colloqium on Automata, Languages, and Programming, volume 2719 of Lecture Notes in Computer Science, pages 556-569, Eindhoven, The Netherlands, June 2003. Springer-Verlag.
16. J. Chomicki and D. Niwinski. On the feasibility of checking temporal integrity constraints. J. Comput. Syst. Sci., 51(3):523-535, 1995.
17. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
18. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
19. E.M. Clarke and J.M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, 28:626-643, 1996.
20. C. Courcoubetis, M.Y.Vardi, P.Wolper, and M.Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
21. A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web services. In Proc. 23rd ACM Symp. on Principles of Database Systems, pages 71-82, 2004.
22. M. Dickhfer and T.Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 281-290, Prague, Czech Republic, 1999. Springer-Verlag, Berlin.
23. H.D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer-Verlag, 1995.
24. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 328-337, White Plains, October 1988.
25. E.A. Emerson and C. Jutla. Tree automata, μ -calculus and determinacy. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 368-377, San Juan, October 1991.
26. E.A. Emerson and C.-L. Lei. Temporal model checking under generalized fairness constraints. In Proc. 18th Hawaii International Conference on System Sciences, North Holywood, 1985. Western Periodicals Company.
27. A. Finkel, B.Willems, and P.Wolper.Adirect symbolic approach to model checking pushdown automata. In F. Moller, editor, Proc. 2nd International Workshop on Verification of Infinite States Systems, 1997.
28. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembiski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
29. P. Godefroid and P.Wolper. A partial approach to model checking. Information and Computation, 110(2):305-326, May 1994.
30. J. Gray andA. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
31. R.H. Hardin, Z. Har'el, and R.P. Kurshan. COSPAN. In Computer Aided Verification, Proc. 8th International Conference, volume 1102 of Lecture Notes in Computer Science, pages 423-427. Springer-Verlag, 1996.
32. T.A. Henzinger, P.-H Ho, and H.Wong-Toi. A user guide to hytech. InTools and algorithms for the construction and analysis of systems, volume 1019 of Lecture Notes in Computer Science, pages 41-71. Springer-Verlag, 1995.
33. T.A. Henzinger, O. Kupferman, and M.Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In Proc. 7th Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 514-529, Pisa, August 1996. Springer-Verlag.
34. G.J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279-295, May 1997. Special issue on Formal Methods in Software Practice.
35. G.E. Hughes and M.J. Cresswell. A New Introduction to Modal Logic. Routledge, London, 1996.
36. R. Hull, M. Benedikt, V. Christophides, and J. Su. E-services: a look behind the curtain. In Proc. 22rd ACM Symp. on Principles of Database Systems, pages 1-14, 2003.
37. D. Janin and I.Walukiewicz. Automata for the modal μ -calculus and related results. In Proc. 20th International Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages 552-562. Springer-Verlag, 1995.
38. D. Kozen. Results on the propositional μ -calculus. Theoretical Computer Science, 27:333-354, 1983.
39. O. Kupferman, N. Piterman, and M.Y. Vardi. Model checking linear properties of prefixrecognizable systems. In Proc. 14th International Conference on Computer AidedVerification, volume 2404 of Lecture Notes in Computer Science, pages 371-385. Springer-Verlag, 2002.
40. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81-92, June 1998.
41. O. Kupferman and M.Y. Vardi. Modular model checking. In Proc. Compositionality Workshop, volume 1536 of Lecture Notes in Computer Science, pages 381-401. Springer-Verlag, 1998.
42. O. Kupferman and M.Y.Vardi. Robust satisfaction. In Proc. 10th Conference on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 383-398. Springer-Verlag, August 1999.
43. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to reasoning about infinitestate systems. In Proc. 12th International Conference on Computer AidedVerification, volume 1855 of Lecture Notes in Computer Science, pages 36-52. Springer-Verlag, 2000.
44. O. Kupferman and M.Y. Vardi. Synthesis with incomplete informatio. In Advances in Temporal Logic, pages 109-127. Kluwer Academic Publishers, January 2000.
45. O. Kupferman and M.Y.Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2001(2):408-429, July 2001.
46. O. Kupferman, M.Y.Vardi, and P.Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
47. R.P. Kurshan. Computer AidedVerification of Coordinating Processes. Princeton Univ. Press, 1994.
48. R.P. Kurshan. Formal verification in a commercial setting. In Proc. Conf. on Design Automation (DAC'97), volume 34, pages 258-262, 1997.
49. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proc. 7th ACM Symp. on Principles of Programming Languages, pages 174-185, January 1980.
50. K. G. Larsen, P. Petterson, andW.Yi. UPPAAL: Status & developments. In Computer Aided Verification, Proc. 9th International Conference, volume 1254 of Lecture Notes in Computer Science, pages 456-459. Springer-Verlag, 1997.
51. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symp. on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
52. D. Maier. The Theory of Relational Databases. Computer Science Press, Rockville, Md., 1983.
53. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
54. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
55. F. Neven. Automata, logic, and XML. In 16th InternationalWorkshop on Computer Science Logic, volume 2471 of Lecture Notes in Computer Science, pages 2-26, Edinburgh, Scotland, September 2002. Springer-Verlag.
56. F. Neven. Automata theory for xml researchers. SIGMOD Record, 31(3):39-46, 2002.
57. N. Goodman P.A. Bernstein,V. Hadzilacos. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
58. C. Papadimitiou. Theory of Database Concurrency Control. Computer Science Pr., 1986.
59. C.H. Papadimitriou. Database metatheory: Asking the big queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 1-10, 1995.
60. D. Peled, S. Katz, and A. Pnueli. Specifying and proving serializability in temporal logic. In Proc. 6th IEEE Symp. on Logic in Computer Science, pages 232-244, 1991.
61. N. Piterman and M. Vardi. Micro-macro stack systems: A new frontier of decidability for sequential systems. In 18th IEEE Symposium on Logic in Computer Science, pages 381-390, Ottawa, Canada, June 2003. IEEE, IEEE press.
62. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundation of Computer Science, pages 46-57, 1977.
63. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179-190, Austin, January 1989.
64. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351. Springer-Verlag, 1981.
65. M. Spielmann. Verification of relational transducers for electronic commerce. J. Comput. Syst. Sci., 66:40-65, 2003.
66. M.Y.Vardi. Automata theory for database theoreticians. In Proc. 8thACMSymp. on Principles of Database Systems, pages 83-92, 1989.
67. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag, Berlin, 1996.
68. M.Y. Vardi. Reasoning about the past with two-way automata. In Proc. 25th International Coll. onAutomata, Languages, and Programming, volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer-Verlag, Berlin, July 1998.
69. M.Y.Vardi. Branching vs. linear time: Final showdown. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2031 of Lecture Notes in Computer Science, pages 1-22. Springer-Verlag, 2001.
70. M.Y.Vardi and P.Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
71. M.Y. Vardi and P.Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
72. I.Walukiewicz. Pushdown processes: games and model checking. In Proc. 8th International Conference on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 62-74. Springer-Verlag, 1996.
73. G.Weikum and G. Vossen. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control. Morgan Kaufmann, 2001.
74. + is exponentially more succinct than CTL. In C. Pandu Ragan,V. Raman, and R. Ramanujam, editors, Proc. 19th conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer-Verlag, 1999.
75. B. Willems and P. Wolper. Partial-order methods for model checking: From linear time to branching time. In Proc. 11th Symp. on Logic in Computer Science, pages 294-303, New Brunswick, July 1996.
76. P.Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 185-194, Tucson, 1983.