Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Abstractions of Data Types

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în revistã ştiinţificã

Autori: F.L. Tiplea, C. Enea

Editorial: Springer-Verlag, Acta Informatica, 42 (8-9), p.639-671, 2006.


Want create site? Find Free WordPress Themes and plugins.

The use of abstraction in the context of abstract data types, is investigated. Properties to be checked are formulas in a first order logic under Kleene’s 3-valued interpretation. Abstractions are defined as pairs consisting of a congruence and a predicate interpretation. Three types of abstractions are considered, (forall,forall), (forall,exists), and (exists,forall), and for each of
them corresponding property preservation results are established. An abstraction refinement property is also obtained. It shows how one can pass from an existing abstraction to a (less) finer one.
Finally, equationally specified abstractions in the context of equationally specified abstract data types are discussed and exemplified.

Did you find apk for android? You can find new Free Android Games and apps.

Cuvinte cheie: verification, abstraction, data type