62 citations · 104 across the 15 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2023
Commutativity Simplifies Proofs of Parameterized Programs
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Commutativity has proven to be a powerful tool in reasoning about concurrent programs. Recent work has shown that a commutativity-based reduction of a program may admit simpler pro…
cs.PL2006★ 21 cited
On Verifying Complex Properties using Symbolic Shape Analysis
Thomas Wies, Viktor Kuncak, Karen Zee +2
One of the main challenges in the verification of software systems is the analysis of unbounded data structures with dynamic memory allocation, such as linked data structures and a…