<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Computational complexity theory / Constraint programming / Electronic design automation / Logic in computer science / Satisfiability modulo theories / Heap / FO / Transitive closure
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 ITC­IRST

Add to Reading List

Source URL: www.lsi.upc.edu

Download Document from Source Website

File Size: 391,84 KB

Share Document on Facebook

Similar Documents

Proof Procedures for Separated Heap Abstractions Josh Berdine, Cristiano Calcagno, Peter O’Hearn 1 July, 2007 (Canada day) Part 0

DocID: 1xVUM - View Document

Data types / Computing / Theoretical computer science / Software engineering / Heap / Tree / Separation logic / Variable / Parse tree / Logic programming / Linked list

Learning to Decipher the Heap for Program Verification Marc Brockschmidt1 , Yuxin Chen2 , Byron Cook3 , Pushmeet Kohli1 , Daniel Tarlow1 1 Microsoft Research 2 ETH Zurich 3 University College London

DocID: 1xUJV - View Document

PHALANX : Parallel Checking of Expressive Heap Assertions Martin Vechev

DocID: 1vrj0 - View Document

Heaps Don't Lie: Countering Unsoundness with Heap Snapshots

DocID: 1voqX - View Document

The International Nickel Study Group (INSG) Nickel Heap Leaching Study Report Available Now  Published in 2010, this is a 72-page comprehensive analysis of

DocID: 1vgou - View Document