Skip to content
Snippets Groups Projects
Commit 6189bd83 authored by Pedro da Rocha Pinto's avatar Pedro da Rocha Pinto
Browse files

Minor

parent 6bc29022
No related branches found
No related tags found
No related merge requests found
......@@ -554,7 +554,7 @@ Building on separation logic with concurrent abstract predicates (CAP), we intro
Year = {2017},
Month = {April},
Abstract = {Despite recent advances in reasoning about concurrent data structure libraries, the largest implementations in \texttt{java.util.concurrent} have yet to be verified. The key issue lies in the development of modular specifications, which provide clear logical boundaries between clients and implementations. A solution is to use recent advances in fine-grained concurrency reasoning, in particular the introduction of abstract atomicity to concurrent separation logic reasoning. We present two specifications of concurrent maps, both providing the clear boundaries we seek. We show that these specifications are equivalent, in that they can be built from each other. We show how we can verify client programs, such as a concurrent set and a producer-consumer client. We also give a substantial first proof that the main operations of \texttt{ConcurrentSkipListMap} in \texttt{java.util.concurrent} satisfy the map specification. This work demonstrates that we now have the technology to verify the largest implementations in \texttt{java.util.concurrent}.},
Abstract = {Despite recent advances in reasoning about concurrent data structure libraries, the largest implementations in java.util.concurrent have yet to be verified. The key issue lies in the development of modular specifications, which provide clear logical boundaries between clients and implementations. A solution is to use recent advances in fine-grained concurrency reasoning, in particular the introduction of abstract atomicity to concurrent separation logic reasoning. We present two specifications of concurrent maps, both providing the clear boundaries we seek. We show that these specifications are equivalent, in that they can be built from each other. We show how we can verify client programs, such as a concurrent set and a producer-consumer client. We also give a substantial first proof that the main operations of ConcurrentSkipListMap in java.util.concurrent satisfy the map specification. This work demonstrates that we now have the technology to verify the largest implementations in java.util.concurrent.},
Project = { concurrency, tada }
}
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment