Proving that programs eventually do something good

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Byron Cook Microsoft Research
Alexey Gotsman University of Cambridge
Andreas Podelski University of Freiburg
Andrey Rybalchenko EPFL and MPI-Saarbrücken
Moshe Y. Vardi Rice University
Proving that programs eventually do something good Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 37
· Downloads (cumulative): 603
· Citation Count: 22

Published in:
Cover Image
 
· Proceeding
POPL '07 Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 265-276
ACM New York, NY, USA ©2007
table of contents ISBN:1-59593-575-4 doi>10.1145/1190216.1190257
· Newsletter
ACM SIGPLAN Notices - Proceedings of the 2007 POPL Conference Homepage
Volume 42 Issue 1, January 2007
Pages 265 - 276
ACM New York, NY, USA
table of contents doi>10.1145/1190215.1190257

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder