ESP Wiki is looking for moderators and active contributors!
Difference between revisions of "Rapid Type Analysis"
(==Related pages on {{SITENAME}}== * Software is math * Example software patents ==References== {{reflist}} {{footer}} Category: Example software patents) |
(typo and mention RTA from the start) |
||
| Line 1: | Line 1: | ||
| − | [http://dl.acm.org/citation.cfm?id=236371 Rapid Type Analysis] is a standard algorithm used for call graph construction. Its main advantage is speed, and it is often considered to have the best cost/accuracy tradeoff. It is a simple but clever algorithm: entire description of the algorithm in the paper literally fits in a single paragraph, but prior works missed the crucial enhancement. | + | '''[http://dl.acm.org/citation.cfm?id=236371 Rapid Type Analysis]''' ('''RTA''') is a standard algorithm used for call graph construction. Its main advantage is speed, and it is often considered to have the best cost/accuracy tradeoff. It is a simple but clever algorithm: entire description of the algorithm in the paper literally fits in a single paragraph, but prior works missed the crucial enhancement. |
| − | [http://www.google.com.br/patents/US6041179 | + | [http://www.google.com.br/patents/US6041179 RTA was patented by IBM]. Thankfully, [[IBM]] let the patent expire by not paying maintenance fee. |
| − | [http://www.sable.mcgill.ca/soot/ Soot] is a widely used open source library to analyze JVM bytecode, licensed under LGPL. As you can see from this [http://www.sable.mcgill.ca/soot/tutorial/devirt/ note dated 2000], Soot implemented RTA | + | [http://www.sable.mcgill.ca/soot/ Soot] is a widely used open source library to analyze JVM bytecode, licensed under LGPL. As you can see from this [http://www.sable.mcgill.ca/soot/tutorial/devirt/ note dated 2000], Soot implemented RTA while the IBM patent was in effect. It seems that the patent was widely ignored in practice. |
==Related pages on {{SITENAME}}== | ==Related pages on {{SITENAME}}== | ||
Latest revision as of 11:48, 25 April 2015
Rapid Type Analysis (RTA) is a standard algorithm used for call graph construction. Its main advantage is speed, and it is often considered to have the best cost/accuracy tradeoff. It is a simple but clever algorithm: entire description of the algorithm in the paper literally fits in a single paragraph, but prior works missed the crucial enhancement.
RTA was patented by IBM. Thankfully, IBM let the patent expire by not paying maintenance fee.
Soot is a widely used open source library to analyze JVM bytecode, licensed under LGPL. As you can see from this note dated 2000, Soot implemented RTA while the IBM patent was in effect. It seems that the patent was widely ignored in practice.
