Autori: F.L. Tiplea, C. Enea

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

Rezumat:

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.

Cuvinte cheie: verification, abstraction, data type

URL: http://www.springerlink.com/(jecnnh55vir4jb45l0xtcy55)/app/home/journal.asp?referrer=parent&backto=linkingpublicationresults,1:100460,1