Seminar Static Program Analysis

Summer term 2010

Dr. Claire Maiza, Jörg Herter, M.Sc., Sebastian Altmeyer, M.Sc.

News

• 15.06.2010 The remaining seminar sessions will take place in:
  • room 407, building E1.1, on June 23rd and 28th
  • room 014, building E1.3, on June 26th and July 3rd
• 03.05.2010 Exam-Registration in HISPOS for Computer Science is active from 03.05. to 20.05. Please, do not forget to register for the seminar there, as otherwise you may not be credited for the course.
• 23.04.2010 Please vote for additional time slots for seminar talks during the week at this Doodle Poll. Please ignore the concrete dates given in the poll, we are just interested in the week days (Monday, Tuesday, ...) and time slots. Also note, that we will close the poll next Friday, April 30th, if you did not vote until then, we assume you are available during all time slots.
• 12.04.2010 Dates and locations for the introductory lectures are now online (see below)
• 12.04.2010 Paper-assignment meeting on April 16th
• 24.02.2010 Kickoff meeting on April 9th

Important Dates

• 09.04.2010 Kickoff meeting at 14 ct. in Room 401, Building E1 3
• 16.04.2007 Assignment of papers at 14 ct. in Room 401, Building E1 3

Contact

The mail addresses of all tutors are linked from the title of this site.

Requirements

To pass this seminar, you have to

• be present at all seminar sessions/talks,
• give a presentation about a research paper and
• summarize this paper in about 6-10 pages.

Introductory Lectures

We offer two lectures covering the fundamentals of static program analysis. These lectures will be given on April, 22nd, from 10:00 to 11:30, in room 3.06, building E1.1, and on April 23rd, 8:30 to 10:00, in lecture hall 3, building E1.3.

Talk

As mentioned in the requirements above, each participant has to give a presentation (max. 75 minutes talk and about 15 minutes for questions) about a research paper. The language of the talk is English. You have to meet with your tutor at least 2 weeks before your talk to discuss a preliminary version of your slides, and 1 week before with a final version of your slides.

Summaries

Each participant has to write a detailed summary about the paper he/she presented in his/her talk.
Summaries may be written either in English or in German.

Summary Submission

The format of your summary should be pdf or postscript. Please submit within 2 weeks after your talk to the address of your tutor.

Topics

• Constraint Based Analysis (Chapter 3, Nielson book, 2 students)
• Constant Propagation and Interval Analysis
• Interprocedural Analysis
• Parametric Shape Analysis via 3-Valued Logic (2 students)
• Putting Static Analysis to Work for Verification: A Case Study
• Verifying Safety Properties of Concurrent Java Programs Using 3-Valued Logic
• Shape Analysis of Low-level C with Overlapping Structures
• Relational Inductive Shape Analysis
• Compositional Pointer and Escape Analysis for Java Programs
• Escape Analysis for Java
• Abstract Interpretation (2 students)
• Cache Behavior Prediction by Abstract Interpretation
• Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Low-Level Library Analysis and Summarization
• A System for Generating Static Analyzers for Machine Instructions
• Analysing Memory Resource Bounds for Low-Level Programs
• Discovering Properties about Arrays in Simple Programs
• Two Approaches to Interprocedural Analysis (2 students)
• Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs

Schedule:

Note that talks may take place later than given below. Changes will be announced on the web site.