|
Authored by: Anonymous on Friday, May 18 2012 @ 07:55 PM EDT |
When I say "who knows?", I meant that I don't remember that specific
issue being addressed in what was reported here of his testimony. Maybe the
expert didn't think of taking that approach or maybe the expert just felt the
lack of stack simulation was clearer to explain (although I can't see why you
wouldn't use both to reinforce the difference between the approaches). It may be
that it wasn't mentioned because the JVM and the example code don't (need to?)
simulate branching/looping as part of array initialization since (as bugstomper
points out) the patent wording may differ from actual JVM operation but the
wording is what matters. If somebody is brave enough to look at the sample
simulation code provided with the patent and see whether it supports branch/loop
bytecodes that would be cool, but I won't look at s/w patents for the same
reason that others have already stated many times here.[ Reply to This | Parent | # ]
|
|
|
|
|