Solving Constraints over Bit-Vectors with SAT-based Model Checking Extended Abstract Yakir Vizel1 , Alexander Nadel2 , and Sharad Malik1 2

First Page		Document Content
Date: 2017-09-02 14:08:49 Theoretical computer science Logic in computer science Formal methods Computational complexity theory Mathematics Electronic design automation NP-complete problems Constraint programming Satisfiability modulo theories Boolean satisfiability problem Z3 Solver		Solving Constraints over Bit-Vectors with SAT-based Model Checking Extended Abstract Yakir Vizel1 , Alexander Nadel2 , and Sharad Malik1 2 Add to Reading List Source URL: smt-workshop.cs.uiowa.edu Download Document from Source Website File Size: 279,80 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document