First Page | Document Content | |
---|---|---|
Date: 2014-05-24 11:45:01Formal methods Electronic design automation Logic in computer science NP-complete problems Model theory Function Boolean satisfiability problem Structure Parameter Mathematics Theoretical computer science Mathematical logic | Symbolic Resource Bound Inference for Functional Programs Ravichandhran Madhavan1 and Viktor Kuncak2 1 2Add to Reading ListSource URL: lara.epfl.chDownload Document from Source WebsiteFile Size: 393,87 KBShare Document on Facebook |