Scheduling and SAT Emmanuel Hebrard Toulouse Outline

First Page		Document Content
Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory		Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Download Document from Source Website File Size: 520,25 KB Share Document on Facebook

	Executable Counterexamples in Software Model Checking J. Gennari1 and A. Gurfinkel2 and T. Kahsai3 and J. A. Navas4 and E. J. Schwartz1 Presenter: Natarajan Shankar4 1 Carnegie DocID: 1xVWH - View Document
	Increasing Usability of Spin-based C Code Verification Using a Harness Definition Language Leveraging Model-driven Code Checking to Practitioners Daniel Ratiu Andreas Ulrich DocID: 1xVPm - View Document
	Stochastic Model Checking? Marta Kwiatkowska, Gethin Norman, and David Parker School of Computer Science, University of Birmingham Edgbaston, Birmingham B15 2TT, United Kingdom Abstract. This tutorial presents an overvi DocID: 1xVOF - View Document
	Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s DocID: 1xVMq - View Document
	Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice∗ Marta Kwiatkowska University of Oxford DocID: 1xVM0 - View Document