Behavioral Institutions and Refinements in Generalized Hidden Logics

Простая страница элемента
dc.creatorMartins,Manuel
dc.date2006
dc.date.accessioned2024-02-06T12:54:40Z
dc.date.available2024-02-06T12:54:40Z
dc.descriptionWe investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract algebraic logic theory of hidden heterogeneous deductive systems (called hidden k-logics) to the algebraic specification of object oriented programs. This is achieved through the Leibniz congruence relation and its combinatorial properties. We reformulate the notion of hidden k-logic as well as the behavioral logic of a hidden k-logic as institutions. We define refinements as hidden signature morphisms having the extra property of preserving logical consequence. A stricter class of refinements, the ones that preserve behavioral consequence, is studied. We establish sufficient conditions for an ordinary signature morphism to be a behavioral refinement.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-012-08-1020
dc.identifierhttps://lib.jucs.org/article/28648/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9106
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 12(8): 1020-1049
dc.subjecthidden logics
dc.subjectLeibniz congruence
dc.subjectbehavioral equivalence relation
dc.subjectbehavioral logic
dc.subjectinstitutions
dc.subjectrefinements
dc.subjectbehavioral refinements
dc.titleBehavioral Institutions and Refinements in Generalized Hidden Logics
dc.typeResearch Article
Файлы
Коллекции
Публикации в журналах НИЯУ МИФИ