CS 170 Algorithms Spring 2009

First Page		Document Content
Date: 2009-05-04 23:56:17 Complexity classes NP-complete problems Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Conjunctive normal form NP-complete Canonical form Theoretical computer science Mathematics Applied mathematics		CS 170 Algorithms Spring 2009 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Download Document from Source Website File Size: 99,50 KB Share Document on Facebook

	Alloy as an Introduction to Formal Methods DocID: 1xVY1 - View Document
	Integrated Formal Methods DocID: 1xVBb - View Document
	Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University DocID: 1xUHE - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister DocID: 1xUCm - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xUrV - View Document