 |
 |
 |
Conference papers
Path-length analysis for object-oriented programs
Abstract : This paper describes a new static analysis for finding approximations to the path-length of variables in imperative, object-oriented programs. The path-length of a variable v is the cardinality of the longest chain of pointers that can be followed from v. It is shown how such information may be used for automatic termination inference of programs dealing with dynamically created data-structures.
Cited literature [21 references]
https://hal.univ-reunion.fr/hal-01915777
Contributor : Réunion Univ <>
Submitted on : Thursday, November 8, 2018 - 8:56:32 AM
Last modification on : Thursday, March 28, 2019 - 11:24:11 AM
Long-term archiving on: : Saturday, February 9, 2019 - 12:34:39 PM
Contributor : Réunion Univ <>
Submitted on : Thursday, November 8, 2018 - 8:56:32 AM
Last modification on : Thursday, March 28, 2019 - 11:24:11 AM
Long-term archiving on: : Saturday, February 9, 2019 - 12:34:39 PM
File
Path_Length_analysis_for_objec...
Explicit agreement for this submission