Kokologiannakis M, Marmanis I and Vafeiadis V. (2024). SPORE: Combining Symmetry and Partial Order Reduction. Proceedings of the ACM on Programming Languages. 8:PLDI. (1781-1803). Online publication date: 20-Jun-2024.

Tunç H, Deshmukh A, Cirisci B, Enea C and Pavlogiannis A. CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3. (223-238).

Chakraborty S, Krishna S, Mathur U and Pavlogiannis A. (2024). How Hard Is Weak-Memory Testing?. Proceedings of the ACM on Programming Languages. 8:POPL. (1978-2009). Online publication date: 5-Jan-2024.

https://doi.org/10.1145/3632908

Farzan A and Mathur U. (2024). Coarser Equivalences for Causal Concurrency. Proceedings of the ACM on Programming Languages. 8:POPL. (911-941). Online publication date: 5-Jan-2024.

https://doi.org/10.1145/3632873

Abdulla P, Atig M, Das S, Jonsson B and Sagonas K. (2024). Parsimonious Optimal Dynamic Partial Order Reduction. Computer Aided Verification. 10.1007/978-3-031-65630-9_2. (19-43).

https://link.springer.com/10.1007/978-3-031-65630-9_2

Albert E, de la Banda M, Gómez-Zamalloa M, Isabel M and Stuckey P. (2023). Optimal dynamic partial order reduction with context-sensitive independence and observers. Journal of Systems and Software. 202:C. Online publication date: 1-Aug-2023.

https://doi.org/10.1016/j.jss.2023.111730

Kokologiannakis M, Marmanis I and Vafeiadis V. Unblocking Dynamic Partial Order Reduction. Computer Aided Verification. (230-250).

https://doi.org/10.1007/978-3-031-37706-8_12

Coughlin N, Winter K and Smith G. (2022). Compositional Reasoning for Non-multicopy Atomic Architectures. Formal Aspects of Computing. 35:2. (1-30). Online publication date: 30-Jun-2023.

https://doi.org/10.1145/3574137

Tunç H, Abdulla P, Chakraborty S, Krishna S, Mathur U and Pavlogiannis A. (2023). Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proceedings of the ACM on Programming Languages. 7:PLDI. (761-785). Online publication date: 6-Jun-2023.

https://doi.org/10.1145/3591251

Bouajjani A, Enea C and Román-Calvo E. (2023). Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels. Proceedings of the ACM on Programming Languages. 7:PLDI. (565-590). Online publication date: 6-Jun-2023.

https://doi.org/10.1145/3591243

Cook V, Peterson C, Painter Z and Dechev D. (2022). Quantifiability: a concurrent correctness condition modeled in vector space. Computing. 105:5. (955-978). Online publication date: 1-May-2023.

https://doi.org/10.1007/s00607-022-01092-3

Abdulla P, Atig M, Krishna S, Gupta A and Tuppe O. Optimal Stateless Model Checking for Causal Consistency. Tools and Algorithms for the Construction and Analysis of Systems. (105-125).

https://doi.org/10.1007/978-3-031-30823-9_6

Deligiannis P, Senthilnathan A, Nayyar F, Lovett C and Lal A. Industrial-Strength Controlled Concurrency Testing for Programs with . Tools and Algorithms for the Construction and Analysis of Systems. (433-452).

https://doi.org/10.1007/978-3-031-30820-8_26

Fan H, Sun Z and He F. (2023). Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models. ACM Transactions on Programming Languages and Systems. 45:1. (1-37). Online publication date: 31-Mar-2023.

https://doi.org/10.1145/3579835

Abdulla P, Atig M, Bønneland F, Das S, Jonsson B, Lång M and Sagonas K. (2023). Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. Automated Technology for Verification and Analysis. 10.1007/978-3-031-45332-8_9. (176-198).

https://link.springer.com/10.1007/978-3-031-45332-8_9

Sun Z, Fan H and He F. (2022). Consistency-preserving propagation for SMT solving of concurrent program verification. Proceedings of the ACM on Programming Languages. 6:OOPSLA2. (929-956). Online publication date: 31-Oct-2022.

https://doi.org/10.1145/3563321

Zennou R, Biswas R, Bouajjani A, Enea C and Erradi M. (2021). Checking causal consistency of distributed databases. Computing. 10.1007/s00607-021-00911-3. 104:10. (2181-2201). Online publication date: 1-Oct-2022.

https://link.springer.com/10.1007/s00607-021-00911-3

Fan H, Liu W and He F. Interference relation-guided SMT solving for multi-threaded program verification. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (163-176).

https://doi.org/10.1145/3503221.3508424

Kokologiannakis M, Marmanis I, Gladstein V and Vafeiadis V. (2022). Truly stateless, optimal dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 6:POPL. (1-28). Online publication date: 16-Jan-2022.

https://doi.org/10.1145/3498711

Awar N, Jain K, Rossbach C and Gligoric M. (2021). Programming and execution models for parallel bounded exhaustive testing. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-28). Online publication date: 20-Oct-2021.

https://doi.org/10.1145/3485543

Dura A, Reichenbach C and Söderberg E. (2021). JavaDL: automatically incrementalizing Java bug pattern detection. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-31). Online publication date: 20-Oct-2021.

https://doi.org/10.1145/3485542

Bui T, Chatterjee K, Gautam T, Pavlogiannis A and Toman V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-30). Online publication date: 20-Oct-2021.

https://doi.org/10.1145/3485541

Ishimwe D, Nguyen K and Nguyen T. (2021). Dynaplex: analyzing program complexity using dynamically inferred recurrence relations. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-23). Online publication date: 20-Oct-2021.

https://doi.org/10.1145/3485515

van der Berg F. LLMC: Verifying High-Performance Software. Computer Aided Verification. (690-703).

https://doi.org/10.1007/978-3-030-81688-9_32

Coti C, Petrucci L, Rodríguez C and Sousa M. (2021). Quasi-optimal partial order reduction. Formal Methods in System Design. 57:1. (3-33). Online publication date: 1-Jul-2021.

https://doi.org/10.1007/s10703-020-00350-4

He F, Sun Z and Fan H. Satisfiability modulo ordering consistency theory for multi-threaded program verification. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. (1264-1279).

https://doi.org/10.1145/3453483.3454108

Luo W and Demsky B. C11Tester: a race detector for C/C++ atomics. Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. (630-646).

https://doi.org/10.1145/3445814.3446711

Coughlin N, Winter K and Smith G. (2021). Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory Models. Formal Methods. 10.1007/978-3-030-90870-6_16. (292-310).

https://link.springer.com/10.1007/978-3-030-90870-6_16

Kokologiannakis M and Vafeiadis V. (2021). GenMC: A Model Checker for Weak Memory Models. Computer Aided Verification. 10.1007/978-3-030-81685-8_20. (427-440).

https://link.springer.com/10.1007/978-3-030-81685-8_20

Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A and Toman V. (2021). Stateless Model Checking Under a Reads-Value-From Equivalence. Computer Aided Verification. 10.1007/978-3-030-81685-8_16. (341-366).

https://link.springer.com/10.1007/978-3-030-81685-8_16

Mathur U, Pavlogiannis A and Viswanathan M. The Complexity of Dynamic Data Race Prediction. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. (713-727).

https://doi.org/10.1145/3373718.3394783

Lång M and Sagonas K. (2020). Parallel Graph-Based Stateless Model Checking. Automated Technology for Verification and Analysis. 10.1007/978-3-030-59152-6_21. (377-393).

http://link.springer.com/10.1007/978-3-030-59152-6_21

Zennou R, Atig M, Biswas R, Bouajjani A, Enea C and Erradi M. (2020). Boosting Sequential Consistency Checking Using Saturation. Automated Technology for Verification and Analysis. 10.1007/978-3-030-59152-6_20. (360-376).

http://link.springer.com/10.1007/978-3-030-59152-6_20