Namratha Gangamreddypalli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Namratha Gangamreddypalli has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Constantin Enea
LIX, CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
2 shared publications Shaz Qadeer
Microsoft
1 shared publication- Shaz Qadeer
LIX Ecole Polytechnique CNRS and Institut Polytechnique de Paris France
1 shared publication
Latest Publications
- Open Access
- 10 April 2026
- Published by Springer Nature
- p. 252-282
Reduction for Structured Concurrent Programs
- 10 April 2026
- Published by Springer Nature
- p. 252-282
Open AccessReduction for Structured Concurrent Programs
- Open Access
Reduction for Structured Concurrent Programs
Commutativity reasoning based on Lipton's movers is a powerful technique for verification of concurrent programs. The idea is to define a program transformation that preserves a subset of the initial set of interleavings, which is sound modulo reorderings of commutative actions. Scaling commutativity reasoning to routinely-used features in software systems, such as procedures and parallel composition, remains a significant challenge. In this work, we introduce a novel reduction technique for structured concurrent programs that unifies two key advances. First, we present a reduction strategy that soundly replaces parallel composition with sequential composition. Second, we generalize Lipton's reduction to support atomic sections containing (potentially recursive) procedure calls. Crucially, these two foundational strategies can be composed arbitrarily, greatly expanding the scope and flexibility of reduction-based reasoning. We implemented this technique in Civl and demonstrated its effectiveness on a number of challenging case studies, including a snapshot object, a fault-tolerant and linearizable register, the FLASH cache coherence protocol, and a non-trivial variant of Two-Phase Commit.
Open AccessReduction for Structured Concurrent Programs
Commutativity reasoning based on Lipton's movers is a powerful technique for verification of concurrent programs. The idea is to define a program transformation that preserves a subset of the initial set of interleavings, which is sound modulo reorderings of commutative actions. Scaling commutativity reasoning to routinely-used features in software systems, such as procedures and parallel composition, remains a significant challenge. In this work, we introduce a novel reduction technique for structured concurrent programs that unifies two key advances. First, we present a reduction strategy that soundly replaces parallel composition with sequential composition. Second, we generalize Lipton's reduction to support atomic sections containing (potentially recursive) procedure calls. Crucially, these two foundational strategies can be composed arbitrarily, greatly expanding the scope and flexibility of reduction-based reasoning. We implemented this technique in Civl and demonstrated its effectiveness on a number of challenging case studies, including a snapshot object, a fault-tolerant and linearizable register, the FLASH cache coherence protocol, and a non-trivial variant of Two-Phase Commit.