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

LTE / Technology / Mobile technology / Wireless / Software-defined radio / Mobile telecommunications / ENodeB / System Architecture Evolution / Telecommunications / E-UTRA / User equipment / Mobility management

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document