Programming Languages Reading Group

Fall 2004

Meet Wednesday 10:30-12:00 Location 4549 BH

Topic This quarter we study the heap. Specifically, we shall study papers on TVLA and shape analysis.

Calendar

Possible Papers

1. Chandra, S. and Reps, T., Physical type checking for C. In Proc. of PASTE '99: SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, (Toulouse, France, Sept. 6, 1999). ACM SIGSOFT Software Engineering Notes 24, 5 (Sept. 1999), pp. 66-75.

2. Sagiv, M., Reps, T., and Wilhelm, R., Parametric shape analysis via 3-valued logic. In ACM Transactions on Programming Languages and Systems 24, 3 (2002), 217-298

3. Yorsh, G., Reps, T., and Sagiv, M., Symbolically computing most-precise abstract operations for shape analysis. In Proc. TACAS, Springer-Verlag, New York, NY, 2004, 530-545.

and

Reps, T., Sagiv, M., and Yorsh, G., Symbolic implementation of the best transformer. In Proc. Verification, Model Checking, and Abstract Interpretation, 2004, 252-266.

4. Reps, T., Loginov, A., and Sagiv, M., Semantic minimization of 3-valued propositional formulae. In Proc. IEEE Symp. on Logic in Computer Science, (Copenhagen, Denmark, July 22-25, 2002), pp. 40-54.

and

Reps, T., Sagiv, M., and Loginov, A., Finite differencing of logical formulas for static analysis. In Proc. European Symp. on Programming, Lecture Notes in Computer Science, Vol. 2618, Springer-Verlag, New York, NY, 2003, pp. 380-398.

5. Balakrishnan, G. and Reps, T. Analyzing memory accesses in x86 executables. In Proc. Int. Conf. on Compiler Construction, Springer-Verlag, New York, NY, 2004, 5-23. (Awarded the EAPLS Best Paper Award at ETAPS 2004.)

6. Jeannet, B., Loginov, A., Reps, T., and Sagiv, M., A relational approach to interprocedural shape analysis. In Proc. 11th Int. Static Analysis Symp., Lecture Notes in Computer Science, Springer-Verlag, New York, NY, 2004.

7. Gopan, D., Reps, T., and Sagiv, M., Numeric analysis of array operations. To appear in Conference Record of the Thirty-Second ACM Symposium on Principles of Programming Languages, (Long Beach, CA, Jan. 12-14, 2005). [Technical report: abstract; PDF]

8. Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., and Wilhelm, R., A semantics for procedure local heaps and its abstractions. To appear in Conference Record of the Thirty-Second ACM Symposium on Principles of Programming Languages, (Long Beach, CA, Jan. 12-14, 2005).

Other papers (For future quarters?)

Chase and Wegman

Hoare 1972

Anders Moller and Michael Schwarzbach. PALE.

Graph Types

Ownership types work by Chandra Boyapati

Linear types, alias types (my knowledge here is scant :) )

Vault papers and their usage of linearity.

Separation Logic

Date	Topic	Presenter	Comments
Oct 20	1. Todd’s OOPSLA talk on Practical Predicate Dispatch 2. Jens’ overview of alias analysis, based on Whaley and Lam PLDI 2004	Todd Jens	Also read Mike Hinds’ overview of the field
Oct 27	· Overview of Shape Analysis (Tom Reps, CAV 2004, and the Powerpoint slides) · Sagiv, M., Reps, T., and Wilhelm, R., Parametric shape analysis via 3-valued logic. In ACM Transactions on Programming Languages and Systems 24, 3 (2002), 217-298.	Shane	This is a long paper. Let’s start next week, and continue the following week.
Nov 3	Jeff presented the Parametric shape analysis paper	Jeff
Nov 10	No meeting
Nov 17	· Reps, T., Sagiv, M., and Yorsh, G., Symbolic implementation of the best transformer. In Proc. Verification, Model Checking, and Abstract Interpretation, 2004, 252-266. · Yorsh, G., Reps, T., and Sagiv, M., Symbolically computing most-precise abstract operations for shape analysis. In Proc. TACAS, Springer-Verlag, New York, NY, 2004, 530-545.	Rupak
Nov 24	A couple of papers that use heap analysis while checking safety properties 1. Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., Sagiv M.: Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94 pldi02.pdf 2. Dor, N., Rodeh, M., and Sagiv M.: CSSV: Towards a Realistic Tool for Statically Detecting All Buffer Overflows in C cssv.pdf cssv.ps	Krishna and Manav	Not very deep, you should be able to read these quickly!
Dec 1	A classic paper by Tony Hoare on data structure representations.	Mike and Alex
Dec 8	Gopan, D., Reps, T., and Sagiv, M., Numeric analysis of array operations. To appear in Conference Record of the Thirty-Second ACM Symposium on Principles of Programming Languages, (Long Beach, CA, Jan. 12-14, 2005).	Fernando	Available from Tom Reps’ page. Shows how ideas of canonical abstraction can be applied to other general safety properties and programs.