Small domains spell fast strictness analysis

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: R. C. Sekar Dept. of Computer Science, SUNY at Stony Brook, NY
Shaunak Pawagi Dept. of Computer Science, SUNY at Stony Brook, NY
I. V. Ramarkrishnan Dept. of Computer Science, SUNY at Stony Brook, NY
Published in:
· Proceeding
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 169-183
ACM New York, NY, USA ©1990
table of contents ISBN:0-89791-343-4 doi>10.1145/96709.96727
Small domains spell fast strictness analysis Published by ACM 1989 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 140
· Citation Count: 8


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