Compositional Verification of Concurrent C Programs with Search Structure Templates-Reference-Cited by-同舟云学术

Compositional Verification of Concurrent C Programs with Search Structure Templates

Published:2024-01-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Nguyen Duc-Than¹,Beringer Lennart²,Mansky William¹,Wang Shengyi²

Affiliation:

1. University of Illinois at Chicago, Chicago, USA

2. Princeton University, Princeton, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3636501.3636940

Reference25 articles.

1. Andrew W. Appel , Robert Dockins , Aquinas Hobor , Lennart Beringer , Josiah Dodds , Gordon Stewart , Sandrine Blazy , and Xavier Leroy . 2014. Program Logics for Certified Compilers . Cambridge University Press . isbn:110704801X Andrew W. Appel, Robert Dockins, Aquinas Hobor, Lennart Beringer, Josiah Dodds, Gordon Stewart, Sandrine Blazy, and Xavier Leroy. 2014. Program Logics for Certified Compilers. Cambridge University Press. isbn:110704801X

2. Theorems for free from separation logic specifications

3. Pedro da Rocha Pinto , Thomas Dinsdale-Young , and Philippa Gardner . 2014 . TaDA: A Logic for Time and Data Abstraction. In ECOOP 2014 – Object-Oriented Programming, Richard Jones (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg. 207–231. isbn:978-3-662-44202-9 Pedro da Rocha Pinto, Thomas Dinsdale-Young, and Philippa Gardner. 2014. TaDA: A Logic for Time and Data Abstraction. In ECOOP 2014 – Object-Oriented Programming, Richard Jones (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 207–231. isbn:978-3-662-44202-9

4. Compass: strong and compositional library specifications in relaxed memory separation logic

5. Yotam MY Feldman , Artem Khyzha , Constantin Enea , Adam Morrison , Aleksandar Nanevski , Noam Rinetzky , and Sharon Shoham . 2020 . Proving Highly-Concurrent Traversals Correct . Proceedings of the ACM on Programming Languages, 4, OOPSLA (2020), 1–29. Yotam MY Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, and Sharon Shoham. 2020. Proving Highly-Concurrent Traversals Correct. Proceedings of the ACM on Programming Languages, 4, OOPSLA (2020), 1–29.