University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > jStar: Towards Practical Verification for Java

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

jStar: Towards Practical Verification for Java

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Register in advance for a Zoom seminar, as outlined above Hangouts Meet (Link provided via e-mail) Seminar Room, Centre for Animal Welfare & Anthrozoology, Department of Veterinary Medicine, Madingley Road, Cambridge

Other talks

Title to be confirmed Title to be confirmed Morning Break Rothschild Public Lecture: Forty years of causal inference: Report of a great-grandfather Cooperation in Nature title abstract tbc
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity