Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
publications
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
Container Registry
Model registry
Operate
Environments
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
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Verified Software
publications
Commits
28bb7f11
Commit
28bb7f11
authored
3 years ago
by
Teresa Carbajo-Garcia
Browse files
Options
Downloads
Patches
Plain Diff
Update publications.bib
parent
5111132e
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
publications.bib
+22
-0
22 additions, 0 deletions
publications.bib
with
22 additions
and
0 deletions
publications.bib
+
22
−
0
View file @
28bb7f11
...
...
@@ -1853,6 +1853,28 @@ certificate of correctness. We provide a prototype implementation and we report
on some textbook examples.}
,
}
@Article
{
DOsualdo2020TaDa
,
author
=
{Emanuele D'Osualdo and
Azadeh Farzan and
Philippa Gardner and
Julian Sutherland}
,
title
=
{TaDA Live: Compositional Reasoning for Termination of Fine-grained
Concurrent Programs}
,
journal
=
{ACM Transactions on Programming Languages and Systems (TOPLAS), submitted Jan 2020; accepted 2021.}
,
year
=
{2021}
,
abstract
=
{We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of
blocking fine-grained concurrent programs. The crucial challenge is how to deal with abstract atomic blocking:
that is, abstract atomic operations that have blocking behaviour arising from busy-waiting patterns as found in,
for example, fine-grained spin locks. Our fundamental innovation is with the design of abstract specifications
that capture this blocking behaviour as liveness assumptions on the environment. We design a logic that
can reason about the termination of clients which use such operations without breaking their abstraction
boundaries, and the correctness of the implementations of the operations with respect to their abstract
specifications. We introduce a novel semantic model using layered subjective obligations to express liveness
invariants, and a proof system that is sound with respect to the model. The subtlety of our specifications and
reasoning is illustrated using several case studies.}
,
}
@InProceedings
{
Maksimovic2021Gillian
,
author
=
{Petar Maksimovic and
Sacha{-}{\'{E}}lie Ayoun and
...
...
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