Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
SHAPE ANALYSIS WITH INDUCTIVE RECURSION SYNTHESIS
 

Summary: SHAPE ANALYSIS WITH INDUCTIVE
RECURSION SYNTHESIS
BOLEI GUO
A DISSERTATION
PRESENTED TO THE FACULTY
OF PRINCETON UNIVERSITY
IN CANDIDACY FOR THE DEGREE
OF DOCTOR OF PHILOSOPHY
RECOMMENDED FOR ACCEPTANCE
BY THE DEPARTMENT OF
COMPUTER SCIENCE
ADVISOR: DAVID I. AUGUST
JUNE 2008
c Copyright by Bolei Guo, 2008. All rights reserved.
iii
Abstract
For program optimization and verification purposes, shape analysis can be used to stati-
cally determine structural properties of the runtime heap. One promising formalism for
describing heap is separation logic, with recursively defined predicates that allow for
concise yet precise summarization of linked data structures. A major challenge in this

  

Source: August, David - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences