Automatic verification of database-driven systems: A new frontier

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 1-13

  Vianu, Victor ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; COMPUTER AIDED VERIFICATIONS; DRIVEN SYSTEM; FAST PROTOTYPING; HIGH LEVEL SPECIFICATION; MODEL-CHECKING TECHNIQUES; PROGRAMMER PRODUCTIVITY; SIDE EFFECT; SOFTWARE SYSTEMS;

COMPUTER AIDED ANALYSIS; COMPUTER SOFTWARE; MODEL CHECKING;

DATABASE SYSTEMS;

EID: 70349141360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514896     Document Type: Conference Paper

References (71)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. In Proc. ICALP Conference, 1989.
2. S. Abiteboul, O. Benjelloun, and T. Milo. The Active XML project: an overview. VLDB Journal, 17(5):1019-1040, 2008.
3. S. Abiteboul, L. Herr, and J. V. den Bussche. Temporal versus first-order logic to query temporal databases. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 49-57, 1996.
4. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
5. S. Abiteboul, L. Segoufin, and V. Vianu. Static analysis of Active XML systems. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 221-230, 2008.
6. S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. Relational transducers for electronic commerce. Journal of Computer and System Sciences (JCSS), 61(2):236-269, 2000. Extended abstract in PODS 98.
7. N. Adam, V. Atluri, and W. Huang. Modeling and analysis of workflows using Petri nets. Journal of Intelligent Information Systems, 10(2): 131-158, 1998.
8. D. Berardi, D. Calvanese, G. Giacomo, R. Hull, and M. Mecella. Automatic composition of transisiton-based semantic web services with messaging. In Proc. Int'l. Conf. on Very Large Databases (VLDB), 2005.
9. D. Berardi, D. Calvanese, G. D. Giacomo, R. Hull, M. Lenzerini, and M. Mecella. Modeling data & processes for service specifications in Colombo. In EMOI-INTEROP, 2005.
10. D. Berardi, D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Mecella. Automatic composition of e-services that export their behavior. In Proc. Int'l. Conf on Service-Oriented Computing (ICSOC), pages 43-58, 2003.
11. D. Berardi, D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Mecella. E-service composition by description logics based reasoning. In Description Logics, 2003.
12. D. Berardi, D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Mecella. A tool for automatic composition of services based on logics of programs. In Technologies for E-Services, 5th International Workshop (TES), pages 80-94, 2004.
13. D. Berardi, D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Mecella. Automatic service composition based on behavioral descriptions. Int. J. Cooperative Inf. Syst., 14(4):333-376, 2005.
14. D. Berardi, G. D. Giacomo, M. Lenzerini, M. Mecella, and D. Calvanese. Synthesis of underspecified composite e-services based on automated reasoning. In Proc. Int'l. Conf on Service-Oriented, Computing (ICSOC), pages 105-114, 2004.
15. M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 7-16, 2006.
16. A. J. Bonner and M. Kifer. An overview of transaction logic. Theor. Comput. Sci., 133(2):205-265, 1994.
17. A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu. Rewriting systems with data. In Fundamentals of Computation Theory, 16th International Symposium (FCT), volume 4639 of Lecture Notes in Computer Science, pages 1-22. Springer, 2007.
18. A. Bouajjani, P. Habermehl, and R. Mayr. Automatic verification of recursive procedures with one integer parameter. Theoretical Computer Science, 295:85-106, 2003.
19. A. Bouajjani, Y. Jurski, and M. Sighireanu. A generic framework for reasoning about dynamic networks of infinite-state processes. In TA CAS'07, volume 4424 of Lecture Notes in Computer Science, pages 690-705. Springer, 2007.
20. P. Bouyer. A logical characterization of data languages. Information Processing Letters, 84(2):75-85, 2002.
21. P. Bouyer, A. Petit, and D. ThÉrien. An algebraic approach to data languages and timed languages. Information and Computation, 182(2):137-162, 2003.
22. BPML.org. Business process modeling language. http://www.bpmi.org.
23. M. Brambilla, S. Ceri, S. Comai, P. Fraternali, and I. Manolescu. Specification and design of workflow-driven hypertexts. Journal of Web Engineering, 1(1), 2002.
24. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. of the ACM, 30(2):323-342, 1983.
25. T. Bultan, X. Fu, R. Hull, and J. Su. Conversation specification: a new approach to design and analysis of e-service composition. In World Wide Web Conference, pages 403-410, 2003.
26. O. Burkart, D. Caucal, F. Möller, and B. Steffen. Verification of infinite structures. In Handbook of Process Algebra, pages 545-623. Elsevier Science, 2001.
27. S. Ceri, P. Fraternali, A. Bongio, M. Brambilla, S. Comai, and M. Matera. Designing data-intensive Web applications. Morgan-Kaufmann, 2002.
28. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
29. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. Formal methods in system design, 1:275-288, 1992.
30. DAML-S Coalition (A. Ankolekar et al).DAML-S: Web service description for the semantic Web. In The Semantic Web - ISWC, pages 348-363, 2002.
31. H. Davulcu, M. Kifer, C. R. Ramakrishnan, and I. V. Ramakrishnan. Logic based modeling and analysis of workflows. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 25-33, 1998.
32. S. Demri and R. Lazić. LTL with the Freeze Quantifier and Register Automata. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 17-26, 2006.
33. S. Demri, R. Lazic, and A. Sangnier. Model checking freeze LTL over one-counter automata. In Proc. 11th Int'l. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'08), pages 490-504, 2008.
34. A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. This proceedings.
35. A. Deutsch, M. Marcus, L. Sui, V. Vianu, and D. Zhou. A verifier for interactive, data-driven web applications. In Proc. ACM SIGMOD Int'l. Conf. on Management of Data (SIGMOD), pages 539-550, 2005.
36. A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web services. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 71-82, 2004.
37. A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web services. Journal of Computer and System Sciences (JCSS), 73(3):442-474, 2007.
38. A. Deutsch, L. Sui, V. Vianu, and D. Zhou. A system for specification and verification of interactive, data-driven Web applications. In Proc. ACM SIGMOD Int'l. Conf. on Management of Data (SIGMOD), pages 772-774, 2006.
39. A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven Web services. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 90-99, 2006.
40. E. A. Emerson. Temporal and modal logic. In J. V. Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 995-1072. North-Holland Pub. Co./MIT Press, 1990.
41. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about knowledge. MIT Press, 1996.
42. M. F. Fernández, D. Florescu, A. Y. Levy, and D. Suciu. Declarative specification of web sites with Strudel. VLDB Journal, 9(1):38-55, 2000.
43. D. Florescu, K. Yagoub, P. Valduriez, and V. Issarny. WEAVE: A data-intensive web site management system (software demonstration). In Proc. of the Conf. on Extending Database Technology (EDBT), 2000.
44. J. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, pages 249-307. Reidel, 1977.
45. D. Georgakopoulos, M. F. Hornick, and A. P. Sheth. An overview of workflow management: From process modeling to workflow automation infrastructure. Distributed and Parallel Databases, 3(2):119-153, 1995.
46. D. Harel. On the formal semantics of Statecharts. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 54-64, 1987.
47. D. Harel. Statecharts: A visual formulation for complex systems. Sci. Comput. Program, 8(3):231-274, 1987.
48. G. Hughes and M. Cresswell. An introduction to modal logic. Methuen, 1968.
49. R. Hull, M. Benedikt, V. Christophides, and J. Su. E-services: a look behind the curtain. In Proc. ACM Symp. on Principles of Database Systems (PODS), pages 1-14, 2003.
50. R. Hull and J. Su. Tools for design of composite web services. In Proc. ACM SIGMOD Int'l. Conf. on Management of Data (SIGMOD), pages 958-961, 2004.
51. M. Jurdzinski and R. Lazić. Alternation-free modal mu-calculus for data trees. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 131-140, 2007.
52. O. Kupferman and M. Vardi. Synthesizing distributed systems. In Proc. IEEE Conf. on Logic in Computer Science (LICS), 2001.
53. R. Lazić, T. Newcomb, J. Ouaknine, A. Roscoe, and J. Worrell. Nets with tokens which carry data. In ICATPN'07, volume 4546 of Lecture Notes in Computer Science, pages 301-320. Springer, 2007.
54. G. Mecca, P. Merialdo, and P. Atzeni. Araneus in the era of XML. IEEE Data Engineering Bulletin, 22(3):19-26, 1999.
55. S. Merz. Model checking: a tutorial overview. In Modeling and verification of parallel processes. Springer-Verlag New York, 2001.
56. R. Milner. Communicating and mobile systems: the π calculus. Cambridge University Press, 1999.
57. W. Mok and D. Paper. Using harel's Statecharts to model business workflows. J. of Database Management, 13(3): 17-34, 2002.
58. F. Neven, T. Schwentick, and V. Vianu. Finite State Machines for Strings Over Infinite Alphabets. ACM Transactions on Computational Logic, 5(3):403-435, 2004.
59. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. IEEE Symp. on Foundations of Computer Science (FOGS), 1990.
60. E. L. Post. Recursive unsolvability of a problem of Thue. J. of Symbolic Logic, 12:1-11, 1947.
61. R. Reiter. Knowledge in action: logical foundations for specifying and implementing dynamical systems. MIT Press, 2001.
62. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. J. of the ACM, 32:733-749, 1985.
63. A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
64. M. Spielmann. Verification of relational transducers for electronic commerce. Journal of Computer and System Sciences (JCSS), 66(1):40-65, 2003. Extended abstract in PODS 2000.
65. B. Trankhtenbrot. The impossibility of an algorithm for the decision problem for finite models. Doklady Academii Nauk SSSR, 70:569-572, 1950.
66. W. M. P. van der Aalst. The application of petri nets to workflow management. Journal of Circuits, Systems, and Computers, 8(1):21-66, 1998.
67. W. M. P. van der Aalst and A. H. M. ter Hofstede. Workflow patterns: On the expressive power of (petri-net-based) workflow languages. In Proc. of the Fourth International Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, August 28-30, 2002/Kurt Jensen (Ed.), pages 1-20. Technical Report DAIMI PB-560, Aug. 2002. InternalNote: Submitted by: hr available online: http://www.daimi.aau.dk/CPnets/workshop02/cpn/papers/.
68. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 332-344, 1986.
69. D. Wodtke and G. Weikum. A formal foundation for distributed workflow execution based on state charts. In Proc, of Intl. Conf. on Database Theory (ICDT), pages 231-246, 1997.
70. Workflow management coalition, 2001. http://www.wfmc.org.
71. Web Services Flow Language(WSFL 1.0), 2001. http://www-3.ibm.com/ software/solutions/webservices/pdf/WSFL.pdf.