Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:
Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT
Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:
- wie das Wort verwendet wird
- Häufigkeit der Nutzung
- es wird häufiger in mündlicher oder schriftlicher Rede verwendet
- Wortübersetzungsoptionen
- Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
- Etymologie
Was (wer) ist Liskov - definition
Liskov substitution principle
![Liskov substitution was introduced by [[Barbara Liskov]], photo taken in 2010](https://commons.wikimedia.org/wiki/Special:FilePath/Barbara Liskov MIT computer scientist 2010.jpg?width=200 "Liskov substitution was introduced by [[Barbara Liskov]], photo taken in 2010")
OBJECT-ORIENTED PROGRAMMING PRINCIPLE STATING 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 WITHOUT ALTERING ANY OF THE DESIRABLE PROPERTIES OF THE PROGRAM (CORRECTNESS, ETC.)
Liskov Substitution Principle; Substitutability; Liskov substitution
The Liskov substitution principle (LSP) is a particular definition of a subtyping relation, called strong behavioral subtyping, that was initially introduced by Barbara Liskov in a 1988 conference keynote address titled Data abstraction and hierarchy. It is based on the concept of "substitutability" a principle in object-oriented programming stating that an object (such as a class) and a sub-object (such as a class that extends the first class) must be interchangeable without breaking the program.
Liskov substitution principle
OBJECT-ORIENTED PROGRAMMING PRINCIPLE STATING 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 WITHOUT ALTERING ANY OF THE DESIRABLE PROPERTIES OF THE PROGRAM (CORRECTNESS, ETC.)
Liskov Substitution Principle; Substitutability; Liskov substitution
<programming, theory> (LSP) The principle that
object-oriented functions that use pointers or
references to a base class must be able to use objects of
a derived class without knowing it.
Barbara Liskov first wrote it as follows: If for each object
o1 of type S there is an object o2 of type T such that for all
programs P defined in terms of T, the behaviour of P is
unchanged when o1 is substituted for o2 then S is a subtype
of T.
A function that violates the LSP uses a reference to a base
class and must know about all the derivatives of that base
class. Such a function violates the open/closed principle
because it must be modified whenever a new derivative of the
base class is created.
[Liskov, B. Data Abstraction and Hierarchy, SIGPLAN
Notices. 23(5), May 1988 ].
(2001-09-14)
Disk encryption theory
Disk encryption is a special case of data at rest protection when the storage medium is a sector-addressable device (e.g.
