jStar: Towards Practical Verification for Java

Add to your list(s) Download to your calendar using vCal

• Matthew Parkinson (University of Cambridge)
• Tuesday 01 December 2009, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

In this talk, we introduce a methodology for verifying some Java programs which builds on recent theoretical developments in program verification: it combines the idea of abstract predicate families and the idea of symbolic execution and abstraction using separation logic. The proposed technology has been implemented in an automatic verification system, called jStar, which combines theorem proving and abstract interpretation techniques.

I will give an overview of the tool and a demo on an example of the Visitor pattern. I will also discuss the current weaknesses of the tool and discuss future directions to address these.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.