Deciding Unbounded Heaps in an SMT Framework Zvonimir Rakamarić 1 , Roberto Bruttomesso 2 , Alan Hu 1 , Alessandro Cimatti 2 1 University of British Columbia; 2 ITCIRST

First Page		Document Content
Date: 2007-07-09 10:11:38 Theoretical computer science Mathematics Computational complexity theory Constraint programming Electronic design automation Logic in computer science Satisfiability modulo theories Heap FO Transitive closure		Deciding Unbounded Heaps in an SMT Framework Zvonimir Rakamarić 1 , Roberto Bruttomesso 2 , Alan Hu 1 , Alessandro Cimatti 2 1 University of British Columbia; 2 ITCIRST Add to Reading List Source URL: www.lsi.upc.edu Download Document from Source Website File Size: 391,84 KB Share Document on Facebook