Introduction Applications SMT Solver Use Algorithms Conclusion

First Page		Document Content
Date: 2012-01-31 09:21:20 Theoretical computer science Logic in computer science Formal methods Mathematics Electronic design automation NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Solver Formal verification Model checking SMT		Introduction Applications SMT Solver Use Algorithms Conclusion Add to Reading List Source URL: user.it.uu.se Download Document from Source Website File Size: 398,20 KB Share Document on Facebook

	Model-Based API Testing for SMT Solvers∗ Aina Niemetz, Mathias Preiner, and Armin Biere Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria Abstract DocID: 1xVj1 - View Document
	Randomized Differential Testing as a Prelude to Formal Verification Alex Groce, Gerard Holzmann, and Rajeev Joshi Laboratory for Reliable Software ∗ Jet Propulsion Laboratory California Institute of Technology Pasadena DocID: 1xVf0 - 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
	Verification of Annotated Models from Executions ABSTRACT Simulations can help enhance confidence in system designs but they provide almost no formal guarantees. In this paper, we present a simulation-based verification DocID: 1xTNp - View Document
	Verifiable Autonomy Michael Fisher University of Liverpool, 11th September 2015 Formal Verification DocID: 1xTyY - View Document