Reasoning about comprehensions with first-order SMT solvers

doi:10.1145/1529282.1529411

Reasoning about comprehensions with first-order SMT solvers

Full Text:

Pdf

Buy this Article

Authors:	K. Rustan M. Leino	Microsoft Research, Redmond, WA
	Rosemary Monahan	National University of Ireland, Kildare, Ireland

Published in:

	· Proceeding
	SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-166-8 doi>10.1145/1529282.1529411

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 20 · Citation Count: 8

Tools and Resources

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

Tags: assertion checkers assertions class invariants correctness proofs formal methods invariants languages logics of programs matching triggers mechanical verification pre- and post-conditions programming by contract quantifiers smt solvers spec# specification techniques 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