Re: Bounding memory usage

Fernando <pronesto@gmail.com>
Thu, 10 Sep 2009 04:32:37 -0700 (PDT)

          From comp.compilers
Related articles
Bounding memory usage pronesto@gmail.com (Fernando) (2009-09-08)
Re: Bounding memory usage cr88192@hotmail.com (BGB / cr88192) (2009-09-09)
Re: Bounding memory usage pronesto@gmail.com (Fernando) (2009-09-10)
Re: Bounding memory usage bfranke@inf.ed.ac.uk (=?ISO-8859-1?Q?Bj=F6rn_Franke?=) (2009-09-11)
Re: Bounding memory usage mburrel@uwo.ca (Mike Burrell) (2009-09-11)
| List of all articles for this month |
From: Fernando <pronesto@gmail.com>
Newsgroups: comp.compilers
Date: Thu, 10 Sep 2009 04:32:37 -0700 (PDT)
Organization: Compilers Central
References: 09-09-050 09-09-052
Keywords: storage
Posted-Date: 13 Sep 2009 20:06:32 EDT

On Sep 9, 1:42 pm, "BGB / cr88192" <cr88...@hotmail.com> wrote:
>
> In General, With Java The Likely Number Of Cases Where This Can Actually Be
> Done Is Likely To Be So Small As To Make It Not Even Worth The Bother Of
> Trying To Do So.


Hi, thank you for the very detailed answer!


Indeed, I also think the results of a static analysis would be rather
limited, i.e, we would get "Unbounded" most of the times. However, I
would appreciate if the analysis could print the program trace that
forces the "Unbounded" output. For instance, for the program below we
would get:


1 n = readInputFromSomeWhere();
2 for (int = 0; i < n; i++) {
3 list.add(new Foo());
4 }


$> "Unbounded object creation at line 3"


So, do you guys know of any conservative analysis used in any open
source compiler that I could look at? It does not have to be
necessarily for Java, although it would be better if it were. Even a
paper or wiki would be nice.


All the best,


Fernando


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.