Detecting and debugging insecure information flows

Proceedings - International Symposium on Software Reliability Engineering, ISSRE

Volumn , Issue , 2004, Pages 198-209

  Masri, Wes ^a   Podgurski, Andy ^a   Leon, David ^a  

^a Case Western Reserve University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODE CONVERTERS; COMPUTER SOFTWARE; DEMODULATION; INFORMATION ANALYSIS; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; SECURITY OF DATA; SOFTWARE PROTOTYPING;

DYNAMIC INFORMATION FLOW ANALYSIS (DIFA); INFORMATION FLOW POLICY; INSECURE INFORMATION FLOWS; JAVA BYTE CODE PROGRAMS;

PROGRAM DEBUGGING;

EID: 16244362392     PISSN: 10719458     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Agesen O. Constraint-Based Type Inference and Parametric Polymorphism. First International Static Analysis Symposium, SAS'94.
2. Agrawal H. and Horgan J. Dynamic Program Slicing. SIGPLAN Notices, 25(6), pp. 246-256, June 1990.
3. Agrawal H., Horgan J., Krauser E., London S. Incremental Regression Testing. Proceedings of the IEEE Conference on Software Maintenance (Montreal, Canada, 1993).
4. Beszedes, A., Gergely, T., Szabó, Z.M., Csirik, J., and Gyimothy, T. Dynamic Slicing Method for Maintenance of Large C Programs. 5th European Conference on Software Maintenance and Re-engineering (Lisbon, Portugal, March 2001).
5. Denning D. E. A Lattice Model of Secure Information Flow. Comm. ACM, Vol. 19, No. 5 (May 1976), 236-242.
6. Denning D.E. and Denning P.J. Certification of programs for secure information flow. Communication of the ACM 20, 7 (1977), 504-513.
7. Denning, D.E. Secure information flow in computer systems. Ph.D. Thesis, Computer Science Dept., Purdue U., W. Lafayette, Ind., May 1975.
8. Faragó C. and Gergely T. Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm. Acta Cybernetica 15 (2002), 489-508.
9. Fenton, J.S. Memoryless Subsystems. The Computer Journal 17, 2 (1974), 143-147.
10. Ferrante J., Ottenstein K.J., and Warren J.D.. The Program Dependence Graph and its Use in Optimization. ACM Transactions on Programming Languages and Systems 9, 3 (October 1987), 319-349.
11. th European Software Engineering Coinference, pages 303-321. (Toulouse, France, September 1999).
12. Hind M. and Pioli A. Which Pointer Analysis Should I Use? International Symposium on Software Testing and Analysis 2000.
13. Jones, A. and Lipton, R. The Enforcement of Security Policies for Computation. Journal of Computer and Systems Sciences (1978).
14. Korel B. Computation of Dynamic Program Slices for Unstructured Programs. IEEE TSE, 23 (1), (1997), 17-34.
15. th Annual Hawaii International Conference on System Sciences, Volume II, pages 246-251 (1991)
16. Korel B. and Laski J. Dynamic Program Slicing. Information Processing Letters 29 (October 1988), 155-163.
17. Korel B. and Yalamanchili S. Forward Computation of Dynamic Program Slices. ISSTA (1994), 66-79.
18. Lampson, B.W. A Note on the Confinement Problem. Communication of the ACM 16, 10 (Oct. 1973), 613-615.
19. Masri, W., Podgurski, A., and Leon, D. Detecting and Debugging Insecure Information Flows, (extended version). Tech. Rep., http://softlab4.cwru.edu/if/index.html.
20. Masri, W. Dynamic information flow analysis, slicing, and profiling, http://softlab4.cwru.edu/if/index.html.
21. McClure S., Shah S. and Shah S. Web Hacking: Attacks and Defense. Addison-Wesley Pub. Co. (2003).
22. Podgurski A. and Clarke L. A Formal Model of Program Dependencies and its Implications for Software Testing, Debugging, and Maintenance. IEEE TSE, 16(9):965-979, September 1990.
23. Podgurski A. Significance of program dependences for software testing, debugging and maintenance. Ph.D. Thesis. Computer Sc. Dept., U. of Mass., (Sept. 1989).
24. Sabelfeld A. and Myers A.C. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communications, 21(1), Jan. 2003.
25. Sinha S., Harrold M. J. and Rothermel G. Interprocedural Control Dependence. ACM Transactions on Software Engineering and Methodology, (2000).
26. Soot: a Java Optimization Framework. http://www.sable.mcgill.ca/soot.
27. The Byte Code Engineering Library (BCEL), The Apache Jakarta Project, http://jakarta.apache.org/bcel. Apache Software Foundation 2003.
28. Tip F. A survey of program slicing techniques, Journal of Programming Languages 3(3), (1995), 121-189.
29. Wang T. and Roychoudhury A. Using Compressed Bytecode Traces for Slicing Java Programs. Intl. Conf. on Software Engineering (Edinburgh, UK, May 2004).
30. Weiser M. Program Slicing. IEEE Transactions On Software Engineering 10, 4 (1984), 352-357.
31. Wolfe M. High Performance Compilers for Parallel Computing. Addison-Wesley Pub. Co. (1996).
32. Zhang X., Gupta R. and Zhang Y. Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams. Intl. Conf. on Software Engineering (Edinburgh, UK, May 2004).