A Study of the Fragile Base Class Problem¶
Mikhajlov, L., & Sekerinski, E. (1998). A Study of the Fragile Base Class Problem. Lecture Notes in Computer Science.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Liskov Substitution Principle
- The same contract discipline is what the fragile base class problem turns on from the other side: Mikhajlov and Sekerinski prove formally how far inheritance must be constrained before a base class can safely be replaced by a revision without damaging the extensions and client code written against it — a refinement-calculus result over constructed examples, not a count of failures in deployed codebases
This sourceMikhajlov and Sekerinski's formal study of the fragile base class problem, which works through five constructed examples, extends the refinement calculus to class refinement, and proves a flexibility theorem fixing how far inheritance must be disciplined before a base class can safely be replaced by a revision without damaging its extensions; it measures nothing in any deployed codebase.
SupportedVerified against the source
- The same contract discipline is what the fragile base class problem turns on from the other side: Mikhajlov and Sekerinski prove formally how far inheritance must be constrained before a base class can safely be replaced by a revision without damaging the extensions and client code written against it — a refinement-calculus result over constructed examples, not a count of failures in deployed codebases
Mechanisms¶
- Inheritance Lint or Static Analysis
- The deeper hazard it can only hint at is the fragile base class problem — a base change silently breaking descendants — which lives in runtime semantics the static graph cannot see.
This sourceDefines the fragile base class problem in which an apparently safe base-class revision can damage inherited extensions.
- The deeper hazard it can only hint at is the fragile base class problem — a base change silently breaking descendants — which lives in runtime semantics the static graph cannot see.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3f7a73a4e95b · see in the full table