Uninformed: Informative Information for the Uninformed

Vol 8» 2007.Sep


Atkinson, Griswold. Implementation Techniques for Efficient Data-flow Analysis of Large Programs.
Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01). 2001. http://www.cse.scu.edu/~atkinson/papers/icsm-01.ps

Das, M. Static Analysis of Large Programs: Some Experiences
2000. http://research.microsoft.com/manuvir/Talks/pepm00.ppt

Das, M., Lerner, S., Seigle, M. ESP: Path-Sensitive Program Verification in Polynomial Time.
Proceedings of the SIGPLAN 2002 Conference on programming language design. 2002. http://www.cs.cornell.edu/courses/cs711/2005fa/papers/dls-pldi02.pdf

Das, M., Fahndrich, M., Rehof, J. From Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints. 2000. http://research.microsoft.com/research/pubs/view.aspx?msr_tr_id=MSR-TR-99-84

Dinakar Dhurjati1, Manuvir Das, and Yue Yang. Path-Sensitive Dataflow Analysis with Iterative Refinement. SAS'06: The 13th International Static Analysis Symposium, Seoul, August 2006.

Erikson, Manocha. Simplification Culling of Static and Dynamic Scene Graphs.
TR9809-009 by University of North Carolina at Chapel Hill. 1998. citeseer.ist.psu.edu/erikson98simplification.html

Horwitz, S., Reps, T., and Binkley, D., Interprocedural slicing using dependence graphs. In Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23, 7 (July 1988), pp. 35-46.

Horwitz, S., Reps, T., and Binkley, D., Retrospective: Interprocedural slicing using dependence graphs. 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979 - 1999): A Selection, K.S. McKinley, ed., ACM SIGPLAN Notices 39, 4 (April 2004), 229-231.

Gregor, D., Schupp, S. Retaining Path-Sensitive Relations across Control Flow Merges. Technical report 03-15, Rensselaer Polytechnic Institute, November 2003. http://www.cs.rpi.edu/research/ps/03-15.ps

Kiss, Ja´sz, Lehotai, Gyimo´thy. Interprocedural Static Slicing of Binary Executables.

Microsoft Corporation. Phoenix Framework. http://research.microsoft.com/phoenix/

Naumovich, G., Avrunin, G. S., and Clarke, L. A. 1999. Data flow analysis for checking properties of concurrent Java programs. In Proceedings of the 21st international Conference on Software Engineering (Los Angeles, California, United States, May 16 - 22, 1999). International Conference on Software Engineering. IEEE Computer Society Press, Los Alamitos, CA, 399-410.

Reps, T., Horwitz, S., and Sagiv, M., Precise interprocedural dataflow analysis via graph reachability. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, (San Francisco, CA, Jan. 23-25, 1995), pp. 49-61.

Reps, T., Sagiv, M., and Horwitz S., Interprocedural dataflow analysis via graph reachability. TR 94-14, Datalogisk Institut, University of Copenhagen, Copenhagen, Denmark, April 1994.

A. Rountev, B. G. Ryder, and W. Landi. Dataflow analysis of program fragments. In Proc. Symp. Foundations of Software Engineering, LNCS 1687, pages 235-252, 1999. http://citeseer.ist.psu.edu/rountev99dataflow.html

Schultes, Dominik. Fast and Exact Shortest Path Queries Using Highway Hierachies. 2005. http://algo2.iti.uka.de/schultes/hwy/hwyHierarchies.pdf