Skip to content
Snippets Groups Projects
Commit cdf1146b authored by Gian Ntzik's avatar Gian Ntzik
Browse files

Updated index page adding citation links

parent 647d0d20
No related branches found
No related tags found
No related merge requests found
_site _site
.sass-cache .sass-cache
.jekyll-metadata .jekyll-metadata
vendor
.bundle/config
...@@ -14,6 +14,7 @@ exclude: ...@@ -14,6 +14,7 @@ exclude:
- Rakefile - Rakefile
- .gitlab-ci.yml - .gitlab-ci.yml
- README.md - README.md
- vendor
collections: collections:
people: people:
......
...@@ -11,7 +11,8 @@ We have to take shared state that is being changed by multiple threads into acco ...@@ -11,7 +11,8 @@ We have to take shared state that is being changed by multiple threads into acco
Our research agenda is to develop formal reasoning methods about concurrency with a focus on concurrent program logics. Our research agenda is to develop formal reasoning methods about concurrency with a focus on concurrent program logics.
Recently, there have been various logics based on separation logic to verify functional correctness of fine-grained concurrent programs. Recently, there have been various logics based on separation logic to verify functional correctness of fine-grained concurrent programs.
We have played a significant role introducing Concurrent Abstract Predicates, the Views framework, TaDA, CoLoSL, Fault-tolerant Concurrent Separation Logic and Total-TaDA. We have played a significant role introducing {% cite_details Dinsdale-Young2010Concurrent --text Concurrent Abstract Predicates %}, the {% cite_details Dinsdale-Young2013Views --text Views framework %}, {% cite_details RochaPinto2014TaDA --text TaDA %}, {% cite_details Raad2015CoLoSL --text CoLoSL %}, {% cite_details Ntzik2015Fault --text Fault-tolerant Concurrent Separation Logic %} and {% cite_details RochaPinto2016Modular --text Total-TaDA %}.
These logics have tackled a range of problems, ranging data abstraction, atomicity abstraction, fault-tolerance, terminal, as well as introducing more modular and compositional ways to reason about concurrent programs. These logics have tackled a range of problems, ranging data abstraction, atomicity abstraction, fault-tolerance, terminal, as well as introducing more modular and compositional ways to reason about concurrent programs.
We have applied these logics to verify large problems, such as data structures used in databases and java.util.concurrent, as well as specifying file systems. We have applied these logics to verify large problems, such as data structures used in databases and java.util.concurrent, as well as specifying file systems.
We aim to continue improving the state-of-the-art with a focus on progress properties, specifying concurrency in POSIX filesystems, continuing improving our logics to tackle more advanced algorithms, and develop automated reasoning tools based on these logics. We aim to continue improving the state-of-the-art with a focus on progress properties, specifying concurrency in POSIX filesystems, continuing improving our logics to tackle more advanced algorithms, and develop automated reasoning tools based on these logics.
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