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.

Path-Length Analysis for Object-Oriented Programs

SPOTO, Nicola Fausto;
2006

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.
abstract interpretation; termination analysis; static analysis
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/29911
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact