A category theoretic formalism for abstract interpretation

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator Panangaden, Prakash
Other Author Mishra, Prateek
Title A category theoretic formalism for abstract interpretation
Date 1984
Description We present a formal theory of abstract interpretation based on a new category theoretic formalism. This formalism allows one to derive a collecting semantics which preserves continuity of lifted functions and for which the lifting functon is itself continuous. The theory of abstract interpretation is then presented as an approximation of this collecting semantics. The use of categories rather than compete partial orders eliminates the need for introducing two distinct partial orders and for introducing any closure operation on the allowable elements, as is necessary with powerdomains. Furthermore, our construction can be applied to any situation for which the underlying domains are complete partial orders, since the domains are not further restricted in any way. This formalism can be applied to first order languages.
Type Text
Publisher University of Utah
First Page 1
Last Page 24
Subject Formal theory; Theoretic formalism; Lifted functions
Subject LCSH Formal methods (Computer science)
Language eng
Bibliographic Citation Panangaden, P., & Mishra, P. (1984). A category theoretic formalism for abstract interpretation. 1-24. UUCS-84-005.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,464,236 bytes
Identifier ir-main,16026
ARK ark:/87278/s6sb4ptn
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-22
ID 702249
Reference URL https://collections.lib.utah.edu/ark:/87278/s6sb4ptn
Back to Search Results