Automatic Refinement Checking for B? Michael Leuschel1,2 and Michael Butler1 1 2

First Page		Document Content
Date: 2007-11-21 10:57:32 Software engineering Computing Formal methods Refinement FDR Model checking Prolog Algorithm Predicate transformer semantics Type system Abstract machine XSB		Automatic Refinement Checking for B? Michael Leuschel1,2 and Michael Butler1 1 2 Add to Reading List Source URL: rodin.cs.ncl.ac.uk Download Document from Source Website File Size: 229,51 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