Structuring the verification of heap-manipulating programs

doi:10.1145/1706299.1706331

Structuring the verification of heap-manipulating programs

Full Text:

PDF

Buy this Article

Authors:	Aleksandar Nanevski	IMDEA Software, Madrid, Spain
	Viktor Vafeiadis	Microsoft Research, Cambridge, United Kingdom
	Josh Berdine	Microsoft Research, Cambridge, United Kingdom

Published in:

	· Proceeding
	POPL '10 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
	ACM New York, NY, USA ©2010 table of contents ISBN: 978-1-60558-479-9 doi>10.1145/1706299.1706331
	· Newsletter
	ACM SIGPLAN Notices - POPL '10
	Volume 45 Issue 1, January 2010 ACM New York, NY, USA table of contents doi>10.1145/1707801.1706331

	2010 Article
Bibliometrics
· Downloads (6 Weeks): 6 · Downloads (12 Months): 62 · Citation Count: 7

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- POPL '13

Tags: hoare logic languages mechanical verification monads separation logic type theory verification

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player