|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Proving Termination of Heap-Manipulating Java Programs
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 listsCambridge University Somali Society (CUSOMSOC) Mordell Lectures Number Theory Study Group: Langlands correspondence
Other talksAutumn Cactus & Succulent Show Antibiotic resistance and antibiotic alternatives: Looking towards the future Friction experiments and modelling for vibration-induced oscillation problems Injecting Logical Background Knowledge into Embeddings for Relation Extraction The Longest Afternoon: How 400 Germans Turned the Tide at Waterloo Harnessing the Power of Non-Covalent Interactions for Organocatalysis