University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Proving Termination of Heap-Manipulating Java Programs

  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

Proving Termination of Heap-Manipulating Java Programs

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Automated termination analysis of imperative programs has seen great improvements in the past few years, but many of the presented methods are restricted to integer programs. To lift this restriction, we developed symbolic evaluation graphs for Java programs, a finite over-approximation of all possible program runs of heap-manipulating Java programs. The graphs are obtained by symbolic evaluation using a simple abstract domain and can serve as basis for a range of further analyses. One such use, termination analysis by a sound transformation to Integer Term Rewriting, will be discussed in detail.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Journal of Regions, Economy and Society Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon ATC Seminar rooms A&B, Addenbrooke’s

Other talks

Group Work Title and abstract tba Talk TBC Cooperation for Nature Group Presentation 5 Harnessing Radical Reactivity for Molecular Innovation
 

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