+91-80-26860424 / 34

Call Us Today

LinkedIn

 

Testing Parameters for Software Patentability

BananaIP Counsels > Intellectual Property  > Testing Parameters for Software Patentability

Testing Parameters for Software Patentability

The image depicts an enlarged image of a cassette tape with the words software patents as the post is about Testing Parameters for Software Patentability

First Published Date: 24th December, 2007

Abstract

Patentability of computer programs is fraught with ambiguity because of multiple reasons. One of such reasons is the uncertainty and inadequacy of tests to determine patentability. Courts in the US have been struggling to evolve a test that would cover the complete continuum of innovation in computer programs, which manifests in terms of form or function or both.
All tests adopted by the court either focus on only form or function, thus missing out the other. It is important for the legislatures and courts to understand the existing lacuna and to adopt a test that would lay emphasis on form and function. The test should be modeled to allow inventions having high function or high form or both form and function in high proportion. It should keep inventions having low form and function outside the scope of patent protection. Such a model would promote progress in the entire continuum of the invention in the software field by granting patents to worthy inventions.
Key words: Software – Computer Programs – Patentability – Form – Function – Test.

Introduction
Software[2] as a field is characterized by “sequential” and “complementary” innovations. Owing to the nature of the industry, it is known that introduction of an uncertain software patent system has at the least stagnated the growth of innovation in the field if not reduced it[3].  Whether or not software patents should be allowed has been a heated debate for over a decade in the US and similar debates would arise in India as we get in compliance with the rest of the world through the WTO. About a hundred thousand software patents have already been issued in the US and if belief has to be laid in the phenomenon of industry lobby, it would be no great surprise when India allows software patents at some point in time. The Indian government made such an attempt in the 2004 patent amendment ordinance but had to repeal it in the subsequent amendment Act of 2005. Hence it would be a futile exercise to talk about whether or not software patents should be allowed; instead the focus must be on what must be done to minimize or if possible eradicate the reversing effect of the patent system on the software industry.
The primary concern about software patenting is the danger of preempting human thought process or manual method of accomplishing a particular task. Though the concern is valid, in certain instances, software development has evolved for long enough to believe that there are numerous instances where so much is being accomplished through the use of software that human being could never have thought of accomplishing through plain manual labor or the thought process. For example, a human being cannot create a dynamically changing picture but that is possible through images on computers today. Though it is naïve to think that software is all about an algorithm and algorithm is just a representation of a human thought process, things in software are not so simple.
Software as a field is very complicated for patent purposes. Complications with patenting software have resulted in a host of silly and unworthy software patent grants in the US because of multiple reasons[4]. One of the reasons is the difficulty in applying a reliable patentability test. Courts and Legislatures are struggling in applying the existing tests to differentiate patentable inventions from unpatentable ones[5]. The tests being applied today are either too broad or too narrow resulting in destruction of patent law’s objective to protect worthy inventions for promoting innovation in the software industry.
This paper proposes parameters for coining a reliable test for determining patentability. Authors believe that a test based on parameters such as form and function would encourage innovation in the software industry without stifling progress through grant of silly patents.  Part I of the paper expounds the law relating to software in USA and India. Part II analyzes the existing patentability tests in terms of importance given to form and function of computer programs and Part III discusses the usage of form and function as parameters for coining a good patentability test.

Part I

US Patent Law and Computer Programs.
US Patent Law is codified under Title 35 of the United States Code. Section 101 of Title 35, deals with patentable subject matter. It provides that ‘any person who invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefore…'[6]. As Section 101 had been very broadly worded, the developments in patent law, in response to Computer Technologies were largely an outcome of Judicial Interpretation.
Though the courts dealt with the issue in 1968, the first decision dealing with computer programs was given in the year 1972. The initial decisions of the courts were based on two doctrines, the ‘mental steps’ doctrine and the ‘function of the machine’ doctrine[7]. The mental steps doctrine postulates that processes involving mental operations are unpatentable[8]. The mental-steps doctrine was based upon the familiar principle that a scientific concept or mere idea cannot be the subject of a valid patent[9]. The ‘function of a machine’ doctrine postulates that a machine is patentable but its functions are not patentable.
The mental steps doctrine was regularly invoked by courts to deny patents to inventions consisting primarily of mathematical formula or methods of computation or in which the sole inventive contribution was a mental operation or mathematical computation[10]. Based on the mental steps doctrine the patent office adopted guidelines on the examination of application for patents on computer programs in the year 1968, which provided that computer programs claimed as an apparatus or a process are not patentable[11]. However, the patent office indicated that a programmed computer could be a component of a patentable process if combined with unobvious elements to produce a physical result. The Patent Office formally adopted the guidelines in 1968[12].
In the same year, the Court of Customs and Patent Appeals changed the law completely by repudiating both the ‘function of a machine’ and ‘mental steps’ doctrines in two separate decisions and expanded the scope of patentable subject matter to include computer programs[13]. The Prater decision opened the gates for processes involving computer programs by holding that a process involving mental steps would not be unpatentable if the steps can also be performed without mental operation[14]. In re Bernhart, the court reaffirmed Prater, and indicated that all that remained of the mental-steps doctrine was a prohibition on the granting of a patent that would confer a monopoly on all uses of a scientific principle or mathematical equation[15]. The court also announced that a computer programmed with a new and unobvious program was physically different from the same computer without that program; the programmed computer was a new machine or at least a new improvement over the unprogrammed computer[16].
After the CCPA opened the door for patents on computer programs, the US Supreme Court and Federal Courts tried to clarify the issue in Benson, Parker, Diamond, Alappat and State Street Bank, by differentiating patentable computer programs from non patentable abstract ideas, natural phenomena and laws of nature[17]. In the process, the courts designed and tried different patentability tests. The uncertainty in applying patent principles to computer programs can be seen from the decisions and the reasoning of the courts.

A. Gottschalk v. Benson[18]
The case involved an invention consisting of a method for converting Binary-Coded-Decimal numerals into pure Binary numerals. The method was claimed in a general-purpose computer of any type and was not limited to a particular art, apparatus or machinery. The claims were rejected by the patent office but sustained by the Court of Customs and Patent Appeals (CCPA). The Supreme Court reversed the decision of CCPA and held the claimed invention to be non-patentable subject matter.

Reasoning of the Court

The court started by reiterating that phenomena of nature, though just discovered, mental processes, and abstract intellectual concepts are not patentable, as they are the basic tools of scientific and technological work. Based on that principle it reasoned that allowing patent protection over the method of converting Binary Coded Decimal numerals to pure Binary numerals in this case would result in patenting of ideas[19], because the mathematical formula involved has no substantial practical application except in connection with a digital computer. As agreeing to the patentability of the claimed method would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself the court held that the claimed method is not eligible for patent protection[20].

Test

The court in this case determined patentability of the invention by testing whether the computer program has a substantial practical application. The program was held not patentable, as it did not have substantial practical application. This test proved to be very ambiguous, as the phrase ‘substantial practical application’ was not defined.

B. Parker v. Flook[21]
The dispute in this case related to the patentability of an invention involving a method for updating alarm limits. The Court of Customs and Patent Appeals rejected the examiner’s decision and held the invention to be patentable subject matter. The Supreme Court reversed the decision of CCPA and held the invention to be non-statutory subject matter under section 101 of the Patent Act because the invention just identified post solution applications of the formula and as the only novel feature of the invention was the mathematical formula or algorithm.

Reasoning of the court

The method in this case consists of three steps: an initial step which merely measures the present value of the process variable (e. g., the temperature); an intermediate step which uses an algorithm to calculate an updated alarm-limit value; and a final step in which the actual alarm limit is adjusted to the updated value[22]. The court opined that the only difference between the conventional methods of changing alarm limits and that described in the invention rested in the second step, which is the mathematical algorithm or formula standing alone, which is not patentable[23]. It stated that the invention is unpatentable under § 101 because once the mathematical algorithm is assumed to be within the prior art, the invention, considered as a whole doesn’t have any inventive application of the algorithm.

Test

The test is whether the computer program containing a mathematical principle involves an inventive application of the principle. If there is an inventive application, the program is patentable else it is not patentable. This test is also ambiguous, as the meaning of the phrase ‘inventive application’ was not elucidated.

C. Diamond v. Diehr[24]
The case related to a dispute over the patentability of a process for molding raw, uncured synthetic rubber into cured precision products. The invention involved the process of constantly measuring the temperature inside the mold and feeding the temperature measurements into a computer that repeatedly recalculates the cure time by use of the mathematical equation (Arrhenius equation) and then signals a device to open the press at the proper time. The patent examiner rejected the application on the ground of non-statutory subject matter stating that the invention involves nothing more than a mathematical equation along with conventional industrial methods. The supreme court disagreed with the patent examiner and agreed with the Court of Customs and Patent Appeals by holding that a process would not be non patentable subject matter simply because it employs a mathematical formula, computer program or digital computer as long as it produces an useful result.

Reasoning of the court

The court started its analysis by stating that a patent is granted in USA for the invention of some practical method or means of producing a beneficial result or effect and not for the result or effect itself[25]. As the claimed process describes a new method of producing a result, the court held that it is patentable subject matter, though it uses well-known steps[26]. Despite the fact that Arrhenios equation is not patentable in isolation, the court opined that the process for curing rubber, which incorporates in it a more efficient solution of the equation is patentable.

Test

Though the court tried to indicate a common line of reasoning with Gottschalk and Parker cases, the test adopted by it in this case is different from those cases. The test used by the court in this case is whether the invention containing the program as a whole produces a patentable result. This test removed lot of uncertainty by taking a wholistic view, but failed to differentiate between patentable and non-patentable computer programs.

D. Freeman-Walter-Abele test

 After Diehr, the US Courts followed the Freeman-Walter-Abele test for some time. The test involved a two-step analysis of the claimed invention[27]. First, the court determined whether a mathematical algorithm is recited directly or indirectly in the claimed invention. If yes, the court then checked whether the claimed invention is directed to a mathematical algorithm that is applied to or limited by physical elements or process steps. If the algorithm were applied in one or more steps of an otherwise patentable process or one or more elements of a patentable product, the claimed invention would be patentable. If the claimed invention were limited to the mathematical algorithm, it would not be patentable. This test was abandoned after Alappat’s decision.

E. In re Alappat[28]

The case relates to a dispute over the patentability of an invention, which is a means for creating a smooth waveform display in a digital oscilloscope. The examiner rejected claims 15-19 of the patent application stating the claimed invention to be non-statutory subject matter. The Federal Circuit, which replaced CCPA as the patent appeals court, disagreed with the examiner and held the invention to be a machine, which falls under the scope of statutory subject matter.

Reasoning of the Court

The court in this case opined that the Supreme Court’s test for patentability of computer programs was not clear. So, it made an attempt to give lucidity by interpreting Diehr’s (useful result) decision to mean that any computer program producing a concrete, useful and tangible result is patentable. Based on this interpretation the court held the invention in this case, which is a computer program to create a smooth waveform in a digital oscilloscope, to be patentable as it produces a concrete useful and tangible result. The court looked at the programmed computer as a new machine, because it believed that a general-purpose computer in effect becomes a special purpose computer once it is programmed to perform particular functions pursuant to instructions from program software.

 Test

The Federal Circuit in this case coined the test being applied today by patent office and courts, which is the concrete-useful-tangible-result test. As per this test, a computer program is patentable if it produces a concrete, useful and tangible result. The court in this case looked at a computer containing a computer program as a new apparatus capable of producing a useful result. Though the test seems to be prima facie simple and clear, the meaning of the terms concrete and tangible remain unsettled.

F. State Street Bank v. Signature Financial Group[29]
The case involved a fight between Signature Financial Group, Inc (hereinafter called ‘Signature’) and State Street Bank and Trust Co. (hereinafter called ‘State Street’), over a patent directed to a data processing system for implementing an investment structure, which was developed for use in Signature’s business as an administrator and accounting agent for mutual funds. As its negotiations to get a license from Signature failed, State Street claimed patent invalidity stating that the data processing system falls outside the scope of patentable subject matter under section 101. The Federal Circuit reversed the ‘patent invalidity’ decision of District court of Massachusetts. In its decision, the federal circuit clearly stated that a process patent should not be held invalid merely on the ground that it involves a mathematical algorithm as long as it produces a concrete, useful and tangible result. It also clarified that there is no prohibition against business method patents.

Reasoning of the court.

The court construed claim 1 of the patent, which claims a machine, namely, a data processing system for managing a financial services configuration of a portfolio established as a partnership and went on to determine whether the claim fell under one of the judicially created exceptions to statutory subject matter, which are, ‘mathematical algorithm’ exception and ‘business method. exception.

Mathematical Algorithm exception
The court started its reasoning by stating that Mathematical algorithm exception is an expansion of the law against patentability of abstract ideas. It reiterated the decision in Diamond v. Diehr, where the court explained that certain types of mathematical subject matter, standing alone, represent nothing more than abstract ideas until reduced to some type of practical application i.e. a useful, concrete and tangible result. The court further stated that the Freeman-Walter-Abele test has very little significance after the Chakrabarty and Diehr decisions of supreme court. It cited In re Alappat, where the court held the use of Freeman-Walter-Abele test to be misleading because the existence of an algorithm in an invention wouldn’t render it unpatentable even if it was not involved in a practical application. It further went on to state that When a claim containing a mathematical formula implements or applies that formula in a structure or process which, when considered as a whole, is performing a function which the patent laws were designed to protect (e.g., transforming or reducing an article to a different state or thing), then the claim satisfies the requirements of patentable subject matter. The court went on to say that It is irrelevant that a claim may contain, as part of the whole, subject matter which would not be patentable by itself. “A claim drawn to subject matter otherwise statutory does not become nonstatutory simply because it uses a mathematical formula, computer program or digital computer.” Finally, the court concluded that the proscription against patentability is limited to algorithms standing alone and not to any inventions involving them. Based on this reasoning the Federal Circuit held that the mere existence of an algorithm/computer program in Signature’s patent wouldn’t make it unpatentable.
Business Method exception
The Court held that there is no business method exception and the notion or exception is ill-conceived. It took the support of Judge Newman statement where he said that the business method exception is an unwarranted encumbrance to the definition of statutory subject matter, that should be discarded as error-prone, redundant, and obsolete and that it merits retirement from the glossary of statutory subject matter. The court stated that patentability does not turn on whether the claimed method does “business” instead of something else, but on whether the method, viewed as a whole, meets the requirements of patentability as set forth the Patent Act. Based on the aforementioned analysis, the court said that Signature’s patent cannot be held invalid based on it being a business method.

Test

In State Street, the court reiterated the test coined in Alappat’s case. It defined practical application as defined in Diehr to mean concrete, useful and tangible result. Courts and PTO are following this test to determine patentability of computer programs.
It can be seen from the decisions that the test for patentability of computer programs has gone a long way from the once applied mental steps and function of a machine tests to today’s Concrete-Useful-Tangible result test. Despite genuine efforts, US Courts haven’t been able to arrive at a lucid and certain test to determine patentability of computer programs. All the tests, including the test being applied today are fraught with ambiguity and uncertainty.

Indian Patent Law and Computer Programs
Indian Patent Law is governed by the Indian Patent Act of 1970 as amended in 1999, 2002 and 2005. In India, unlike in USA, there is a provision proscribing the patentability of computer programs. Section 3 of the Indian Patent Act as amended in 2002 provides under clause (k) that a mathematical or business method or a computer program per se or algorithm is not a patentable invention[30]. Indian Government made an attempt to change this in 2004 through the patent amendment ordinance by providing under section 3 (k) that a computer program producing a technical application to industry or a computer program in combination with hardware is patentable. But the attempt was short lived as the government-repealed ordinance through an amendment Act in March 2005.
Though the section lays down a blanket prohibition on the patentability of computer programs, it extends to only computer programs standing alone (‘per se’). The clause can be and would most probably be interpreted to mean that an invention would be patentable despite the presence of a computer program as one of its elements, if the invention as a whole includes something more than the computer program that is eligible for patent protection.
The Manual of Patent Examining Procedures (MPEP), which lays down guidelines to be followed by patent examiners during the process of examination deals with patentability of computer programs under Chapter I[31]. Though MPEP is not binding law, it is the document that defines the patentability of an invention until challenged before a court of law. As patent examiners follow the MPEP while determining patentability, an analysis of its provisions is very relevant. The Manual provides that a computer program is not patentable, irrespective of it being expressed as software or firmware as it is a set of instructions for controlling a sequence of operations of a data processing system, which closely resembles a mathematical method.
It states that an invention in which the technological advance is nothing more than a computer program is not patentable if the computer is suitable for the particular purpose without special adoption or modification of hardware or organization. However, if the format of the program, or nature of the record medium necessitates some non-standard adaptation to the computer itself, the invention as a whole including the computer program would be patentable. The Manual further provides that an invention which relates to a particular manner of organizing the overall operation of the Central Processing Unit and the peripheral units, regardless of whether the invention is implemented by means of a program or special hardware facilities is patentable.
The MPEP also provides that an invention including a computer program would be patentable if its operation requires an internal modification to the computer, which doesn’t amount to mere rearrangement. A novel invention relating to the internal operations of a computer is patentable, even if it involves a computer program. The Manual further provides that a hardware performing a novel function is not patentable. However, an invention constituting of hardware along with computer program to perform its function may be patentable.

Test

The test as per MPEP is whether the computer program necessitates any changes in the hardware or whether the program is embedded in the hardware. If yes, the computer program is patentable else it is not. This is a straightforward test as MPEP has clearly specified circumstances that would warrant patent protection.

Part II

Form-Function analysis

Parameters such as speed, automaticity, accuracy and efficiency have been recognized as elements of computer programs that can make such programs do much more than mimicking the functions of the human mind[32]. Innovation in computer programs manifests itself in a continuum of form and function. Its expression might be in either form or function or both in variable proportions. For the purpose of discussion in this article, the word “form” means the construct/arrangement of the parts of the product and the word “function” means the incremental improvement that a software program provides in any of the mentioned parameters namely speed, automaticity, efficiency and accuracy.
Courts in US have been laying differential emphasis on form and function for determining patentability of computer programs. Initially the courts used the mental steps doctrine and function of a machine doctrine to determine patentability of computer programs[33]. Both the doctrines focused on form and gave little or no importance to function, while deciding on patentability. The doctrines postulated that function performed by a computer program is least important and that the physical result, i.e. the form it produces is important. In Prater and Bernhart, the courts eliminated both the aforementioned doctrines and looked at a computer containing an unobvious computer program as a new and improved machine. This perspective gave very high importance to function and little importance to form. Even if there was no change in form, the program was patentable as long as it performed new function. This is a total reversal from the earlier point of view.
The test used by the court in Gottschalk gave primary importance to function by looking for substantial practical application while deciding patentability of a computer program. Parker’s case used existence of inventive concept or inventive application to test patentability. By doing so, it relied on both form and function.
In Diehr, the US Supreme Court gave more importance to function performed by the computer program under the garb of using the mathematical method exception. The court explicitly mentioned that as long as a computer program produces a useful result it is patentable. Here the court gave importance to both function and form, though more emphasis seems to have been laid on function.
The Freeman-Walter-Abele test, which was applied after Diehr reverted back to the physical result produced by a computer program. This test gave importance to both form and function. However, primary emphasis of this test was on form and function was a secondary consideration.
Finally, the Concrete-Useful-Tangible-Result test from Alappat and State Street Bank gave full importance to function and very little importance to form. This decision has opened gates to a number of software patents based on function without any relevance to form.
The Indian patent regime allows patents for only embedded software and computer programs prompting changes in hardware. This test gives paramount importance to form and very little importance to function, which makes the scope of software patentability very narrow.
Analysis of various tests for patentability of computer programs indicates that the courts have been applying form and function variably. Such an application gives rise to uncertainty and ambiguity among inventors in the software Industry, potentially impeding the progress of invention in the field. Non-consideration or variable consideration of either form or function would result in closing doors to patenting of inventions manifesting in the parameter, which has not been or has been variably considered. So, it is important to give proper weightage to both form and function for testing patentability of computer programs because all inventions in the software field manifest in either form or function or both and such a test would cover all patent worthy inventions.

Part III

Form and Function approach

A program that provides significant benefits in any one or both the parameters (form and function) can be thought of adding patentable value to the solution. As computer programs produce results in the nature of both form and function, both parameters should be considered in testing their patentability. Most tests have focused only on either form or function. Even in the tests where courts used both form and function, primary emphasis was laid on only one parameter. All tests used by courts till date failed to cover the entire innovation process in computer programs.

Form-Function Model

The form-Function model proposes that any reliable test to determine patentability has to consider both form and function in order to cover the complete continuum of innovation in software. Such a test would promote progress in the Industry by removing ambiguities in software patenting. The model points out approximate levels of form and function that might be sufficient for a computer program to merit patent protection. This model is proposed to be applied in addition to the other patentability requirements (patentable subject matter, usefulness, novelty, nonobviousness and specification).

The picture above shows a way of looking at an invention involving software either wholly or as a part of the subject matter for determining its patentability. As shown in the picture, the model classifies subject matter into four quadrants based on the contribution to invention from “form” and “function”. Patentability of any computer program depends on which quadrant it falls under.
Under Quadrant 1, the contribution from both “form” and “function” is low. An invention would not be patentable if it falls under this quadrant because the amount of innovation would be too small to warrant patent protection. For example, the invention in Gottschalk, which involved a computer program for converting Binary Coded Decimal numerals to Decimal numerals falls under quadrant 1. This invention has very small function and no form.
An invention falling under Quadrant 2 has high form and low function and vice versa for an invention falling under Quadrant 3 (low form and high function). A computer program falling under both the Quadrants would be patentable, as the cumulative impact of both form and function would make the innovation sufficient to merit patent protection. An example of an invention under Quadrant 2 is a process for molding synthetic rubber, which involves the use of a computer program for calculating the mold time (Diamond v. Diehr case). This invention has very high form and low function. The function of the program is just automation of calculations, which can be performed manually. As the manifestation of innovation is high in terms of form the invention would get patent protection under the model. Illustration of invention falling under Quadrant 3 is the computer program in State Street case, which involves a program to a data processing system for implementing an investment structure. The invention has very high function, which is to make complicated calculations in order to assess profits or loses in mutual funds but no form. This computer program also would merit patent protection because the invention manifests as very high function, which is enough under the model despite non-existence of form.
Finally, Quadrant 4 shows innovation manifestation of high form and function in the computer program. Such programs are patentable prima facie. For example, embedded software to control temperature in microwave oven. Innovation in this program manifests as high function, which is calculating temperature levels and high form, which is activating hardware to control temperatures. The function and form in this case are high enough under the model to warrant patent protection.
Though it is difficult to draw lines between different quadrants and to determine the cumulation of form and function (mathematically) required to make the computer program inventive enough to credit patent protection, the model provides an objective criteria based on which a good test of patentability can be coined. It also provides an objective basis for the courts and patent offices to make their decisions on patentability of computer programs.
Tests for patentability used in US and India lie at two ends of the spectrum. The US test for patentability (Concrete-Useful-Tangible) covers Quadrants 3 and 4 but misses out inventions falling under Quadrant 2. The Indian test falls under Quadrant 4 and misses out inventions falling under Quadrants 2 and 3. Both US and India should think about tuning their laws and tests to cover all three quadrants. A test covering all three Quadrants would encourage invention and innovation in the software industry by extending the patent regime to credible inventions, which manifest themselves in the inventive spectrum of form and function.

Conclusion

Existing tests for patentability are not effective, as they do not consider the complete continuum of form and function, which is the expression of innovation in the software field. The test under the US Patent Law by focusing primarily on function leaves out inventions in software, which manifest as form. Computer program patentability test followed by Indian patent office gives high importance to form and function and in the process misses out inventions having high function or high form only. The courts, legislatures and patent offices in India and USA should try and follow a test using form function parameters, which would cover the complete spectrum of innovation manifesting as form or function or both. Cumulative or combined effect of both form and function would confer patents on worthy inventions, thus promoting progress in computer technology.

References

Articles:
1. James Bessen and Eric Maskin, Sequential Innovation, patents, and imitation, Working Paper Department of Economics, Massachusetts Institute of Technology, January 2000.
2. Radhika Tandon, Moving forward: patentability of software and business method patents, 6 Intell. Prop. L. Bull. 1, Spring, 2001.
3. Marc S. Hanish, Adrienne Yeung, David B. Ritchie, How are computer software inventions patentable?, 9-DEC Nev. Law. 12, December, 2001.
4. Jur Strobos, Stalking The Elusive Patentable Software: Are There Still Diehr or was it just a flook?, Harvard Journal of Law and Technology, Vol 6, Spring Issue, 1993.
Cases:
5. Diamond v. Diehr, 450 U.S. 175, (1981)
6. Gottschalk v. Benson, 409 U.S. 63 (1972) at 71.
7. Parker v. Flook, 437 U.S. 584 (1978).
8. In re Freeman, 573 F.2d 1237, 197 USPQ 464 (CCPA 1978);
9. In re Walter, 618 F.2d 758, 205 USPQ 397 (CCPA 1980);
10. In re Abele, 684 F.2d 902, 214 USPQ 682 (CCPA 1982).
11. In re Alappat, 33 F.3d 1526 (Fed. Cir. 1994).
12. State Street Bank v. Signature Financial Group, 149 F.3d 1368 (Fed. Cir. 1998)


Books referred:

  1. Herbert F. Schwartz, Patent Law and Practice, BNA Books A Division of The Bureau of National Affairs, Inc. (BNA), Washington, DC, Fourth Edition, 2003, 30 to 72.
  2. Chisum, Donald S.   Chisum, patents: a treatise on the law of patentability, validity, and infringement, Lexis Pub. Volume 1,  (1978)  (Updated by loose-leaf in 1999).
  3. P.Narayanan, Patent Law, Eastern Law house, India, 3rd edition, 1998, Nos.1-16 to 1-20
  4. Indian Patent Office, Manual of Patent examination and Practice

[1] Please contact the author at [email protected] for any questions or feedback.
[2] The terms software and ‘computer program’ used in this shall have the same meaning.
[3] Sequential Innovation, patents, and imitation, James Bessen and Eric Maskin, Working Paper Department of Economics, Massachusetts Institute of Technology, January 2000.
[4] MOVING FORWARD: PATENTABILITY OF SOFTWARE AND BUSINESS METHOD PATENTS, Radhika Tandon, 6 Intell. Prop. L. Bull. 1, Spring, 2001.
[5] HOW ARE COMPUTER SOFTWARE INVENTIONS PATENTABLE?, Marc S. Hanish, Adrienne Yeung, David B. Ritchie, 9-DEC Nev. Law. 12, December, 2001.
[6] 35 USC Sec. 101 (2003).
[7] Diamond v. Diehr, 450 U.S. 175, (1981) at 195.
[8] Id. at 195.
[9] Id. citing In re Bolongaro, 62 F.2d 1059, 1060, 20 CCPA (Pat.) 845, 846-847 (1933).
[10] Id. At 195.
[11] Diamond v. Diehr, 450 U.S. 175, (1981) at 197.
[12] Citing 33 Fed.Reg. 15609 (1968).
[13] Id. citing, In In re Tarczy-Hornoch, 397 F.2d 856, 55 CCPA (Pat.) 1441 (1968) (overruled ‘function of a machine’ doctrine) and In re Prater, 415 F.2d 1378, 56 CCPA (Pat.) 1360 (1968) (overruled ‘mental steps’ doctrine).
[14] Diamond v. Diehr, 450 U.S. 175, (1981) at 198.
[15] 417 F.2d 1395, 57 CCPA (Pat.) 737 (1969).
[16] Id., at 1400, 57 CCPA (Pat.), at 744.
[17] Gottschalk v. Benson, 409 U.S. 63 (1972) at 71.,
Gottschalk v. Benson, 409 U.S. 63 (1972) at 72., Parker v. Flook, 437 U.S. 584 (1978)., Diamond v. Diehr, 450 U.S. 175, (1981) at 183.,In re Alappat, 33 F.3d 1526 (Fed. Cir. 1994)., State Street Bank v. Signature Financial Group, 149 F.3d 1368 (Fed. Cir. 1998).
[18] 409 U.S. 63 (1972).
[19] Gottschalk v. Benson, 409 U.S. 63 (1972) at 71.
[20] Gottschalk v. Benson, 409 U.S. 63 (1972) at 72.
[21] 437 U.S. 584, 585-86 (1978).
[22] Parker v. Flook, 437 U.S. 584 (1978).
[23] Id. at 585.
[24] 450 U.S. 175 (1981).
[25] Diamond v. Diehr, 450 U.S. 175, (1981) at 183.
[26] Diamond v. Diehr, 450 U.S. 175, (1981) at 184.
[27] In re Freeman, 573 F.2d 1237, 197 USPQ 464 (CCPA 1978); In re Walter, 618 F.2d 758, 205 USPQ 397 (CCPA 1980); In re Abele, 684 F.2d 902, 214 USPQ 682 (CCPA 1982).
[28] 33 F.3d 1526 (Fed. Cir. 1994).
[29] 149 F.3d 1368 (Fed. Cir. 1998).
[30] Section 3, Indian Patent Act, 1970 as amended in 2002.
[31] Para 1.3.8, Chapter I, MPEP.
[32] Stalking The Elusive Patentable Software: Are There Still Diehr or was it just a flook?, Jur Strobos, Harvard Journal of Law and Technology, Vol 6, Spring Issue, 1993.
[33] Diamond v. Diehr, 450 U.S. 175, (1981) at 195.

Source/Attribution here. (Governed by Creative Commons License CC BY – SA 2.0)

Leave a Comment

css.php