1 citations · 1 across the 2 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.PL2015★ 1 cited
Compositional Invariant Generation via Linear Recurrence Analysis
Azadeh Farzan, Zachary Kincaid
This paper presents a new method for automatically generating numerical invariants for imperative programs. Given a program, our procedure computes a binary input/output relation o…