Rank Predicates vs. Progress Measures in Concurrent-Program Verification (1996)

Cached

Download Links

by Moshe Y. Vardi
Citations:2 - 1 self

Active Bibliography

Rabin Measures – Nils Klarlund, Dexter Kozen, Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, Tetsuo Asano, Vassos Hadzilacos, David Peleg, Laszl Babai, Juris Hartmanis, Andrew Pitts, Eric Bach, Maurice Herlihy, James Royer, Stephen Brookes, Stephen Homer, Alan Selman, Jin-yi Cai, Neil Immerman, Nir Shavit, Anne Condon, Paris Kanellakis, Eva Tardos, Cynthia Dwork, Howard Karlooe, Sam Toueg, Philip Klein, Moshe Vardi, Ronald Fagin, Phokion Kolaitis, Jennifer Welch - 1995
2 The Limit View of Infinite Computations – Nils Klarlund, Nils Klarlund - 1994
[ii] Chicago Journal of Theoretical Computer Science 1995-3Rabin Measures – Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, Tetsuo Asano, Vassos Hadzilacos, David Peleg, Laszló Babai, Juris Hartmanis, Andrew Pitts, Eric Bach, Maurice Herlihy, James Royer, Stephen Brookes, Stephen Homer, Alan Selman, Jin-yi Cai, Neil Immerman, Nir Shavit, Anne Condon, Paris Kanellakis, Eva Tardos, Cynthia Dwork, Howard Karloff, Sam Toueg, Philip Klein, Moshe Vardi, Ronald Fagin, Phokion Kolaitis, Jennifer Welch, Lance Fortnow, Stephen Mahaney, Pierre Wolper, Steven Fortune, Michael Merritt, Nils Klarlund, Dexter Kozen - 1995
3 Separating fairness and well-foundedness for the analysis of fair discrete systems – Amir Pnueli, Andreas Podelski, Andrey Rybalchenko - 2005
90 Transition Invariants – Andreas Podelski, Andrey Rybalchenko
A Simple Characterization of Stuttering Bisimulation – Stuttering Bisimulation, Kedar S. Namjoshi - 1997
1 Ameliorating the State Space Explosion Problem – Kedar Sharad Namjoshi, Kedar Sharad Namjoshi - 1998
Digital Object Identifier 10.4230/LIPIcs.CSL.2011.553 Forty Years Ago – Johann A. Makowsky
1 Verifying Liveness by Augmented Abstraction – Yonit Kesten, Amir Pnueli - 1999
ERRATA TO THE POPL’09 PAPER “VERIFYING LIVENESS OF ASYNCHRONOUS PROGRAMS” – Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
2 A.: Verifying liveness for asynchronous programs – Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko - 2009
98 Complexity Limitations on Quantum Computation – Lance Fortnow, John Rogers - 1997
16 Proving That Non-Blocking Algorithms Don’t Block – Alexey Gotsman, Byron Cook, Matthew Parkinson, Viktor Vafeiadis
4 Liveness-Preserving Atomicity Abstraction ⋆ – Alexey Gotsman, Hongseok Yang
34 Proving that programs eventually do something good – Byron Cook, Andrey Rybalchenko - 2007
3 Logics and analyses for concurrent heap-manipulating programs – Alexey Gotsman - 2009
9 Convergence of Iteration Systems – Anish Arora, Paul Attie, Michael Evangelist, Mohamed GOUDA - 1993
4 Formalizing Inductive Proofs of Network Algorithms – Ramesh Bharadwaj, Amy Felty, Frank Stomp - 1995
4 An Improved Lower Bound for the Complementation of Rabin Automata – Yang Cai, Ting Zhang, Haifeng Luo