Static provenance verification for message passing programs

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

Volumn 7935 LNCS, Issue , 2013, Pages 366-387

  Majumdar, Rupak ^a   Meyer, Roland ^b   Wang, Zilong ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROCESS; CONCURRENT PROGRAM; JAVASCRIPT; MESSAGE PASSING PROGRAMS; PROGRAM EXECUTION; THEORETICAL COMPLEXITY; USER INFORMATION; VERIFICATION PROBLEMS;

COMPUTABILITY AND DECIDABILITY;

STATIC ANALYSIS;

EID: 84884491880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38856-9_20     Document Type: Conference Paper

References (27)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321. IEEE (1996)
2. Barth, A., Mitchell, J., Datta, A., Sundaram, S.: Privacy and utility in business processes. In: CSF, pp. 279-294. IEEE (2007)
3. Buneman, P., Khanna, S., Tan, W.-C.: Why and where: A characterization of data provenance. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 316-330. Springer, Heidelberg (2000)
4. Chaki, S., Rajamani, S., Rehof, J.: Types as models: model checking message-passing programs. In: POPL, pp. 45-57. ACM (2002)
5. Cheney, J., Ahmed, A., Acar, U.: Provenance as dependency analysis. Math. Struct. in Computer Science 21, 1301-1337 (2011)
6. Cui, Y., Widom, J., Wiener, J.: Tracing the lineage of view data in a warehousing environment. ACM TODS 25, 179-227 (2000)
7. Durak, B.: JSure, https://github.com/berke/jsure
8. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
9. Ganty, P., Raskin, J.-F., Begin, L.V.: From many places to few: Automatic abstraction refinement for Petri nets. Fund. Informaticae 88(3), 275-305 (2008)
10. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: new algorithms for the coverability problem of WSTS. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 287-298. Springer, Heidelberg (2004) (Pubitemid 39740231)
11. Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)
12. Green, T., Karvounarakis, G., Tannen, V.: Provenance semirings. In: PODS, pp. 31-40. ACM (2007)
13. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc (3) 2, 326-336 (1952)
14. Holzmann, G.: The Spin model checker. IEEE Transactions on Software Engineering 23(5), 279-295 (1997)
15. Huang, Y.-W., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T., Kuo, S.-Y.: Securing web application code by static analysis and runtime protection. In: WWW, pp. 40-52 (2004)
16. Janák, J.: Issue tracking systems. Diplomová práce, Masarykova univerzita, Fakulta informatiky (2009)
17. Jhala, R., Majumdar, R.: Interprocedural analysis of asynchronous programs. In: POPL 2007, pp. 339-350. ACM (2007)
18. Lipton, R.: The reachability problem is exponential-space hard. Technical Report 62, Department of Computer Science, Yale University (1976)
19. Livshits, B., Lam, M.: Finding security errors in Java programs with static analysis. In: Usenix Security Symposium, pp. 271-286 (2005)
20. Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested Petri nets. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol. 1755, pp. 208-220. Springer, Heidelberg (2000)
21. Meyer, R., Strazny, T.: Petruchio: From dynamic networks to nets. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 175-179. Springer, Heidelberg (2010)
22. Minsky, M.: Finite and Infinite Machines. Prentice-Hall (1967)
23. Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0, 1, ∞)-counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 107-122. Springer, Heidelberg (2002)
24. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science 6(2), 223-231 (1978)
25. Sabelfeld, A., Myers, A.: Language-based information-flow security. IEEE J. Selected Areas in Communications 21, 5-19 (2003)
26. Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)
27. Souilah, I., Francalanza, A., Sassone, V.: A formal model of provenance in distributed systems. In: Workshop on the Theory and Practice of Provenance (2009)