Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
Actris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
tlsomers
Actris
Commits
8afdb110
Commit
8afdb110
authored
5 years ago
by
jihgfee
Browse files
Options
Downloads
Patches
Plain Diff
Some updates to comments
parent
56a4744f
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
theories/channel/channel.v
+5
-4
5 additions, 4 deletions
theories/channel/channel.v
theories/channel/proto_model.v
+4
-4
4 additions, 4 deletions
theories/channel/proto_model.v
theories/examples/sort.v
+3
-1
3 additions, 1 deletion
theories/examples/sort.v
with
12 additions
and
9 deletions
theories/channel/channel.v
+
5
−
4
View file @
8afdb110
...
@@ -9,13 +9,14 @@ determines the polarity of the endpoints.
...
@@ -9,13 +9,14 @@ determines the polarity of the endpoints.
The [send] primitive takes such an endpoint abstraction and adds an element to
The [send] primitive takes such an endpoint abstraction and adds an element to
the first buffer under the lock. Conversely [recv] loops until there is
the first buffer under the lock. Conversely [recv] loops until there is
something in the second, locking during each peek.
something in the second buffer, which it pops and returns, locking during
each peek.
The specifications are defined in terms of the logical connectives [is_chan]
The specifications are defined in terms of the logical connectives [is_chan]
and [chan_own], which respectively determines the contents of a channel and
and [chan_own], which respectively determines the contents of a channel using
the ownership of it.
a lock over an invariant and the ownership of it using ghost fragments
over buffers.
*)
*)
From
iris
.
heap_lang
Require
Import
proofmode
notation
.
From
iris
.
heap_lang
Require
Import
proofmode
notation
.
From
iris
.
heap_lang
.
lib
Require
Import
spin_lock
.
From
iris
.
heap_lang
.
lib
Require
Import
spin_lock
.
From
iris
.
algebra
Require
Import
excl
auth
list
.
From
iris
.
algebra
Require
Import
excl
auth
list
.
...
...
This diff is collapsed.
Click to expand it.
theories/channel/proto_model.v
+
4
−
4
View file @
8afdb110
(** This file defines the model of Dependent Separation Protocols,
(** This file defines the model of Dependent Separation Protocols,
along with various operations on the connective, such as append
along with various operations on the connective, such as append
and map.
and map
and the necessary typeclass instances
.
Dependent Separation Protocols can ultimately be expressed as:
Dependent Separation Protocols can ultimately be expressed as:
proto := 1 + (B * (V -> (▶ proto -> PROP) -> PROP))
proto := 1 + (B * (V -> (▶ proto -> PROP) -> PROP))
...
@@ -10,9 +10,9 @@ Here the left-hand side of the sum is the terminal protocol
...
@@ -10,9 +10,9 @@ Here the left-hand side of the sum is the terminal protocol
where B is the canonical representation of actions determining
where B is the canonical representation of actions determining
whether the protocol sends or receives, and
whether the protocol sends or receives, and
(V -> (▶ proto -> PROP) -> PROP) is a continuation that
(V -> (▶ proto -> PROP) -> PROP) is a continuation that
depends on
a
communicated value V and the dependent tail
depends on
the
communicated value V and the dependent tail
(▶ proto -> PROP) from protocols guarded under laters
,
(▶ proto -> PROP) from protocols guarded under laters
to the
to the
propositions of the logic.
propositions of the logic.
The type is defined as a solution to a recursive domain
The type is defined as a solution to a recursive domain
equation, as it is self-referential under the guard of ▶.
equation, as it is self-referential under the guard of ▶.
...
...
This diff is collapsed.
Click to expand it.
theories/examples/sort.v
+
3
−
1
View file @
8afdb110
(** This file implements a distributed Merge Sort,
(** This file implements a distributed Merge Sort,
a specification thereof and its proofs. *)
a specification thereof and its proofs, including
a variant in which the comparison function is sent
over the channel. *)
From
stdpp
Require
Import
sorting
.
From
stdpp
Require
Import
sorting
.
From
actris
.
channel
Require
Import
proto_channel
proofmode
.
From
actris
.
channel
Require
Import
proto_channel
proofmode
.
From
iris
.
heap_lang
Require
Import
proofmode
notation
.
From
iris
.
heap_lang
Require
Import
proofmode
notation
.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment