-
Notifications
You must be signed in to change notification settings - Fork 76
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Make meet in AddressDomain more precise #1468
Open
michael-schwarz
wants to merge
7
commits into
master
Choose a base branch
from
issue_1467
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+94
−3
Open
Changes from 3 commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
7186571
Typo
michael-schwarz c1b7284
Add `amenable_to_meet` and test for it
michael-schwarz 3eff22f
Make comparison of pointers amenable to `meet` if they only differ in…
michael-schwarz dc2a9c3
Restore linebreak for odoc
michael-schwarz b7265e7
Add more intricate example (with TODO for refinement of both sides)
michael-schwarz 3fcb562
Merge branch 'master' into issue_1467
michael-schwarz 8af2e49
For elements in the same bucket, perform meet
michael-schwarz File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
30 changes: 30 additions & 0 deletions
30
tests/regression/13-privatized/89-write-lacking-precision.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,30 @@ | ||
// PARAM: --set ana.base.privatization write | ||
#include<pthread.h> | ||
struct a { | ||
char* b; | ||
}; | ||
|
||
struct a *c; | ||
struct a h = {""}; | ||
struct a i = {"string"}; | ||
|
||
void* d(void* args) { | ||
struct a r; | ||
if (c->b) { | ||
__goblint_check(strlen(h.b) == 0); // Should also work for write! | ||
} | ||
} | ||
|
||
int main() { | ||
int top; | ||
|
||
if(top) { | ||
c = &h; | ||
} else { | ||
c = &i; | ||
} | ||
|
||
pthread_t t; | ||
pthread_create(&t, 0, d, 0); | ||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
//PARAM: --enable ana.int.interval | ||
#include <stdio.h> | ||
#include <stdlib.h> | ||
#include <time.h> | ||
|
||
|
||
int main() { | ||
int arr[20]; | ||
|
||
int top; | ||
|
||
int i = 2; | ||
if(top) { | ||
i = 8; | ||
} | ||
|
||
int* imprecise = &arr[i]; | ||
|
||
if(imprecise == &arr[2]) { | ||
__goblint_check(imprecise == &arr[2]); | ||
sim642 marked this conversation as resolved.
Show resolved
Hide resolved
|
||
} | ||
|
||
return 0; | ||
} |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Don't the address set buckets already guarantee this to only be called in such cases because
Mval.top_indices
are the representatives?There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Even if the buckets guarantee this already, this function can be called with two arbitrary addresses, so we can not just return true.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
That's true, although it could just be an implementation detail (like the buckets themselves are), which isn't exposed to the outside by the interface. Then such misuse would be impossible.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I followed this assumption now to just assume that things placed into the same bucket are amenable to meet, which seems to be the case in our implementation and I think also makes sense semantically.
This largely simplifies the implementation and makes all sorts of extra considerations obsolete.