SIGN IN
SIGN UP
Resource control graphs
Full Text:
Pdf
Buy this Article
Author:
Jean-Yves Moyen
LIPN—UMR 7030 and CNRS—Université Paris 13, France
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 10 Issue 4, August 2009
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1555746.1555753
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 23
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
implicit computational complexity
non-size increasing computation
program analysis
program termination
size change termination
software/program verification
theory
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder