SIGN IN
SIGN UP
A termination analyzer for Java bytecode based on path-length
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Fausto Spoto
Università di Verona, Italy
Fred Mesnard
IREMIA, LIM, Université de la Réunion, France
Étienne Payet
IREMIA, LIM, Université de la Réunion, France
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 32 Issue 3, March 2010
Article No. 8
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1709093.1709095
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 77
· Downloads (cumulative): 372
· Citation Count: 30
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
abstract interpretation
denotational semantics
java
java bytecode
languages
mechanical verification
program analysis
termination analysis
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