Whelan v. Jaslow: When Software Copyright Reached Structure, Sequence, and Organization

Whelan v. Jaslow (3d Cir. 1986) stretched software copyright past literal code to structure, sequence, and organization, a high-water mark Altai later curbed.

A dental laboratory technician shaping a ceramic crown at a workbench surrounded by plaster models and instruments
A custom program for running a dental laboratory became the vehicle for the broadest software copyright test an appellate court has ever adopted. Shutterstock
Educational content, not legal advice. This article explains general legal concepts. It does not create an attorney–client relationship. For your specific situation, consult a licensed attorney.

Few copyright decisions have dominated an industry as quickly, or fallen as far, as Whelan Associates, Inc. v. Jaslow Dental Laboratory, Inc., 797 F.2d 1222 (3d Cir. 1986). Three years after the same court held in Apple Computer, Inc. v. Franklin Computer Corp. that object code and operating systems were copyrightable at all, the Third Circuit took the next and far more consequential step: it held that copyright in a computer program reaches past the literal code to the program’s structure, sequence, and organization. Under Whelan, a rival who never copied a single line could still infringe by replicating how a program was built.

The decision, written by Judge Edward Becker and issued on August 4, 1986, gave software owners the broadest protection any American appellate court has ever endorsed, and for roughly six years it set the terms of software copyright litigation nationwide. Then the Second Circuit’s Computer Associates International, Inc. v. Altai, Inc., 982 F.2d 693 (2d Cir. 1992), dismantled its reasoning, and the field moved on. Whelan remains essential reading precisely because of that arc: it defines the outer boundary of nonliteral software protection and explains why courts retreated from it.

At a glance

  • Case: Whelan Associates, Inc. v. Jaslow Dental Laboratory, Inc., 797 F.2d 1222 (3d Cir. 1986)
  • Decided: August 4, 1986 (argued March 3, 1986), before Judges Gibbons, Becker, and Rosenn; opinion by Judge Becker; district court judgment affirmed
  • Holding: Copyright protection for a computer program extends beyond literal code to its structure, sequence, and organization; the program’s purpose or function is its unprotectable idea, and everything not necessary to that purpose is protectable expression.
  • Status: Final, but doctrinally superseded in practice; Computer Associates v. Altai rejected its test in 1992, and the abstraction-filtration-comparison framework now governs nonliteral software infringement in most circuits.

The doctrinal setting: from CONTU to Apple v. Franklin

Congress brought computer programs into copyright deliberately but sparingly. The Copyright Act of 1976 protected “literary works” under 17 U.S.C. § 102(a), while § 102(b) excluded any “idea, procedure, process, system, method of operation” from protection. After the National Commission on New Technological Uses of Copyrighted Works (CONTU) delivered its 1978 report, Congress amended the Act in 1980 to add a definition of “computer program” to 17 U.S.C. § 101 and a limited user privilege in § 117, confirming that programs were copyrightable literary works.

What Congress never resolved was how far that protection went. The first wave of cases settled the threshold questions: in Apple Computer, Inc. v. Franklin Computer Corp., 714 F.2d 1240 (3d Cir. 1983), the Third Circuit held that operating systems and machine-readable object code were protectable. But literal copying of code is the easy case. The harder question, and the one worth real money, was whether a competitor could study a successful program and rebuild it: same file layouts, same modules, same flow of operations, in a new language for new hardware. That is a nonliteral copying question, and it turns entirely on where a court draws the line between idea and expression that Baker v. Selden, 101 U.S. 99 (1879), first sketched for utilitarian works. Whelan was the first appellate decision to draw that line for software.

A dental laboratory program and a partnership that soured

The facts were a small-business drama. Rand Jaslow ran Jaslow Dental Laboratory, a Pennsylvania maker of dental prosthetics, and wanted to computerize its bookkeeping, inventory, invoicing, and accounts receivable. In 1978 the lab engaged Strohl Systems Group, where an experienced programmer named Elaine Whelan designed a custom program called Dentalab, delivered around March 1979 and written in EDL (Event Driven Language) for the IBM Series/1 minicomputer. Whelan left Strohl in November 1979, formed Whelan Associates, and acquired the rights to Dentalab. In July 1980 Whelan Associates and Jaslow Lab signed a marketing arrangement under which the lab promoted Dentalab to other dental laboratories for 35 percent of sales.

The arrangement worked until Rand Jaslow decided he could capture the market himself. Beginning in May 1982, while still acting as Whelan’s sales representative with full access to Dentalab, he set out to create a version in BASIC that would run on inexpensive personal computers that EDL could not reach, eventually hiring a programmer to finish the job. In May 1983 he terminated the marketing agreement, and his new company, Dentcom, began selling the BASIC program as the Dentcom PC program. Jaslow sued first, in Pennsylvania state court, claiming misappropriation of trade secrets; Whelan Associates answered with a federal copyright action in the Eastern District of Pennsylvania. After a bench trial, the district court found that the Dentcom program was substantially similar to Dentalab, not in its code (the languages were entirely different) but in its structure and overall organization, and entered judgment for Whelan. The appeal presented a single, clean issue: can copyright infringement of a computer program rest on structural similarity alone?

Purpose as idea, everything else as expression

Judge Becker answered yes, and the way he got there mattered more than the result. The court reasoned from Baker v. Selden: in a utilitarian work, the elements necessary to the work’s purpose belong to the unprotectable idea, while elements that reflect one choice among many belong to protectable expression. From that premise the court announced its famous rule: the purpose or function of a utilitarian work is the work’s idea, and everything that is not necessary to that purpose or function is part of the expression of the idea. As the opinion put it, “where there are various means of achieving the desired purpose, then the particular means chosen is not necessary to the purpose; hence, there is expression, not idea.”

Applied to Dentalab, the idea was nothing more specific than the efficient operation of a dental laboratory. Because other programs on the market ran dental labs with very different internal designs, Dentalab’s particular file structures, screen outputs, and the interaction of its subroutines were all expression. The court leaned on expert testimony comparing five key subroutines (order entry, invoicing, accounts receivable, end-of-day, and end-of-month processing) and held that substantial similarity does not require a wholesale comparison of both programs; qualitative similarity in the most significant components suffices, just as lifting a novel’s plot can infringe even when no sentence matches. The court also rejected the analogy of data file structures to uncopyrightable blank forms, and it allowed screen displays as circumstantial evidence of similarity in the underlying code even though screens are a distinct category of work. An economic judgment ran underneath all of it: the court observed that the bulk of the cost of creating software lies in the design of its structure and logic rather than in the typing of code, so a copyright that stopped at literal code would protect the cheapest part of the work and leave the most valuable part free for the taking.

The rise and fall of the Whelan test

For the rest of the 1980s, Whelan was the gravitational center of software copyright. Courts extended its logic well beyond program internals; Broderbund Software v. Unison World, decided the same year, invoked it to protect the “total concept and feel” of screen layouts. Plaintiffs loved the test because it was nearly unloseable: once the “idea” is defined as the program’s overall purpose, everything below that altitude is expression, and any structural resemblance becomes actionable.

That breadth was exactly the problem. Commentators objected that the decision assumed each program embodies a single idea, when real software is a lattice of ideas, techniques, and constraints at every level, many dictated by efficiency, hardware, or standard practice rather than creative choice. The Second Circuit made those criticisms law in Computer Associates v. Altai, faulting Whelan for resting on a dated view of computer science and for slighting practical considerations. Altai replaced the one-question test with the abstraction-filtration-comparison method: dissect the program into levels of abstraction, filter out unprotectable elements (ideas, elements dictated by efficiency or external factors, and public-domain material), and compare only the protectable core that remains. The federal courts followed Altai almost unanimously, and the six-year Whelan era closed. What survives is the case’s foundational move, which Altai did not disturb: nonliteral elements of a computer program can be protected expression. Every modern software copyright fight, from Lotus v. Borland through Google LLC v. Oracle America, Inc., 141 S. Ct. 1183 (2021), proceeds on that premise while rejecting Whelan’s way of measuring it.

Open questions

Whelan left, and Altai inherited, a set of unresolved problems. The deepest is level of generality: calling “the efficient operation of a dental laboratory” the program’s only idea was a choice, not a deduction, and nothing in the opinion explains how to pick the right altitude at which purpose becomes idea. The Third Circuit has never formally repudiated Whelan, so its precedential status in that circuit remains technically open even though district courts there apply Altai-style filtration. The treatment of file structures and data formats as expression sits uneasily beside later interoperability cases. And the boundary between protectable structure and an unprotectable “method of operation” under § 102(b), the fault line in Lotus and again in Google v. Oracle, is still being negotiated; the Supreme Court in Google resolved the case on fair use rather than copyrightability, leaving the nonliteral protection Whelan opened up without a definitive ceiling.

Implications for creators and businesses

  • Nonliteral copying is still actionable. Whelan’s core survives: rewriting a competitor’s program in a new language for new hardware does not launder the copying. Clean-room procedures that isolate developers from the original’s design, not just its code, remain the standard protective practice.
  • Structure is where software value and software risk both live. The court’s economic insight holds up: architecture, data design, and workflow are the expensive parts of a program. Document independent design choices as you make them; that record is the difference between parallel development and inferred copying.
  • Do not rely on Whelan’s breadth in litigation. Courts now filter before they compare. Elements dictated by efficiency, external standards, hardware constraints, or common programming practice will be excluded, so an infringement theory built on high-level resemblance alone will usually fail under Altai.
  • Departing collaborators are the classic fact pattern. Whelan began as a distribution partnership in which the marketing partner had intimate access to the product and rebuilt it. Access plus a soured relationship is how most structural-copying cases start; contracts should say expressly who owns the software and what a departing partner may build next.

Frequently asked questions

What did Whelan v. Jaslow hold? The Third Circuit held that copyright protection for a computer program extends beyond its literal code to the program’s structure, sequence, and organization. The court treated the program’s overall purpose as its unprotectable idea and everything not necessary to that purpose as protectable expression, so a competing program written in a different language for different hardware could still infringe.

Is the Whelan structure, sequence, and organization test still good law? Not as a working test. Whelan has never been formally overruled in the Third Circuit, but the Second Circuit’s abstraction-filtration-comparison framework from Computer Associates v. Altai (1992) displaced it almost everywhere. Courts still recognize that nonliteral elements of software can be protected, which is Whelan’s enduring core, but they no longer use its one-idea-per-program rule to decide how much.

How does Whelan differ from Computer Associates v. Altai? Whelan asked a single question: is the disputed material necessary to the program’s purpose? If not, it was protectable expression. Altai instead breaks a program into levels of abstraction, filters out elements dictated by efficiency, external constraints, or the public domain, and compares only the protectable remainder. Altai criticized Whelan for assuming each program contains just one idea and for underweighting the functional realities of software.

Authorities and sources

Related guides

Lidiia Levitska
About the Author

Lidiia Levitska

International Intellectual Property Attorney

Lidiia Levitska focuses on intellectual property dispute resolution, policy, and advisory work across international institutions and government bodies. From 2021 to 2025 she served at the World Intellectual Property Organization (WIPO), managing arbitration cases and overseeing compliance with the Uniform Domain-Name Dispute-Resolution Policy (UDRP), and earlier led IP policy research as a Senior Policy Officer at the American Chamber of Commerce in Ukraine. She holds an LL.M. in International Intellectual Property Law from Chicago-Kent College of Law and an M.A. in Information Technology Law from the University of Tartu, and was admitted to the Ukrainian Bar in 2019.

More about Lidiia →