Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Brief Of Amicus Curiae Interdisciplinary Research Team On Programmer Creativity In Support Of Respondent, Ralph D. Clifford, Firas Khatib, Trina Kershaw, Kavitha Chandra, Jay Mccarthy
Brief Of Amicus Curiae Interdisciplinary Research Team On Programmer Creativity In Support Of Respondent, Ralph D. Clifford, Firas Khatib, Trina Kershaw, Kavitha Chandra, Jay Mccarthy
Faculty Publications
This brief answers the two primary issues that are associated with the first question before the Court. First, the programmers’ expression of the Java-based application programmer interfaces (“APIs”) are sufficiently creative to satisfy that requirement of copyright law. Second, the idea expression limitation codified in Section 102(b) of Copyright Act does not establish that the APIs are ideas. Both of these assertions are supported by the empirical research undertaken by the Research Team. This brief expresses no opinion on the resolution of the fair use question that is also before the Court.
Random Numbers, Chaos Theory, And Cogitation: A Search For The Minimal Creativity Standard In Copyright Law, Ralph D. Clifford
Random Numbers, Chaos Theory, And Cogitation: A Search For The Minimal Creativity Standard In Copyright Law, Ralph D. Clifford
Faculty Publications
This article explores the second type of expressive work, those where there is a question if the author’s contribution is qualitatively sufficient, to determine how much creativity and of what type is required to sustain a copyright. Initially, the historic standards of creativity use before Fiest was decided in 1991 will be presented. Then, after a brief discussion of Fiest, the scientific basis of creativity will be explored. Next, the confusion regarding creativity that exists in the lower courts will serve to expose the source of misapplication of the law – a disconnect between how courts perceive creativity and …
Modular Verification Of Timed Circuits Using Automatic Abstraction, Eric G. Mercer, Chris Myers, Hao Zheng
Modular Verification Of Timed Circuits Using Automatic Abstraction, Eric G. Mercer, Chris Myers, Hao Zheng
Faculty Publications
The major barrier that prevents the application of formal verification to large designs is state explosion. This paper presents a new approach for verification of timed circuits using automatic abstraction. This approach partitions the design into modules, each with constrained complexity. Before verification is applied to each individual module, irrelevant information to the behavior of the selected module is abstracted away. This approach converts a verification problem with big exponential complexity to a set of subproblems, each with small exponential complexity. Experimental results are promising in that they indicate that our approach has the potential of completing much faster while …