Skip to content

Add lower bounds to iterated separating conjunctions #166

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.

Sign up for GitHub

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

Merged
cp526 merged 3 commits into from
Oct 26, 2026
Merged

Add lower bounds to iterated separating conjunctions #166

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
1c39545
Add lowerbounds for iterated separating conjunctions
moratorium08 Oct 26, 2026
a9604e5
Fix unnecessary diff
moratorium08 Oct 26, 2026
43c35a4
Fix another unnecessary diff
moratorium08 Oct 26, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions src/exercises/array_init.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,14 @@
void array_init (char *p, unsigned int n)
/*@ requires take A = each(integer i; i < n) {
/*@ requires take A = each(integer i; 0 <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
ensures take A_post = each(integer i; i < n) {
ensures take A_post = each(integer i; 0 <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
@*/
{
unsigned int j = 0;
while (j < n)
/* --BEGIN-- */
/*@ inv take Ai = each(integer i; i < n) {
/*@ inv take Ai = each(integer i; 0 <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
{p} unchanged;
{n} unchanged;
Expand Down
6 changes: 3 additions & 3 deletions src/exercises/array_init_rev.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,14 @@
void array_init_rev (char *p, unsigned int n)
/*@ requires take A = each(integer i; i < n) {
/*@ requires take A = each(integer i; 0 <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
ensures take A_post = each(integer i; i < n) {
ensures take A_post = each(integer i; 0 <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
@*/
{
unsigned int j = 0;
while (j < n)
/* --BEGIN-- */
/*@ inv take Al = each(integer i; i < n-j) {
/*@ inv take Al = each(integer i; 0 <= i && i < n-j) {
RW<char>( array_shift<char>(p, i)) };
take Ar = each(integer i; n-j <= i && i < n) {
RW<char>( array_shift<char>(p, i)) };
Expand Down
4 changes: 2 additions & 2 deletions src/exercises/array_load.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
unsigned int read (unsigned int *p, unsigned int n, unsigned int i)
/*@ requires take A = each(integer j; j < n)
/*@ requires take A = each(integer j; 0 <= j && j < n)
{ RW<unsigned int>(array_shift<unsigned int>(p,j)) };
i < n;
ensures take A_post = each(integer j; j < n)
ensures take A_post = each(integer j; 0 <= j && j < n)
{ RW<unsigned int>(array_shift<unsigned int>(p,j)) };
return == A[i];
@*/
Expand Down
Loading