Computer Science – Logic in Computer Science
Scientist
Computer Science
Logic in Computer Science
Scientist
LIAFA
A Logic of Reachable Patterns in Linked Data-Structures
Logical Characterizations of Heap Abstractions
Simulating reachability using first-order logic with applications to verification of linked data structures
No associations
LandOfFree
Mooly Sagiv does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Mooly Sagiv, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mooly Sagiv will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-250347