2022
DOI: 10.1145/3498689
|View full text |Cite
|
Sign up to set email alerts
|

Simuliris: a separation logic framework for verifying concurrent program optimizations

Abstract: Today’s compilers employ a variety of non-trivial optimizations to achieve good performance. One key trick compilers use to justify transformations of concurrent programs is to assume that the source program has no data races : if it does, they cause the program to have undefined behavior (UB) and give the compiler free rein. However, verifying correctness of optimizations that exploit this assumption is a non-trivial problem. In particula… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(1 citation statement)
references
References 42 publications
0
1
0
Order By: Relevance
“…Separation logic: Relational separation logics have been developed on top of Iris for a range of properties, such as contextual refinement [38], [43], [50], [51], simulation [52]- [54], and security [55]- [57]. The representation of the righthand side program as a resource is a recurring idea, but our technical construction with run ahead is novel.…”
Section: Related Workmentioning
confidence: 99%
“…Separation logic: Relational separation logics have been developed on top of Iris for a range of properties, such as contextual refinement [38], [43], [50], [51], simulation [52]- [54], and security [55]- [57]. The representation of the righthand side program as a resource is a recurring idea, but our technical construction with run ahead is novel.…”
Section: Related Workmentioning
confidence: 99%