ACM Home Page
Please provide us with feedback. Feedback
Automatic verification of database-driven systems: a new frontier
Full text PdfPdf (404 KB)
Source ACM International Conference Proceeding Series; Vol. 361 archive
Proceedings of the 12th International Conference on Database Theory table of contents
St. Petersburg, Russia
SESSION: Invited papers table of contents
Pages 1-13  
Year of Publication: 2009
ISBN:978-1-60558-423-2
Author
Victor Vianu  U.C. San Diego, La Jolla, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 110,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1514894.1514896
What is a DOI?

ABSTRACT

We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantees of success, it identifies restricted but reasonably expressive classes of applications and properties for which sound and complete verification can be performed in a fully automatic way. This leverages the emergence of high-level specification tools for database-centered applications that not only allow fast prototyping and improved programmer productivity but, as a side effect, provide convenient targets for automatic verification. We present theoretical and practical results on verification of database-driven systems. The results are quite encouraging and suggest that, unlike arbitrary software systems, significant classes of database-driven systems may be amenable to automatic verification. This relies on a novel marriage of database and model checking techniques, of relevance to both the database and the computer aided verification communities.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
5
 
6
 
7
 
8
 
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
 
15
 
16
 
17
 
18
 
19
A. Bouajjani, Y. Jurski, and M. Sighireanu. A generic framework for reasoning about dynamic networks of infinite-state processes. In TACAS'07, volume 4424 of Lecture Notes in Computer Science, pages 690--705. Springer, 2007.
 
20
 
21
 
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
25
 
26
O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification of infinite structures. In Handbook of Process Algebra, pages 545--623. Elsevier Science, 2001.
 
27
 
28
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
 
29
 
30
31
 
32
 
33
S. Demri, R. Lazić, 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
35
36
 
37
38
39
 
40
 
41
 
42
 
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
 
46
D. Harel. On the formal semantics of statecharts. In Proc. IEEE Conf. on Logic in Computer Science (LICS), pages 54--64, 1987.
 
47
 
48
G. Hughes and M. Cresswell. An introduction to modal logic. Methuen, 1968.
49
50
 
51
 
52
 
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
 
56
 
57
W. Mok and D. Paper. Using harel's statecharts to model business workflows. J. of Database Management, 13(3):17--34, 2002.
58
 
59
 
60
E. L. Post. Recursive unsolvability of a problem of Thue. J. of Symbolic Logic, 12:1--11, 1947.
 
61
62
 
63
 
64
 
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
 
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.