Abstraction orientated property of software and its relation to patentability

https://doi.org/10.1016/S0950-5849(98)00057-3Get rights and content

Abstract

It is often discussed that software possesses some unique properties different from other engineering products, which make it difficult to fit into the framework of legal protection by the patent law. This paper focuses on one of the salient properties of software, i.e. its orientation towards abstraction and generalization.

First, we clarify the concept of abstraction in software and algorithms: what it means and how important it is. Then, we take a case study of the example problem presented at the SOFTIC Symposium '93 and show that the efforts made to write patentable claims for software-related inventions are being targeted towards the opposite of this abstraction/generalization direction. Lastly, we make discussions based on the above observations and present our opinion.

References (8)

  • D. Chisum

    The patentability of algorithms

    University of Pittsburgh Law Review

    (1986)
  • League for Programming Freedom: Against Software Patents

    Communications of the ACM

    (1992)

    League for Programming Freedom: Against Software Patents

    Communications of the ACM

    (1992)
  • R.P. Merges et al.

    On the complex economics of patent scope

    Columbia Law Review

    (1990)
  • A. Newell

    The models are broken, the models are broken!

    University of Pittsburgh Law Review

    (1986)
There are more references available in the full text version of this article.

Cited by (0)

Tel.: +81 3 5454 6847; fax: +81 3 5454 6845.

View full text