Analysis of recursive state machines

Full Text:

Pdf

Pdf

Buy this Article

Buy this Article

Authors:	Rajeev Alur	University of Pennsylvania, Philadelphia, PA
	Michael Benedikt	Bell Laboratories, Lisle, IL
	Kousha Etessami	University of Edinburgh, Scotland, UK
	Patrice Godefroid	Bell Laboratories, Lisle, IL
	Thomas Reps	University of Wisconsin, Madison, WI
	Mihalis Yannakakis	Columbia University, New York, NY

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 4 · Downloads (12 Months): 60 · Downloads (cumulative): 1,121 · Citation Count: 58

Published in:

· Journal

ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive

Volume 27 Issue 4, July 2005
Pages 786 - 818
ACM New York, NY, USA
table of contents doi>10.1145/1075382.1075387

Tools and Resources

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

Share:

|

Tags: algorithms automata context-free languages formal methods model checking program analysis pushdown automata recursive state machines software verification state diagrams temporal logic verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder