1 Annotation inference for modular checkers Cormac Flanagan, Rajeev Joshi, and K. Rustan M. Leino Compaq Systems Research Center, 130 Lytton Ave., Palo Alto, CA 94301, U.S.A.

First Page		Document Content
Date: 2010-09-11 18:26:03 Software engineering Formal methods Mathematical logic Type theory Theoretical computer science Type systems Edsger W. Dijkstra Predicate transformer semantics Extended static checking ESC/Java Type inference HindleyMilner type system		1 Annotation inference for modular checkers Cormac Flanagan, Rajeev Joshi, and K. Rustan M. Leino Compaq Systems Research Center, 130 Lytton Ave., Palo Alto, CA 94301, U.S.A. Add to Reading List Source URL: rjoshi.org Download Document from Source Website File Size: 124,97 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