Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
P
publications
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
9
Issues
9
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
CI / CD
Repository
Value Stream
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
PSVG
publications
Commits
f8673b6e
Commit
f8673b6e
authored
Sep 08, 2020
by
Teresa Carbajo-Garcia
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update publications.bib
parent
4b55e372
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
26 additions
and
1 deletion
+26
-1
publications.bib
publications.bib
+26
-1
No files found.
publications.bib
View file @
f8673b6e
...
...
@@ -1832,7 +1832,32 @@ author = {Emanuele D'Osualdo and
title
=
{(Submitted) TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs}
,
year
=
{2020}
,
}
@InProceedings
{
DOsualdoS2020Decidable
,
author
=
{Emanuele D'Osualdo and
Felix Stutz}
,
editor
=
{Igor Konnov and
Laura Kov{\'{a}}cs}
,
title
=
{Decidable Inductive Invariants for Verification of Cryptographic Protocols
with Unbounded Sessions}
,
booktitle
=
{31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)}
,
series
=
{LIPIcs}
,
volume
=
{171}
,
pages
=
{31:1--31:23}
,
publisher
=
{Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}
,
year
=
{2020}
,
url
=
{https://doi.org/10.4230/LIPIcs.CONCUR.2020.31}
,
doi
=
{10.4230/LIPIcs.CONCUR.2020.31}
,
abstract
=
{We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied
π-calculus, with applications to automatic verification of stateful cryptographic protocols with
unbounded sessions/nonces. Since the problem is undecidable in general, we introduce depth-bounded
protocols, a strict generalisation of a class from the literature, for which our decidable analysis is
sound and complete. Our core contribution is a procedure to check that an invariant is inductive,
which implies that every reachable configuration satisfies it. Our invariants can capture security
properties like secrecy, can be inferred automatically, and represent an independently checkable
certificate of correctness. We provide a prototype implementation and we report on its performance
on some textbook examples.}
,
}
@Comment{jabref-meta: databaseType:bibtex;}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment