User-input dependence analysis via graph reachability

Proceedings - 8th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2008

Volumn , Issue , 2008, Pages 25-34

  Scholz, Bernhard ^a,b   Zhang, Chenyi ^a   Cifuentes, Cristina ^a  

^a SUN MICROSYSTEMS   (United States)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); PROGRAM DEBUGGING;

COMMERCIAL SOFTWARES; CONTROL DEPENDENCIES; DEPENDENCE ANALYSIS; EQUATION SYSTEMS; FAST ALGORITHMS; FORMAL DEFINITIONS; LINES OF CODES; PRE-PROCESSING; PROGRAM ANALYSIS; REACH ABILITIES; REACHABILITY PROBLEMS; SECURITY VULNERABILITIES; SENSITIVE ANALYSIS; SOFTWARE BUGS; STATIC PROGRAM ANALYSIS; STATIC SINGLE ASSIGNMENTS;

DATA FLOW ANALYSIS;

EID: 56349145159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2008.22     Document Type: Conference Paper

References (30)

1. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. of the Symp. on Princ. of Prog. Lang., pages 1-3, January 2002.
2. D. E. Bell and L. J. LaPadula. Secure computer system: Unified exposition and multics interpretation. Technical Report MTR-2997 Rev. 1, The MITRE Corporation, Bedford, MA 01730. March 1976.
3. W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic prog. errors. Software-Practice & Experience, 30:775-802, 2000.
4. T. Christiansen. Perl security. http://www.perl.com/doc/manual/html/pod/ perlsec.html Taint module available November 1997.
5. C. Cifuentes and B. Scholz. Parfait - designing a scalable bug checker. In Proceedings of the ACM SIGPLAN Static Analysis Workshop, 12 June 2008.
6. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Program. Lang. and Syst., 13(4):451-490. October 1991.
7. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Proc. of the Conf. on Prog. Lang. Design and Impl., June 2002.
8. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, July 1997.
9. A. Deutsch. Static verification of dynamic properties. PolySpace White Paper.
10. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific programmer-written compiler extensions. In Proc. of the Symp. on Operat. Syst. Design and Impl., pages 23-25, Oct. 2000.
11. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. on Prog. Lang. and Syst., 9(3):319-349, Jul. 1987.
12. J. Foster, M. Fahndrich, and A. Aiken. A theory of type qualifiers. In In Proc. of the Conf. on Prog. Lang. Design and Impl., pages 192-203, 1999.
13. C. Hammer, J. Krinke, and G. Snelting. Information flow control for Java based on path conditions in dependence graphs. In Proc. of the Int. Symp. on Secure Software Engineering, 2006.
14. B. Herlihy, P. Schachte, and H. Sondergaard. Un-kleene boolean equation solver. International Journal on Foundations of Computer Science, 18(2):227-250, 2007.
15. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2 edition, 2000.
16. J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. J. ACM, 23(1): 158-171, 1976.
17. C. Lattner and V. Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO'04), Palo Alto, California, March 2004.
18. D. Moore, V. Paxson, S. Savage, C. Shannon, S. Stamford, and N. Weaver. Inside the Slammer Worm. IEEE Security and Privacy, 1(4):33-39, 2003.
19. K. J. Ottenstein, R. A. Ballance, and A. B. MacCabe. The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proc. of the conf. on Prog. Lang. Design and Impl., pages 257-271, 1990.
20. M. Pistoia, R. J. Flynn, L. Koved, and V. C. Sreedhar. Interprocedural analysis for privileged code placement and tainted variable detection. In Proc. of the European Conf. on Object-Oriented Prog., pages 362-386, July 2005.
21. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the Symp. on Princ. of Prog. Lang., pages 49-61, 1995.
22. A. Sabelfeld and A. C. Myers. Language-based informationflow security. IEEE Journal on Selected Areas in Communications, 21(1): 1-15, January 2003.
23. B. Scholz, C. Zhang, and C. Cifuentes. User-input dependence analysis via graph reachability. Technical Report SMLl TR-2008-171, Sun Microsystems Laboratories, 16 Network Circle, Menlo Park, CA 94025, March 2008.
24. G. Snelting, T. Robschink, and J. Krinke. Efficient path conditions in dependence graphs for software safety analysis. ACM Trans. on Softw. Eng. and Meth., 15(4):410-457, October 2006.
25. R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981.
26. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3(3):121-189, September 1995.
27. P. Tu and D. Padua. Efficient building and placing of gating functions. In Proc. of the Conf. on Prog. Lang. Design and Impl., pages 47-55, 1995.
28. US-CERT. Vulnerability Note VU#881872, Sun Solaris telnet authentication bypass vulnerability. http://www.kb.cert.org/vuls/id/881872.
29. G. Wassermann and Z. Su. Sound and precise analysis of web applications for injec-tion vulnerabilities. In Proc. of the Conf. on Prog. Lang. Design and Impl., 2007.
30. M. Weiss. The transitive closure of control dependence: the iterated join. ACM Lett. Program. Lang. Syst., 1(2): 178-190, 1992.