decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
That wasn't the point... | 294 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
That wasn't the point...
Authored by: Anonymous on Wednesday, May 30 2012 @ 07:36 PM EDT
Dalvik was accused of infringing this claim when optimizing static
initialization of Java bytecodes. Java bytecodes operate by pushing and
popping values on the stack. That's why the experiment of Google's
expert was to show the absence of these stack manipulations.

The patent claim itself does not require a stack, but any infringing
implementation using Java bytecodes as input would, because thats what
"simulating execution" means with Java bytecode instructions.

[ Reply to This | Parent | # ]

To stack or not to stack
Authored by: darrellb on Wednesday, May 30 2012 @ 08:08 PM EDT
I don't see why the memory claimed can only be a stack. That's an implementation
detail not a limitation of the patent.

[ Reply to This | Parent | # ]

The "memory" of the claim is NOT the stack one
Authored by: Anonymous on Wednesday, May 30 2012 @ 08:19 PM EDT
The "memory" mentioned in the claim, is the place where the results of the simulated bytecodes would be stored during the simulation. In other words, its a temporary container to hold the array contents, as they are assembled.

The stack part, is not mentioned in the patent claims, and only comes into the picture because Google was accused of infringing this patent with some code (in the dex tool) that processes Java bytecode instructions as input. The claims require "simulating execution" of the instructions which make up the array initialization code.

Now Java bytecodes are stack-based, so "simulating execution" of them requires a model of the Java VM stack. (It doesn't require an actual stack, but it does require something that can keep track of the stack manipulations as they are simulated).

Android's code, in fact, contains such a stack-based simulation module for Java bytecodes. But it is used everywhere except in this array initialization. The experiment done by one of Google's experts, was to instrument the stack manipulation code in this tool so it printed out messages. He used this to demonstrate that this simulation code was not used at all to collect up the optimized contents of the array. This confirmed what Google's witnesses were saying: that the dex tool does not use simulated execution to do this optimization, but instead uses the simpler technique of pattern-matching.

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )