Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lovro Rozic

dblp:165/6849 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 39% Program verification · 30% Programming languages and type systems · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › program specification
declarative specification
0.412019
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models · Proc. ACM Program. Lang. 2019
Program verification
modular verification
0.412019
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models · Proc. ACM Program. Lang. 2019
Concurrent programming › memory models
weak memory models
0.412019
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models · Proc. ACM Program. Lang. 2019
Concurrent programming
memory models
0.112019
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models · Proc. ACM Program. Lang. 2019

Methods — techniques the papers use, named apart from their topics

declarative framework · 0.4compositional verification · 0.4
YearPublicationVenuePosition
2019 On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
abstract
Concurrent libraries are the building blocks for concurrency. They encompass a range of abstractions (locks, exchangers, stacks, queues, sets) built in a layered fashion: more advanced libraries are built out of simpler ones. While there has been a lot of work on verifying such libraries in a sequentially consistent (SC) environment, little is known about how to specify and verify them under weak memory consistency (WMC). We propose a general declarative framework that allows us to specify concurrent libraries declaratively, and to verify library implementations against their specifications compositionally. Our framework is sufficient to encode standard models such as SC, (R)C11 and TSO. Additionally, we specify several concurrent libraries, including mutual exclusion locks, reader-writer locks, exchangers, queues, stacks and sets. We then use our framework to verify multiple weakly consistent implementations of locks, exchangers, queues and stacks.
Azalea Raad, Marko Doko, Lovro Rozic, Ori Lahav 0001, Viktor Vafeiadis
Proc. ACM Program. Lang.3