Skip to content

LiskovSubstitutionPrincipleAnalyzers

David Arno edited this page Jul 18, 2016 · 1 revision

Warning: this wiki page is auto-generated by the Arnolyzer solution-build process. Do not directly edit this page, as your changes will be lost on the next commit. To edit this page, please refer to Contributing to this project.

These wiki pages reflect the state of the project in development, per the last commit. For details of the latest release of the Arnolyzer Analysers, please see the Arnolyzer website.


Liskov Substitution Principle Analyzers

From the Liskov Substitution Principle article on Wikipedia:

Substitutability is a principle in object-oriented programming. It states that, in a computer program, if S is a subtype of T, then objects of type T may be replaced with objects of type S(i.e., objects of type S may substitute objects of type T) without altering any of the desirable properties of that program(correctness, task performed, etc.)

Implemented analyzers

Planned analyzers

There are no analyzers planned for this category.