Path-length analysis for object-oriented programs - Université de La Réunion Access content directly
Conference Papers Year : 2006

Path-length analysis for object-oriented programs


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.
Fichier principal
Vignette du fichier
Path_Length_analysis_for_object_oriented_programs.pdf (203.5 Ko) Télécharger le fichier
Origin Explicit agreement for this submission

Dates and versions

hal-01915777 , version 1 (08-11-2018)


  • HAL Id : hal-01915777 , version 1


Fausto Spoto, Patricia M Hill, Etienne Payet. Path-length analysis for object-oriented programs. First International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06), Mar 2006, Vienne, Austria. ⟨hal-01915777⟩
53 View
97 Download


Gmail Mastodon Facebook X LinkedIn More