Show simple item record

dc.contributor.authorWebber, Adam Brooksen_US
dc.date.accessioned2007-04-23T16:36:17Z
dc.date.available2007-04-23T16:36:17Z
dc.date.issued1992-12en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1319en_US
dc.identifier.urihttps://hdl.handle.net/1813/6215
dc.description.abstractRelational constraint is a new method for fast semantic analysis of computer programs. It starts with a fixed, finite vocabulary of binary relations; for each data type this vocabulary forms a complete lattice. Relational constraint focuses on strengthening relations in this lattice, developing the strongest correct statement it can about the relation between any two objects in its universe. The relational constraint algorithm runs in $O(n^{2})$ time. In this paper, we discuss the motivation for this research, present the algorithm in detail, and show how it fits in the formal framework of abstract interpretation.en_US
dc.format.extent2670916 bytes
dc.format.extent717619 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRelational Constraint: A Fast Semantic Analysis Techniqueen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics