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

	1 Abstract state machines as a tool for history of logic Wilfrid Hodges DocID: 1uXj3 - View Document
	The Power of One-State Turing Machines Marzio De Biasi Jan 15, 2018 Abstract At first glance, one–state Turing machines are very weak: the Halting problem for them is decidable, and, without memory, they cannot even ac DocID: 1ucEA - View Document
	The engineering of generic requirements for failure management Colin Snook1, Michael Poppleton1, and Ian Johnson2 1 School of Electronics and Computer Science, DocID: 1qFsg - View Document
	The engineering of generic requirements for failure management Colin Snook1, Michael Poppleton1, and Ian Johnson2 1 School of Electronics and Computer Science, DocID: 1qtY5 - View Document