Generating Programs plus Proofs by Refinement Douglas R. Smith Kestrel Institute, Palo Alto, CaliforniaUSA 1

First Page		Document Content
Date: 2012-08-02 20:27:15 Formal methods Computing Software engineering Theoretical computer science Specification language Refinement Abstract state machines Domain-specific language Specification Programming language Integrated circuit design Formal specification		Generating Programs plus Proofs by Refinement Douglas R. Smith Kestrel Institute, Palo Alto, CaliforniaUSA 1 Add to Reading List Source URL: www.kestrel.edu Download Document from Source Website File Size: 95,13 KB Share Document on Facebook

	Counterexample-guided Refinement of Template Polyhedra Sergiy Bogomolov12, Goran Frehse3, Mirco Giacobbe2, and Thomas A. Henzinger2 1 3 DocID: 1xW2M - View Document
	What is iterative refinement How to use iterative refinement to verify a computed result? Influence of the computing precision Conclusion and future work Iterative refinement: DocID: 1xVjn - View Document
	Generating Programs plus Proofs by Refinement Douglas R. Smith Kestrel Institute, Palo Alto, CaliforniaUSA 1 DocID: 1xViA - View Document
	Abstraction Refinement for Probabilistic Software Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. We present a methodolog DocID: 1xV7t - View Document
	A Refinement Approach to Visualization* Allen Goldberg Rafael Furst Cordell Green Kestrel Institute 3260 Hillview Ave DocID: 1xUT9 - View Document