Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document?

First Page		Document Content
Date: 2016-04-05 02:15:07 Formal methods Theoretical computer science Software engineering Mathematics Hoare logic Static program analysis Algorithm Precondition Predicate transformer semantics Loop invariant		Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document? Add to Reading List Source URL: www.gogognome.nl Download Document from Source Website File Size: 750,20 KB Share Document on Facebook

	Replayer: Automatic Protocol Replay by Binary Analysis James Newsome, David Brumley, Jason Franklin, Dawn Song∗ Carnegie Mellon University Pittsburgh, PA, USA {jnewsome, DocID: 1rkyH - View Document
	Automatic Refinement Checking for B? Michael Leuschel1,2 and Michael Butler1 1 2 DocID: 1r9D8 - View Document
	UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/13/23 DocID: 1qWVH - View Document
	Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document? DocID: 1qWor - View Document
	Towards Automatic Discovery of Deviations in Binary Implementations with Applications to Error Detection and Fingerprint Generation David Brumley, Juan Caballero, Zhenkai Liang, James Newsome, Dawn Song Carnegie Mellon U DocID: 1qDKO - View Document