Logical characterizations of heap abstractions

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Greta Yorsh Tel-Aviv University, Tel-Aviv, Israel
Thomas Reps University of Wisconsin, Madison, WI
Mooly Sagiv Tel-Aviv University, Tel-Aviv, Israel
Reinhard Wilhelm Universität des Saarlandes, Saarbrücken, Germany
Logical characterizations of heap abstractions Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 424
· Citation Count: 10

Published in:
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 8 Issue 1, January 2007
Article No. 5
ACM New York, NY, USA
table of contents doi>10.1145/1182613.1182618

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