<--- 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

On the Positive Calculus of Relations with Transitive Closure Damien Pous Univ. Lyon, CNRS, ENS de Lyon, UCB Lyon 1, LIP

DocID: 1ud5Z - View Document

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms Chan Le Duc1 and Myr

DocID: 1tgOq - View Document

Size-Estimation Framework with Applications to Transitive Closure and Reachability∗ Edith Cohen AT&T Bell Laboratories Murray Hill, NJ 07974

DocID: 1t0SI - View Document

An Agda Formalisation of the Transitive Closure of Block Matrices (Extended Abstract) Adam Sandberg Eriksson Patrik Jansson

DocID: 1sTbz - View Document

Data management / Record linkage / Crowdsourcing / Transitive closure / Data analysis / Mathematics / Science and technology / Academia

Microsoft PowerPoint - IEEEBigData2013V5.ppt [Compatibility Mode]

DocID: 1rjlX - View Document