Skip to content

Minor doc fixes #7677

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

Merged
merged 1 commit into from
Apr 21, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
3 changes: 1 addition & 2 deletions doc/cprover-manual/memory-primitives.md
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ pointers as having 64 bits. This can be changed by various options (see section

Memory is represented in CBMC as a set of objects. Each object represents a
contiguous sequence of bytes and is identified via a numeric object ID. For
example, assuming integers of width 4 and chars of with 1, a global integer
example, assuming integers of width 4 and chars of width 1, a global integer
variable would correspond to an object of size 4, and memory allocated via
`malloc(10)` would correspond to an object of size 10.

Expand Down Expand Up @@ -273,4 +273,3 @@ programs.

<sup>1</sup> Pointers with negative offsets never point to memory objects.
Negative values are used internally to detect pointer underflows.

Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ While quantified expressions with arbitrary Boolean expressions are supported wi
Concretely, with the SAT backend, the following syntax must be used for quantifiers:

```
__CPROVER_forall { *id* *type*; *range* => *boolean expression* }
__CPROVER_forall { *id* *type*; *range* ==> *boolean expression* }
__CPROVER_exists { *id* *type*; *range* && *boolean expression* }
```

Expand Down