“Software patents under United States patent law”的意思、由来-开放百科全书

Neither software nor computer programs are explicitly mentioned in statutory United States patent law. Patent law has changed to address new technologies, and decisions of the United States Supreme Court and United States Court of Appeals for the Federal Circuit (CAFC) beginning in the latter part of the 20th century have sought to clarify the boundary between patent-eligible and patent-ineligible subject matter for a number of new technologies including computers and software. The first computer software case in the Supreme Court was Gottschalk v. Benson in 1972. Since then, the Supreme Court has decided about a half dozen cases touching on the patent eligibility of software-related inventions.

The eligibility of software, as such, for patent protection has been only scantily addressed in the courts^[1] or in legislation.^[2] In fact, in the recent Supreme Court decision in Alice v. CLS Bank, the Court painstakingly avoided the issue, and one Justice in the oral argument repeatedly insisted that it was unnecessary to reach the issue.^[3] The expression "software patent" itself has not been clearly defined. The United States Patent and Trademark Office (USPTO) has permitted patents to be issued on nothing more than a series of software computer instructions, but the latest Federal Circuit decision on the subject invalidated such a patent. The court held that software instructions as such were too intangible to fit within any of the statutory categories such as machines or articles of manufacture.^[4]

On June 19, 2014 the United States Supreme Court ruled in Alice Corp. v. CLS Bank International that "merely requiring generic computer implementation fails to transform [an] abstract idea into a patent-eligible invention." ^[5]^[6]^[7]

Law

Constitution

Article 1, section 8 of the United States Constitution establishes that the purpose of intellectual property is to serve a broader societal good, the promotion of "the Progress of Science and the useful Arts" :

Statute

However, there are restrictions on subject matter eligibility under Section 101 and in general the line between what is deemed patent eligible under Section 101 and what is ineligible changes is, as discussed below, a matter of ongoing judicial activity.^[9]

History

In the late 1960s and early 1970s, the US Patent Office (as it was then called; the name was latter changed to the US Patent and Trademark Office [PTO or USPTO]) and the United States Court of Customs and Patent Appeals (CCPA) were at odds over the patent-eligibility of technical advances whose departure from the prior art was only in the use of a software algorithm. The Office rejected such claims and declined to patent them, but the CCPA repeatedly reversed the Office's rulings and ordered the issuance of patents. The Office's position was hampered during the 1960s by the uncertainty over whether the Supreme Court could review decisions of the CCPA, because it was unclear whether it was an Article I or Article III court. That question was resolved, however, in Brenner v. Manson, in which the Court held the CCPA an Article III court and that there was certiorari jurisdiction to review CCPA decisions.^[10]

The Manson decision also began a string of decisions in which the Supreme Court reversed decisions of the CCPA, and then those of its successor court the United States Court of Appeals for the Federal Circuit (CAFC), which had reversed decisions of the Patent Office or PTO denying a patent to an applicant.^[11]

Benson case

In the first of the Supreme Court's computer software decisions (the "patent-eligibility trilogy"), Gottschalk v. Benson,^[12] the Court reversed the CCPA's reversal of a Patent Office decision, thus denying a patent on an algorithm for converting binary-coded decimal numbers into pure binary numbers. In so ruling, the Court looked back to 19th century decisions such as O'Reilly v. Morse,^[13] which held that abstract ideas could not be made the subject of patents.

Flook case

The Court's 1978 ruling in Parker v. Flook,^[14] was similar to Benson in principle. The Benson and Flook cases also established that a "clue" to whether a patent might be granted on a process was whether the process was carried out with a particular apparatus or else effectuated a transformation of an article from one state or thing to another state or thing. In Flook, where the sole departure from the prior art was concededly the formula or algorithm, no transformation was alleged, and it was conceded that the implementing apparatus was old or conventional, the process was simply not the kind of process that could be patented. The principle, stated in Flook, that to be patent eligible the implementation of an abstract idea or law of nature must be inventive, rather than routine or conventional, became of paramount importance in Supreme Court jurisprudence at the beginning of the 21st century. (This occurred in the Mayo and Alice cases.)

Diehr case

In the 1981 case of Diamond v. Diehr, the United States Supreme Court upheld the CCPA's reversal of the Patent Office, and ordered the grant of a patent on a process for curing rubber in a mold, a substantial part of which involved use of a computer program that used a well-known formula (the Arrhenius Equation) for calculating the time when rubber was cured and the mold could therefore be opened. The Supreme Court stated that in this case, the invention was not merely a mathematical algorithm, but a process for molding rubber, which used the mathematical formula for an industrial purpose, and was therefore patent eligible. In the Diehr case, there was no concession (as there was in Flook) that the implementation was conventional, and the process did effectuate a transformation of substances (from uncured rubber to cured rubber).

The Supreme Court later explained the meaning of this decision and how it actually harmonized with Benson and Flook in the Court's 2012 Mayo opinion.^[15] In the Mayo case, the Court explained that Diehr had not simply claimed the Arrhenius Equation implemented in a non-inventive machine but had instead implemented it in a way that the Diehr Court had found inventive. Under this interpretation, Diehr satisfied the requirements that the Court had earlier found not to have been met in the Flook case.

Pre-1994 period

After this point, more patents on software began to be granted, albeit with conflicting and confusing results. Patenting grew at a rate of 21% per year for high tech companies during this period{{which|date=April 2016}}. This was due in part to judicial decisions during this period that limited the scope of software copyright protection.^[16] After its creation in 1982, the Court of Appeals for the Federal Circuit (CAFC) charted a course that tried to follow the Diehr precedent. Patents were allowed only if the claim included some sort of apparatus, even rather nominal apparatus at times, such as an analog-to-digital converter front end,^[17] or in one case a scratch-pad memory for storing intermediate data.^[18] A representative decision from this period is In re Schrader,^[19] in which the CAFC set forth probably its best and most detailed formulation of the rule it was attempting to follow.

Alappat case

Dissatisfaction with the perceived artificiality of this rule erupted, however, in rulings beginning with the en banc 1994 decision in In re Alappat,^[20] in which the CAFC majority held that a novel algorithm combined with a trivial physical step constitutes a novel physical device. Therefore, a computing device on which is loaded a mathematical algorithm is a "new machine," which is patent-eligible.^[21]

This ruling was immediately preceded by In re Lowry,^[22] which held that a data structure representing information on a computer's hard drive or memory is similarly to be treated as a patent-eligible physical device, and in which the Solicitor General's Office declined the PTO's request to seek certiorari. As a result, the PTO did not even request that the Solicitor General's Office seek certiorari in the Alappat case.

State Street Bank case and aftermath

Finally, in State Street Bank v. Signature Financial Group,^[23] the CAFC ruled that a numerical calculation that produces a "useful, concrete and tangible result", such as a price, is patent-eligible.^[24]

The USPTO's reaction to this change was, for the time being at least, to "throw in the towel." The Clinton administration appointed Bruce Lehman as Commissioner of the USPTO in 1994. Unlike his predecessors, Lehman was not a patent lawyer but the chief lobbyist for the Software Publishing Industry.^[25] In 1995, the USPTO established some broad guidelines for examining and issuing software patents. The USPTO interpreted the decisions of the Federal Circuit as requiring the USPTO to grant software patents in a broad variety of circumstances. Although the U.S. Congress has never legislated specifically that software is patentable, the CAFC interpreted the broad description of patentable subject in section 101 of the Patent Act of 1952 and the failure of Congress to change the law after the CAFC decisions allowing software patents as an indication of Congressional intent. The reaction of the defeated-feeling USPTO was characterized in the cartoon shown at right, which appeared in IEEE Micro in 1995.

Case law after 2000

The United States Supreme Court remained silent on these decisions and developments for years. The first response appeared in a dissenting opinion^[26] in LabCorp v. Metabolite, Inc (2006). Although certiorari had been granted, the Court dismissed it as improvidently granted; the minority dissent argued that the question of statutory subject matter in patent law should be addressed. Justice Breyer's dissent stated:

He continues to directly address the claim that software loaded onto a computer is a physical device:

At about the same time, in a concurring opinion in eBay Inc. v. MercExchange, L.L.C.,^[27] Justice Kennedy (joined by Justices Stevens, Souter, and Breyer) questioned the wisdom of permitting injunctions in support of "the burgeoning number of patents over business methods," because of their "potential vagueness and suspect validity" in some cases.

Bilski case

This was followed by the decision of the CAFC in In re Bilski, which opened a new chapter in this history. In Bilski, as the article on that case explains, the CAFC superseded State Street and related decisions with a return to the tests of the patent-eligibility trilogy (Benson-Flook-Diehr), although while those decisions had merely treated the machine-or-transformation test as a clue to past decisions the CAFC attempted to make that test dispositive.

However, in 2009 the Supreme Court affirmed the judgment but overturned the CAFC's rationale in Bilski, stating that the machine-or-transformation test is not the exclusive test of patentability. At the same time, the Court (per Justice Kennedy) held, 5-4, that Bilski's software, business-method patent application was patent ineligible because it was directed to an abstract idea, largely preempting hedging as a business expedient. But the majority declined to rule all business-method patents ineligible. Justice Stevens, in one of his last opinions before retiring from the Court, concurred in the judgment but disagreed with the majority's rationale. Joined by Justices Ginsburg, Breyer, and Sotomayor, he argued that the claimed invention was patent ineligible because it was a business method (advancing much the same analysis as that in Judge Dyk's opinion in the Federal Circuit) and therefore outside the reach of the patent system. Justice Breyer filed a concurring opinion in which he explained the points on which all nine justices agreed.

Mayo case

Bilski was followed by the Court's unanimous opinion in Mayo Collaborative Services v. Prometheus Labs, Inc.^[28] Although it did not involve a software patent (it concerned a medical assay implementing a natural principle), it stated a methodology for determining patent eligibility that is currently dominant in software cases. It revived the approach of the Flook and Neilson cases, which is to treat the underlying principle, idea, or algorithm on which the claimed patent is based as if it were part of the prior art and to make patent eligibility turn on whether the implementation of it is inventive.

Alice case

In May, 2013, the CAFC issued a fragmented en banc decision in CLS Bank International v. Alice Corp. in which the judges were unable to reach a coherent unified decision on the patentability of the business-method software claims at issue. The case went to the Supreme Court, which decided it on June 19, 2014.

The Court used the analysis from the Mayo decision and held Alice's patents invalid as directed to an abstract idea. As in Bilski, the Court did not rule all business-method patents ineligible. However, the Court's requirement (as in Mayo and Flook) for an "inventive concept" for the implementation of the principle underlying the claimed method and its insistence that "merely saying [to] apply it with a computer" is not enough to confer patent eligibility may doom many or most business-method software patents.^[29]

Post-Alice period

Since the Alice decision, the Federal Circuit and district courts have held a number of business-method patents to be patent ineligible as mere abstract ideas implemented in a conventional way without embodying any inventive concept.

Digitech

In Digitech Image Technologies, LLC v. Electronics for Imaging, Inc.,^[30] the Federal Circuit invalidated a patent on a "device profile" and methods for generating "device profiles." The device profile was a collection of information about a graphic image, and it was generated by combining data sets containing such information. The court held that the device and method for generating it were abstract ideas and patent ineligible: "Without additional limitations, a process that employs mathematical algorithms to manipulate existing information to generate additional information is not patent eligible."

buySAFE

In buySAFE, Inc. v. Google, Inc.,^[31] the Federal Circuit invalidated under section 101 a patent on a computerized surety system for online transactions. The court said the computer implementation of the underlying surety idea was "not even arguably inventive." The court concluded: "In short, with the approach to this kind of section 101 issue clarified by Alice, it is a straightforward matter to conclude that the claims in this case are invalid." The court remarked in passing, however, that if "enough extra is included in a claim, it passes muster under section 101 even if it amounts to a business method." But the court did not explain or illustrate what would be "enough extra."

DDR Holdings

In DDR Holdings v. Hotels.com,^[32] the Federal Circuit upheld one patent and invalidated several others under Alice. This is the only instance since the Alice decision in which the Federal Circuit held a patent to be eligible. The court said that the eligible patent solved an Internet-centric problem in an inventive way. (It essentially framed one website within another, so that it appeared to be a part of the other site.)

Versata v. SAP

In Versata v. SAP,^[33] the Federal Circuit summarized its holdings in several other post-Alice cases that are not summarized above. The following summaries are extracted from the Federal Circuit's opinion in the Versata case:

The Versata court also summarized two pre-Alice decisions in which the rulings were consistent with Alice:

In the 2015 Versata case, itself, the Federal Circuit affirmed the final order of the Patent Trial and Appeal Board (PTAB), the recently created adjudicatory arm of the United States Patent and Trademark Office (USPTO), invalidating as patent ineligible the claims in issue of Versata's patent on a method of determining what price to charge a customer. It said, "Using organizational and product group hierarchies to determine a price is an abstract idea that has no particular concrete or tangible form or application." Moreover, the implementation was a "purely conventional" use of a computer.

Loyalty Conversion and other 2014 district court cases

The software cases after Alice adopt its method of legal analysis, based on the decision of the Supreme Court in the Mayo case. This calls for a two-step analysis. First, the court determines whether the claimed invention is based on an abstract idea or principle of some sort, often expressed at a high level of generality, such as a computerized escrow or surety arrangement, as in the Bilski and Alice cases.^[38] If the claimed invention is directed to an abstract idea, the court proceeds to the second step of analysis, which is to determine whether the patent adds "something extra" to the idea that embodies an "inventive concept." If there is no addition of an inventive element to the underlying abstract idea, the court will find the patent invalid under section 101.

Few software patents have survived this analysis since the Alice decision,^[39] largely because they are written in purely functional language to claim a result rather than describe a structure for accomplishing a result. Thus, Federal Circuit Judge Bryson explained when sitting by designation as a trial judge in the Loyalty v. American Airlines case:^[40]

What software patents will survive Alice analysis?

The question has been raised, therefore, what kinds of software-related patents will survive the analysis prescribed in Alice and Mayo. The question was considered during the oral argument of the Alice case, although not more than cursorily in the opinion. Counsel for CLS Bank suggested that data compression and data encryption were software technologies that are likely to be patent-eligible because they address "a business problem, a social problem, or a technological problem." The Solicitor General, as amicus curiae, said that it would be difficult to identify a patent-eligible business method unless it involved an improved technology, such as "a process for additional security point-of-sale credit card transactions using particular encryption technology" – "that might well be patent eligible."^[41]

At least one commentator has questioned that, however, because encryption largely consists of mathematical operations using modular arithmetic and theorems of Euler.^[42] Yet, as the commentator points out, in the Flook case the Supreme Court said: "As the CCPA has explained, 'if a claim is directed essentially to a method of calculating, using a mathematical formula, even if the solution is for a specific purpose, the claimed method is nonstatutory [patent ineligible].' " Furthermore, in July 2014, just after the Alice decision came down, a Federal Circuit panel held a patent ineligible, quoting Flook and adding: "Without additional limitations, a process that employs mathematical algorithms to manipulate existing information to generate additional information is not patent eligible."^[43] Judge Bryson's comments, quoted above, may therefore be more predictive of the likely outcomes of future software-related patent cases, including encryption ones, than counsel's assurances during oral argument in the Alice case.

Allvoice

In Allvoice Developments US, LLC v. Microsoft Corp., the Federal Circuit in a May 2015 nonprecedential opinion invalidated patent claims to a speech recognition "interface" without undertaking an Alice analysis. The so-called interface was entirely a set of software instructions, claimed in means-plus-function form. The court found it unnecessary to go through the two-step analysis because a set of instructions is not a machine or article of manufacture or composition of matter, and it did not purport to be a process. Accordingly, the claimed subject matter did not fit within any of the statutory categories of section 101, which defines patentable subject matter.^[44] Moreover, it was intangible, and in the Digitech case, the Federal Circuit had held that except for processes, "eligible subject matter must exist in some physical or tangible form." ^[45]

Landmark decisions

See also

References

1. ^However, a recent nonprecedential decision of the Federal Circuit held that software as such is not patent eligible. Allvoice Developments US, LLC v. Microsoft Corp. (Nonprecedential May 22, 2015).
2. ^There has been legislation addressing business method patents, however, which are almost always based on software. The America Invents Act (AIA), for example, created new procedures for post-grant challenges to patents on "Covered Business Methods" (CBMs). See generally Intellectual Ventures II LLC v. JPMorgan Chase & Co., 781 F.3d 1372 (Fed. Cir. 2015).
3. ^Alice Corp. Pty. Ltd. v. CLS Bank Int'l, 573 U.S. ___ (2014). During oral argument, Justice Sotomayor repeatedly asked counsel whether Alice was a software case: "Why do we need to reach . . . software patents at all in this case?"; "What's the necessity for us to announce a general rule with respect to software? There is no software being patented in this case."; "Do you think we have to reach the patentability of software to answer this case?" The Court's opinion in Alice does not discuss the patent eligibility of software as such.
4. ^Allvoice Developments US, LLC v. Microsoft Corp. (Fed. Cir. May 22, 2015). The Supreme Court had held previously that software in algorithm form without machine implementation could not be patented in process format, see Gottschalk v. Benson and Parker v. Flook, but could be patented when claimed as a machine inventively using software, see Diamond v. Diehr.
5. ^http://abcnews.go.com/Technology/wireStory/supreme-court-tosses-software-patent-24210428
6. ^https://www.washingtonpost.com/blogs/the-switch/wp/2014/06/19/the-supreme-court-has-unanimously-struck-down-a-software-patent-that-everyone-agreed-was-terrible/
7. ^https://www.forbes.com/sites/danielfisher/2014/06/19/patent-lawyers-software-companies-like-alice-corp-ruling-trolls-not-so-much/
8. ^35 U.S.C. 101 Inventions patentable. - Patent Laws {{webarchive|url=https://web.archive.org/web/20090602033417/http://www.uspto.gov/web/offices/pac/mpep/documents/appxl_35_U_S_C_101.htm |date=2009-06-02 }}
9. ^http://www.lexisnexis.com/community/patentlaw/blogs/patentcommentary/archive/2012/03/27/eric-e-bensen-on-the-supreme-court-s-decision-in-mayo-collaborative-servs-v-prometheus-labs.aspx
10. ^383 U.S. 519 (1966).
11. ^Almost invariably, the Supreme Court's grant of certiorari in patent cases has resulted in reversal of the decision of the court below and reinstatement of the Patent Office or PTO decision denying a patent.
12. ^409 U.S. 63 (1972)
13. ^56 U.S. (15 How.) 62 (1853).
14. ^437 U.S. 584 (1978).
15. ^Mayo Collaborative Services v. Prometheus Labs., Inc., 566 U.S. __, 132 S. Ct. 1289 (2012).
16. ^{{cite journal|last1=Noel|first1=Michael|last2=Schankerman|first2=Mark|title=Strategic Patenting and Software Innovation.|journal=The Journal of Industrial Economics|date=September 2013|volume=61|issue=3|pages=481–520|accessdate=}}
17. ^Arrhythmia Research Tech. v. Corazonix Corp., 958 F.2d 1053 (Fed. Cir. 1992).
18. ^See In re Iwahashi, 888 F.2d 1370 (Fed. Cir. 1989).
19. ^22 F.3d 290 (Fed. Cir. 1994).
20. ^33 F.3d 1526 (1994).
21. ^This argument is discussed in the Wikipedia article Piano roll blues. That article suggests that the opinion of the Supreme Court in Alice Corp. Pty. Ltd. v. CLS Bank Int'l, 573 U.S. __ (2014), rejected the argument.
22. ^32 F.3d 1579, 1582 (Fed. Cir. 1994).
23. ^149 F.3d 1368 (Fed. Cir. 1998).
24. ^See also AT&T Corp. v. Excel Communications, Inc., 172 F.3d 1352 (Fed. Cir. 1999) (similar ruling, upholding patent based on Boolean ANDing).
25. ^See Developments in the Economics of Copyright: Research and Analysis (eds. Lisa Takeyama, Wendy J. Gordon, Ruth Towse) at note 34 and accompanying text, available at https://books.google.com/books?id=ecPJSiHIi2kC&pg=PA17&lpg=PA17&dq=%22Business+Software+Alliance%22+%22bruce+lehman%22&source=bl&ots=AB0bhcvwJs&sig=-P1MAbCTwwXxVwDZcTWSN0-DvcU&hl=en&sa=X&ei=_EF6U9DrB6vMsQTZvYDYAg&ved=0CFUQ6AEwBw#v=onepage&q=%22Business%20Software%20Alliance%22%20%22bruce%20lehman%22&f=false .
26. ^548 U.S. 124 (2006). [{{SCOTUS URL Slip|05|04-607}} Slip opinion]
27. ^547 U.S. 388 (2006).
28. ^132 S. Ct. 1289 (2012).
29. ^See Richard H. Stern, Alice v CLS Bank: US Business Method and Software Patents Marching towards Oblivion?, [2014] Eur. Intell. Prop. Rev. 619, 626, suggesting that "most business methods will fail to pass muster under the Flook-Mayo-Alice rationale." See also Richard H. Stern, Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 1, IEEE Micro, Sept./Oct. 2014, at p. 68 ("A majority of the Court refused to address the patent eligibility of business methods as such. Yet, because of their typical abstractness, and because of the legal analysis that the Court prescribed for implementations of abstract ideas, business-method patents now seem like lemmings marching in the thousands toward oblivion. That is not equally so for all software patents, of which business-method patents are a major subset. The Court left some room for non-business-method software patents.").
30. ^758 F. 3d 1344 (2014).
31. ^765 F.3d 1350 (2014).
32. ^773 F.3d 1245 (Fed. Cir. 2014).
33. ^__ F.3d __, 2015 U.S. App. LEXIS 11802 (Fed. Cir. July 9, 2015) (Plager, J.).
34. ^Ultramercial, Inc. v. Hulu, Inc., 657 F.3d 1325 (Fed. Cir. 2013).
35. ^776 F.3d 1343 (Fed. Cir. 2014)
36. ^687 F.3d 1266 (Fed. Cir. 2012).
37. ^654 F.3d 1366 (Fed. Cir. 2011).
38. ^See, for example, [https://scholar.google.com/scholar_case?case=15554380012400502922&q=%22Loyalty+Conversion%22&hl=en&as_sdt=20006&as_vis=1 Loyalty Conversion Sys. Corp. v. American Airlines, Inc.], — F. Supp. 3d —, 2014 WL 4364848 (E.D. Tex. Sept. 3, 2014) ("At their core, the asserted claims of the two patents in suit are directed to the conversion of loyalty award points of one vendor into loyalty award points of another. That core idea plainly would not be patentable without more, as it is indistinguishable in principle from the simple and familiar financial or business operations that were at issue in Bilski and CLS Bank...."); Tuxis Technologies, LLC v. Amazon. com, Inc., — F. Supp. 3d —, 2014 WL 4382446 (D. Del. Sept. 3, 2014) (method of "upselling" or "cross-selling" -- "the basic idea of offering something to a customer based on his or her interest in something else," a concept that "has been a cornerstone of commercial activity since time immemorial"); Walker Digital, LLC v. Google, Inc., — F. Supp. 2d —, 2014 WL 4365245 (D. Del. Sept. 3, 2014) ("The claim limitations essentially recite a generic headhunting or matchmaking request by two parties.").
39. ^For a listing of decisions, as of May 2015, see Steven Callahan, Alice: The Death of Software-Related Patents? (May 1, 2015). The author states: "[S]ince Alice, of the 76 decisions dealing with Alice challenges, 57 have invalidated patents; only 16 have upheld them on the merits (3 additional decisions rejected Alice challenges for procedural reasons). Excluding the procedural decisions, that is a 78% win rate for defendants challenging patents under Alice in court. (Of course, numerous patents have also fallen victim to Alice challenges before the Patent Trial and Appeal Board.)"
40. ^[https://scholar.google.com/scholar_case?case=15554380012400502922&q=%22Loyalty+Conversion%22&hl=en&as_sdt=20006&as_vis=1 Loyalty Conversion Sys. Corp. v. American Airlines, Inc.]
41. ^Oral Argument in Alice.
42. ^Note on Encryption Software, in Chapter 8-D of Intellectual Property Protection of Digital Information in the New Millennium: Cases and Materials on Intellectual Property Rights in Computer Programs and Related Subject Matter
43. ^In Digitech Image Technologies, LLC v. Electronics for Imaging, Inc., 758 F.3d 1344 (Fed. Cir. 2014).
44. ^See In re Nuitjen, 500 F.3d 1346, 1354 (Fed. Cir. 2007).
45. ^Digitech Image Techs., LLC v. Elecs. for Imaging, Inc., 758 F.3d 1344, 1348 (Fed. Cir. 2014).

Law

Constitution

Statute

History

Benson case

Flook case

Diehr case

Pre-1994 period

Alappat case

State Street Bank case and aftermath

Case law after 2000

Bilski case

Mayo case

Alice case

Post-Alice period

Digitech

buySAFE

DDR Holdings

Versata v. SAP

Loyalty Conversion and other 2014 district court cases

What software patents will survive Alice analysis?

Allvoice

Landmark decisions

See also

References

Further reading