A Formal Semantics for Finalizers

dc.creatorLeal,Marcus
dc.creatorIerusalimschy,Roberto
dc.date2005
dc.date.accessioned2024-02-06T12:53:46Z
dc.date.available2024-02-06T12:53:46Z
dc.descriptionAutomatic finalization is a common but inherently complex language facility that makes the garbage collection process semantically visible to client programs. With finalizers, memory management becomes more flexible, and garbage collectors can be used to recycle other resources in addition to memory. Formal language models usually ignore garbage collection, and therefore are unable to properly describe finalization. In this paper we use an operational approach to develop a new abstract model that explicitly represents memory management actions in a garbage­collected programming language based on the λ­calculus. We formally state and prove several important properties related to memory management, and employ the model to describe and explore a semantics for finalizers.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-011-07-1198
dc.identifierhttps://lib.jucs.org/article/28441/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8807
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 11(7): 1198-1214
dc.subjectmemory management
dc.subjectgarbage collection
dc.subjectfinalization
dc.subjectsemantics
dc.titleA Formal Semantics for Finalizers
dc.typeResearch Article
Файлы
Коллекции