Benchmarks for POPL'24 Paper on Commutativity in Parameterized Program Proofs

Benchmark programs used in the POPL'24 paper "Commutativity Simplifies Proofs of Parameterized Programs" by Azadeh Farzan, D. Klumpp, and A. Podelski. The dataset is associated with a paper published in the Proceedings of the ACM on Programming Languages (POPL) in 2024. The archive is provided by the authors from the University of Toronto.

Use Cases

• Evaluating verification tools based on the benchmark programs described in the paper.
• Reproducing experimental results from the POPL'24 paper on commutativity.
• Developing new proof techniques for parameterized programs using the provided examples.

Strengths

• Directly associated with a peer-reviewed POPL 2024 publication, providing academic credibility.
• The benchmark programs are explicitly linked to a specific research contribution on commutativity.

Limitations

• Row count and dataset size are unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.
• Last update date is unknown; freshness unverified.

Provenance

Source

University of Toronto (authors: Azadeh Farzan, D. Klumpp, A. Podelski)

Collection Method

Created as part of the research for the POPL'24 paper.