tag:blogger.com,1999:blog-5382571416341492754.post1074833131378916920..comments2019-06-16T08:01:16.011-04:00Comments on Blogface.org: Proof of Soundness for a Typestate Checker with LocksNelshttp://www.blogger.com/profile/07085287093689227850noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-5382571416341492754.post-14276154183500484352010-04-16T10:23:22.204-04:002010-04-16T10:23:22.204-04:00Thanks, yes this will all be true of my heap invar...Thanks, yes this will all be true of my heap invariant, since at it's core my language is Java-like. But my heap invariant will preserve additional properties as well (e.g., the locks that are currently held, the abstract state an object is in) because of the additional properties our type system enforces.<br /><br />Thanks!Nelshttps://www.blogger.com/profile/07085287093689227850noreply@blogger.comtag:blogger.com,1999:blog-5382571416341492754.post-49484926718965979342010-04-14T01:24:11.739-04:002010-04-14T01:24:11.739-04:00If you define a heap as a mapping from addresses t...If you define a heap as a mapping from addresses to expressions (or values), then a well-typed heap is a heap that is associated with a mapping from addresses to types, where each value at an address has the corresponding type in the "heap typing". <br /><br />Your preservation proof should state that the resulting heap after the step has the same "heap tying" or has a "heap typing" that is an extension of the previous one.Anonymousnoreply@blogger.com