About the undecidability of program equivalence in finitary languages with state

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Andrzej S. Murawski Oxford University Computing Laboratory
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 6 Issue 4, October 2005
Pages 701-726
ACM New York, NY, USA
table of contents doi>10.1145/1094622.1094626
About the undecidability of program equivalence in finitary languages with state Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 21
· Downloads (cumulative): 344
· Citation Count: 3


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